Mathematical logic and foundations Computability theory Concept
Lambda calculus
Summary
The lambda calculus is a formal system for describing functions by abstraction and application, with computation done by substituting arguments into function bodies. In its untyped form it computes exactly the same functions on natural numbers as Turing machines. It was introduced by Alonzo Church and is the basis of functional programming languages and of type theory.
Where this leads
6 pages build on this one.
Further reading
About this page
| Tag | BD756KR8FM |
|---|---|
| URI | m2://BD756KR8FM |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B40, 68N18 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.