LYCOS RETRIEVER 
Lambda Calculus: Rules
built 606 days ago
The lambda calculus translates very directly into rules that can be applied by the language machine. Some additional rules provide a run-time environment for evaluating this representation of expressions in the lambda calculus. It is clear from inspection that the translated rules use only a subset of the matching and substituting capabilities of the language machine.
Source:
[A]nother normal-order interpreter for untyped lambda-calculus, implemented as a direct-style syntax-rule macro. This implementation is the shortest and the fastest one. It does no alpha-renaming directly and no substitutions directly. Everything is integrated with normalization, and everything is delayed until the latest possible moment. The source and the object languages of the calculator are regular Scheme terms. Lambda-abstractions for the calculator are ordinary lambda-forms of Scheme:
Source:
This project is to help you become better acquainted with the lambda calculus. The simplicity of its reduction rules will become apparent from coding them in ML. ML's pattern matching provides an ideal mechanism for implementing a list of reduction rules.
Source:
MORE ABOUT
Rules