lambda calculus
Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions.
Noun
- Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions.
- In the 1930s, while Turing was developing what are now called ‘Turing machines’ as a model for computation, Church and his student Kleene were developing a different model, called the ‘lambda calculus’ [29, 63]. While a...
Origin
Coined by Alonzo Church after the use of the Greek letter lambda (λ) as the basic abstraction operator in the calculus.
Forms
Related
calculus lambda lambda abstraction lambda expression combinator functionally complete recursive function Turing machine