Mathematical logic and foundations Topic
Type theory and constructive mathematics
Summary
Type theory and constructive mathematics study the formal systems of functions and types, and the mathematics that does not use the law of excluded middle. A type theory is a formal system in which every term has a type, and its rules act both as a logic and as a programming language. Type theories are the logical base of many proof assistants, and a constructive proof of an existence statement gives a method to compute the object. Brouwer started intuitionism early in the 20th century, Church introduced the lambda calculus in the 1930s and simple type theory in 1940, and Martin-Löf developed dependent type theory in the 1970s. This topic collects the type theory and constructive mathematics pages of math2. Its sub-areas are listed below, in reading order. Mathematical logic, computability theory, category theory, and mathematical software and formalization have their own topics.
Remarks
Sub-areas
- Type theory and constructivism as foundations
- Constructive logic and the BHK interpretation
- The untyped lambda calculus
- Reduction theory and confluence of the lambda calculus
- Combinatory logic
- The simply typed lambda calculus and simple type theory
- The Curry-Howard correspondence
- Models and semantics of lambda calculi
- Polymorphism, System F and the lambda cube
- Type systems of programming languages
- Martin-Löf type theory and dependent types
- Inductive and coinductive types
- Identity types and extensionality principles
- Homotopy type theory and univalent foundations
- Higher inductive types and synthetic homotopy theory
- Categorical models of dependent type theory
- Cubical, two-level, directed and modal type theories
- Type-theoretic foundations of proof assistants
- Heyting arithmetic and the metamathematics of constructive systems
- Realizability
- Brouwer's intuitionistic mathematics
- Bishop-style constructive analysis
- Constructive algebra and point-free topology
- Recursive mathematics and constructive reverse mathematics
- Constructive and intuitionistic set theory
Everything in this topic
The members of this topic and each page that they need, 25 pages in all.
Show the path as a graph
- no evidence level
- Bishop-style constructive analysis topic member
- Brouwer's intuitionistic mathematics topic member
- Categorical models of dependent type theory topic member
- Combinatory logic topic member
- Constructive algebra and point-free topology topic member
- Constructive and intuitionistic set theory topic member
- Constructive logic and the BHK interpretation topic member
- Cubical, two-level, directed and modal type theories topic member
- Heyting arithmetic and the metamathematics of constructive systems topic member
- Higher inductive types and synthetic homotopy theory topic member
- Homotopy type theory and univalent foundations topic member
- Identity types and extensionality principles topic member
- Inductive and coinductive types topic member
- Martin-Löf type theory and dependent types topic member
- Models and semantics of lambda calculi topic member
- Polymorphism, System F and the lambda cube topic member
- Realizability topic member
- Recursive mathematics and constructive reverse mathematics topic member
- Reduction theory and confluence of the lambda calculus topic member
- The Curry-Howard correspondence topic member
- The simply typed lambda calculus and simple type theory topic member
- The untyped lambda calculus topic member
- Type systems of programming languages topic member
- Type theory and constructivism as foundations topic member
- Type-theoretic foundations of proof assistants topic member
About this page
| Tag | K6P3NSQEZ3 |
|---|---|
| URI | m2://K6P3NSQEZ3 |
| Kind | topic |
| Writing | W0 stub |
| MSC | 03B38, 03B40, 03F50, 03F55, 03F65 |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- 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.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
Nodes in this topic
- Heyting arithmetic and the metamathematics of constructive systems
- Models and semantics of lambda calculi
- Type systems of programming languages
- Cubical, two-level, directed and modal type theories
- Recursive mathematics and constructive reverse mathematics
- Categorical models of dependent type theory
- Homotopy type theory and univalent foundations
- Type theory and constructivism as foundations
- Bishop-style constructive analysis
- Reduction theory and confluence of the lambda calculus
- Inductive and coinductive types
- Brouwer's intuitionistic mathematics
- Type-theoretic foundations of proof assistants
- The untyped lambda calculus
- Constructive logic and the BHK interpretation
- Identity types and extensionality principles
- The Curry-Howard correspondence
- Constructive and intuitionistic set theory
- Constructive algebra and point-free topology
- Realizability
- Higher inductive types and synthetic homotopy theory
- The simply typed lambda calculus and simple type theory
- Martin-Löf type theory and dependent types
- Polymorphism, System F and the lambda cube
- Combinatory logic