| Wikipedia English The Free Encyclopedia | Download this dictionary |
Lambda calculus
In mathematical logic and computer science, lambda calculus, also λ-calculus, is a formal system designed to investigate function definition, function application, and recursion. It was introduced by Alonzo Church and Stephen Cole Kleene in the 1930s; Church used lambda calculus in 1936 to give a negative answer to the Entscheidungsproblem. Lambda calculus can be used to define what a computable function is. The question of whether two lambda calculus expressions are equivalent cannot be solved by a general algorithm. This was the first question, even before the halting problem, for which undecidability could be proved. Lambda calculus has greatly influenced functional programming languages, such as Lisp, ML and Haskell.
See more at Wikipedia.org...
This article uses material from Wikipedia® and is licensed under the GNU Free Documentation License
| FOLDOC Dictionary | Download this dictionary |