Mathematical logic and foundations Proof theory Concept
Curry–Howard correspondence
Summary
The Curry–Howard correspondence is the match between proofs in intuitionistic logic and programs in typed lambda calculus. A proposition corresponds to a type, and a proof of the proposition corresponds to a program of that type. Simplifying a proof corresponds to running the program. It is the basis of proof assistants built on type theory, where checking a proof means checking the type of a program.
Reading path
To understand this page from the ground up, read these 22 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Intuitionistic logic concept
- Lambda calculus concept
- Proposition concept
- Set concept
- Set definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Biconditional definition
- Truth table concept
- Modus ponens concept
- Mathematical proof concept
- Propositional logic concept
- Tautology definition
- Logical equivalence definition
- Double negation law statement
- Proof by contradiction concept
- Russell's paradox statement
- Type theory concept
- Curry–Howard correspondence concept
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | A77FER1Q5H |
|---|---|
| URI | m2://A77FER1Q5H |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B40, 03F03, 68N18 |
| Uses | Lambda calculus, Intuitionistic logic, Type theory |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.