Unification Algorithm Ocaml Programming Chapter

The "

After HM type inference collects a set of constraints, they need to be solved to determine the types that are inferred. The intuition ...

Not a required video , but in case you wanted to see an example of how

We review the psuedocode for a practical and working

How to infer the type of `if` expressions in HM type inference Textbook: https://cs3110.github.io/textbook.

So the results of this

9.

The Hindley-Milner type inference (or reconstruction)

Putting together the entire HM type inference

Building on our knowledge of

What happens when HM type inference is over? Either a "principal type" is found, or a type error has been detected. Textbook: ...

To use the toplevel effectively with modules, three new directives are needed: `#directory`, `#load`, and `#require`. Textbook: ...

How to infer the types of constants and names in HM type inference Textbook: https://cs3110.github.io/textbook.

How to infer the type of function applications in HM type inference Textbook: https://cs3110.github.io/textbook.

... talk about uh synthesis of a

Achieving polymorphism for `let` expressions in HM type inference leads to "type schemes", which universally quantify over type ...

https://icfp21.sigplan.org/details/minikanren-2021-papers/7/A-New-Higher-order-

In "Polymorphic Types and Effects with Boolean