Church introduces the lambda calculus
- lambda calculus
- logic
Alonzo Church’s early-1930s foundational system introduced lambda abstraction as part of an ambitious formal treatment of logic. An expression could describe a function by binding a variable, with application and substitution providing a computational interpretation. The original combined logical system was later shown inconsistent, while the underlying lambda calculus survived as a productive theory of functions and computation. These outcomes should be distinguished: rejecting an inconsistent foundation did not invalidate every use of lambda abstraction. Later typed calculi and programming languages adopted related syntax under different rules. **Timeline anchor:** 1 January 1932 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Lambda_calculus), [Source 2](https://en.wikipedia.org/wiki/Alonzo_Church).
Sources
Related
On other timelines
- Lambda calculus supplies an untyped functional foundation on Dynamically typed functional programming · Lisp, Scheme, Clojure and teaching traditions by @athan
- Church's lambda calculus and undecidability on The history of computer science by @athan
- Church's lambda calculus and the Entscheidungsproblem on The history of mathematics by @athan