A Worked Example of Type Inference | OCaml Programming | Chapter 9 Video 45

preview_player
Показать описание
Putting together the entire HM type inference algorithm: collecting constraints, and solving them with unification

Рекомендации по теме
Комментарии
Автор

If your language were to have multiple integer types with different sizes, would you have to forego binding `+` in the initial env? And if so, would you just have to treat it like an ordinary function application to infer its type?

tophy