dnlkrgr / lambda

interpreter for an untyped lambda calculus without the y-combinator
BSD 3-Clause "New" or "Revised" License
2 stars 1 forks source link

lambda

lambda is a small interpreter for the untyped lambda calculus without the Y-combinator. You can enter lambda expressions which are then evaluated to normal form.

How to run:

with nix + cabal:

only cabal:

stack:

Syntax for lambda expressions:

t := n | x | /x. t | $ t1 t2 | $ (t1) (t2)

whereby: