Media Summary: How to infer the type of `if` expressions 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 infer the type of anonymous functions (lambdas) in HM type inference Textbook:
Let Polymorphism Ocaml Programming Chapter 9 Video 48 - Detailed Analysis & Overview
How to infer the type of `if` expressions 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 infer the type of anonymous functions (lambdas) in HM type inference Textbook: What happens when HM type inference is over? Either a "principal type" is found, or a type error has been detected. Textbook: ... How to infer the type of function applications in HM type inference Textbook: How to infer the types of constants and names in HM type inference Textbook:
Implementing the type checker for a simple language: ` Using pattern matching to access the pieces of a variant. Textbook: Examples of pattern matching with lists, records, and tuples. Textbook: Comparing the difference between `open` and `include` in modules Textbook: In this tutorial, I will show the basic ideas of immutable lists (cons lists), as well as What looks like mutability in the toplevel is not -- it's really just a consequence of scope. Textbook: ...
Application of functions to "too few" of arguments, and syntactic sugar. Textbook: Modifying the parser and AST to incorporate type annotations on ` A substitution-model semantics for functions requires a notion of how to substitute inside the body of a function. Getting that right is ...
