An implementation of the untyped lambda calculus, both in its syntax and semantics.
Some terms and term constructors code generation is provided for writing lambda terms as the following:
true = λx . λy $ x
false = λx . λy $ yThe project tests mainly check the solutions for these exercises, and some explanations are given in this other document.