Interpreters-in-Ocaml
Interpreters for Call-by-Value and Call-by-name
- Consider a tiny language consisting of expressions that are e ::= x | \x.e | e_1 (e_2)
- The Krivine Machine (in closure form), that implements Call-by-Name semantics.
- The SECD machine that implements Call-by-Value semantics.