Media Summary: A "closure" is a data structure containing the code for a function, as well as the environment that "closes" off its free variables. Defining the small-step semantics of `let` expressions, based on How to infer the type of `if` expressions in HM type inference Textbook:
Substitution Examples Ocaml Programming Chapter 9 Video 16 - Detailed Analysis & Overview
A "closure" is a data structure containing the code for a function, as well as the environment that "closes" off its free variables. Defining the small-step semantics of `let` expressions, based on How to infer the type of `if` expressions in HM type inference Textbook: Using pattern matching to access the pieces of a variant. Textbook: The "environment model" differs from the " Implementing the parsing of integer constants in the
Achieving polymorphism for `let` expressions in HM type inference leads to "type schemes", which universally quantify over type ... HM type inference of `let` expressions led to type schemes, which enabled polymorphism. Add mutability, though, could lead to a ... Compilers translate code from one language to another. Interpreters execute code. Virtual machines and just-in-time compilation ... The `function` keyword provides helpful syntactic sugar for pattern matching. Textbook: More about using pattern matching with variants. Textbook: How to implement `let` expressions, including
A comparison of big-step vs. small-step semantics, and
