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.
Open source project that offer summary and download services on this page is a project that carry out their development work on other open source development sites. Their work is linked to this page via a feature called OFI, and their work is not carried out here on OSDN site.
