|
About:
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.
Author:
Rafael 'Dido' Sevilla [contact developer]
Homepage:
http://combengine.sourceforge.net/
Tar/BZ2:
http://prdownloads.sourceforge.net/combengine/lazy-l-1.0.0.tar.bz2
Trove categories:
[change]
Dependencies:
[change]
OCaml (required)
[download links]
|
|
» Rating:
(not rated)
» Vitality: 0.00% (Rank 25448)
» Popularity: 0.20% (Rank 24231)

(click to enlarge graphs)
Record hits: 2,414
URL hits: 611
Subscribers: 4
|
|