Little project in implementing some λ-calculus bits. What I'm planning to eventually do is to make:
- An untyped λ-calculus interpreter.
- A lisp->λ compiler with recursion for funsies.
- A simply-typed λ-calc interpreter.
I'm intending to follow the formal definitions as closely as possible. Maybe I'll rewrite this in Coq someday so I can prove some things about it formally 😛