Media Summary: How to infer the type of `if` expressions in HM Achieving polymorphism for `let` expressions in HM How to infer the type of anonymous functions (lambdas) in HM
Finishing Type Inference Ocaml Programming - Detailed Analysis & Overview
How to infer the type of `if` expressions in HM Achieving polymorphism for `let` expressions in HM How to infer the type of anonymous functions (lambdas) in HM How to infer the type of function applications in HM How to add inference of `let` expressions to HM A "closure" is a data structure containing the code for a function, as well as the environment that "closes" off its free variables.
Recorded lecture for CSE 340 F16 on 10/21/16. We discussed hindley-milner The "unification" algorithm is how a set of equations is solved in HM How to infer the types of constants and names in HM Abstraction functions are...abstract. So how could you implement them? Conversion to strings is an example. Textbook: ...
