LYCOS RETRIEVER 
Lambda Calculus
built 635 days ago
(It might be worth noting that in l-calculus the contents of a lambda form can get evaluated, to some extent, prior to the lambda form being invoked! This is called partial evaluation, and has some advantages (It’s essentially like being able to run code, to some extent, before you have any data/arguments to run it with!). LISP ... is not allowed to evaluate the contents of a lambda form until the lambda form gets applied.)
Source:
This is the "biggie" in terms of lambda-calculus theory. It states that it doesn't matter which reducable part of an expression you choose to apply beta reduction to. All choices eventually converge to a unique "normal form" (or go on endlessly!)
Source:
The code below implements a normal-order interpreter for the untyped lambda-calculus. The interpret permits "shortcuts" of terms. The shortcuts are not first class and do not alter the semantics of the lambda-calculus. Yet they make complex terms easier to define and apply.
Source:
LCI is an interpreter for the lambda calculus. It supports many advanced features like recursion, user-defined operators and multiple evaluation strategies, all based on the pure calculus. It is FREE SOFTWARE licenced under the GNU General Public Licence (GPL).
Source:
This is a literate Haskell code that defines and tests all four operations of arithmetics on positive and negative integers, in lambda-calculus. The code is meant to be evaluated by a practical lambda-calculator in Haskell.
Source:
MORE ABOUT
Lambda Calculus