lambda

Basic untyped lambda calculus interpreter. Running the program will drop you into a repl where you can type an expression in lambda calculus. Upon parsing this, you will be put into a new repl, where pressing enter will beta reduce the current term by one step. You can exit this by typing 'q' and pressing enter. I would recommend using rlwrap, as the repls are rather basic.