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.
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.
