Media Summary: After HM type inference collects a set of constraints, they need to be solved to determine the types that are inferred. The intuition ... Putting together the entire HM type inference How to infer the type of `if` expressions in HM type inference Textbook:
Unification Algorithm Ocaml Programming Chapter 9 Video 44 - Detailed Analysis & Overview
After HM type inference collects a set of constraints, they need to be solved to determine the types that are inferred. The intuition ... Putting together the entire HM type inference How to infer the type of `if` expressions in HM type inference Textbook: The Hindley-Milner type inference (or reconstruction) What happens when HM type inference is over? Either a "principal type" is found, or a type error has been detected. Textbook: ... Achieving polymorphism for `let` expressions in HM type inference leads to "type schemes", which universally quantify over type ...
We review the psuedocode for a practical and working HM type inference of `let` expressions led to type schemes, which enabled polymorphism. Add mutability, though, could lead to a ... How to infer the types of constants and names in HM type inference Textbook: How to infer the type of anonymous functions (lambdas) in HM type inference Textbook: A "closure" is a data structure containing the code for a function, as well as the environment that "closes" off its free variables. How to define the substitution operation for simple expressions, including `if` and `let` Textbook:
Small- and big-step evaluation relations are themselves related: the big-step is an abstraction of the small-step Textbook: ... The HM type-inference relation adds a set of "collected constraints" to the type-checking relation Textbook: ... How to infer the type of function applications in HM type inference Textbook: The environment-model semantics of functions requires careful attention to scope Textbook:
