User:Thepigdog/Lambda Calculus
From Wikipedia, the free encyclopedia
Lambda calculus is a programming language based solely on lambda abstraction and function application.
Normally, in defining a function, the formal parameters are written after the function name. The Lambda Abstraction is an alternative representation that associates the formal parameters of a function with the expression that implements the function. This allows a function to be defined as an expression.
Today, the lambda calculus has applications in many different areas in mathematics, philosophy,[1] linguistics,[2][3] and computer science. Lambda calculus has played an important role in the development of the theory of programming languages and in the development of functional programming languages.
The lambda calculus also has many applications in proof theory. A major example of this is the Curry–Howard correspondence, which gives a correspondence between different systems of typed lambda calculus and systems of formal logic.