Interpreters-in-Ocaml

Interpreters for Call-by-Value and Call-by-name

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