:lambda: calculus

[bh]

You could start here:

Can someone make a λ parser?

λx.x would turn into (using Lisp notation) (λ x x), (λx.x λy.λz.y) into (CALL (λ x x) (λ y (λ z y))), etc. It should also give some kind of result like ERROR (no list) if the input doesn't have the right syntax. If you have any questions about what it should do in some case I've overlooked, just ask me.