lambda calculusLambda calculus, considered to be the mathematical basis for programming language, is a calculus developed by Alonzo Church and Stephen Kleene in the 1930s to express all computable�functions.� In an effort to formalize the concept of computability (also known as constructibility and effective calculability), Church and Kleene developed a powerful language with a simple� syntax and few grammar restrictions. The language deals with the application of a function to its arguments (a function is a set of rules) and expresses any entity as either a variable, the application of one function to another, or as a "lambda abstraction" (a function in which the Greek letter�lambda is defined as the abstraction operator). Lambda calculus, and the closely related theories of combinators and type systems, are important foundations in the study of mathematics, logic, and computer programming language.
|
| Read more about it at:
| |
|
|
| Last updated on:
Sep 21, 2005 |
|
Are you a Know-IT-All?
Which came first, the Web or the browser?
Answer
|
|
|
|
|
