Lambda Calculus Interpreter/Compiler

Brief

We all saw Håkon take 20 minutes to show that map not [T, F] was [F, T] in lambda calculus. This project idea is to make a lambda calculus interpreter. The idea is that you can write in pure lambda calculus and it will reduce it for you.

Extensions

• Support bracket dropping

• Support unicode

• You could make it show the intermediate steps

• You could compile to SKI calculus

• You could make a full blown compiler.

Helpers

• megaparsec (Parsing library for human written inputs)