Mathematical logic and foundations Concept
Calculus of constructions
Builds on System FDependent typeLambda cube
Summary
The calculus of constructions is a typed lambda calculus introduced by Thierry Coquand and Gérard Huet. It combines the polymorphism of System F, type operators, and dependent types in one system, and it sits at the top of Barendregt's lambda cube. It is strongly normalizing, and as a logic it is a higher-order intuitionistic logic in which proofs are terms. With inductive types added it became the basis of the proof assistant Coq, now called Rocq.
Reading path
To understand this page from the ground up, read these 27 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Intuitionistic logic concept
- Lambda calculus concept
- Lambda cube 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
- Dependent type concept
- Simply typed lambda calculus concept
- System F concept
- Calculus of constructions concept
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | TKMY3F6KSA |
|---|---|
| URI | m2://TKMY3F6KSA |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B38, 03B40, 68V15 |
| Uses | System F, Dependent type, Lambda cube |
| Same as | |
| Changed | 3 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.