Lambda calculus

Define Lambda calculus

Translate Lambda calculus

Lambda calculus in Chinese | | Lambda calculus in French | Lambda calculus in Italian | Lambda calculus in Spanish | Lambda calculus in Dutch | Lambda calculus in Portuguese | Lambda calculus in German | Lambda calculus in Russian | Lambda calculus in Japanese | Lambda calculus in Greek | Lambda calculus in Hebrew | Lambda calculus in Croatian | Lambda calculus in Serbian

Wikipedia English The Free EncyclopediaDownload 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 DictionaryDownload this dictionary
lambda calculus
Weak Head Normal Form 
 
lambda-calculus
<mathematics> (Normally written with a Greek letter lambda). A branch of mathematical logic developed by Alonzo Church in the late 1930s and early 1940s, dealing with the application of functions to their arguments. The pure lambda-calculus contain

(c) Copyright 1993 by Denis Howe
Translate:
Translate with Babylon