Self-study on programming languages design and implementation
Self-study on programming languages design and implementation.
A naive implementation of capture avoiding substitution, weak head normal and normal form conversion, α- and β-equivalence.
The elementary REPL computes the normal form of an untyped λ-calculus expression.
$ stack build && stack exec pl-lab-exeλ> (\x y z. x z (y z)) (\x y. x) (\x y. x)λz. zλ> :q