Compiler Architecture Ocaml Programming Chapter 9 Video 2

Summary

Implementing the type checker for a simple language: `let` and `if` Textbook: cs3110.github.io/textbook. More about anonymous functions, aka lambdas. Textbook: cs3110.github.io/textbook. In a small-step semantics, an expression repeatedly takes a single step of evaluation until it reaches a value Textbook: ... Implementing the parsing of integer constants in the calculator interpreter. Textbook: cs3110.github.io/textbook. Implementing the correct "order of operations" for addition and multiplication in the calculator interpreter Textbook: ... Defining a small-step substitution-model semantics for a core fragment of The grammar of a language can be described in a notation known as "Backus-Naur Form" (BNF). The input to Menhir (or ... How to infer the type of function applications in HM type inference Textbook: cs3110.github.io/textbook. Using `let` definitions to bind values to names. Textbook: cs3110.github.io/textbook.