A formal system for expressing computation built entirely from function definition and function application, with no built-in data types or control structures, shown to be as computationally powerful as a Turing machine and the theoretical basis of functional programming.
Facts
Partially Attested
Origin YearChurch introduced the lambda calculus in the 1930s as part of an investigation into the foundations of mathematics; 1936 is the year he isolated and published the portion relevant to computation, now called the untyped lambda calculus. Core PrincipleComputation is expressed through function abstraction and application, using variable binding and substitution. 1 Connections
In Field
Invented
Alonzo Church introduced the lambda calculus in the early 1930s as a formal system for expressing computation.
Sources
1. Lambda calculus - Wikipedia
History
Subsequently, in 1936 Church isolated and published just the portion relevant to computation, what is now called the untyped lambda calculus.
Definition
The lambda calculus is a formal system for expressing computation based on function abstraction and application using variable binding and substitution.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.