This is an interpreter for lambda calculus based on Church's original paper.
(
(\p.((p (\x.(\y.y))) (\x.(\y.x))))
(\u.(\v.u))
)
Equivelent code in haskell
not True
NOT = (\p.((p (\x.(\y.y))) (\x.(\y.x))))
TRUE = (\u.(\v.u))
This project is build using stack.
git clone git@github.com:SaschaAlex/LambdaCalculus.git
cd ./LambdaCalculus
stack build
./UntypeBoy1.0.exe ./test.lambda