Lazy-L

Lazy-L is an interpreter for pure untyped lambda calculus using combinator graph reduction techniques. It is useful as a teaching tool for those studying combinator logic and lambda calculus.