An interpreter of lambdacalculus.
It shows reduction process of lambda terms.
Several evaluation strategies are supported.
Output format can be selected from LaTex, plain text.
This is a collection of several simple functional languages all based on combinator graph reduction techniques for interpretation. For now there's only one package here: lazy-l, which is an interpreter for Alonzo Church's untyped lambdacalculus.