type theory (Rev #6, changes)

Showing changes from revision #5 to #6:
Added | ~~Removed~~ | ~~Chan~~ged

A type theory is a formal system in which every term has a âtypeâ, and operations in the system are restricted to acting on specific types.

A number of type theories have been used or proposed for doing homotopy type theory.

Typically types come with four sets of inference rules. Rules allow one to conclude one set of judgements from others. A collection of judgements is typically called a context.

- function type $A \to B$
- pi type? $\prod_{a:A}B$
- universe $\mathcal{U}$
- product type? $A \times B$
- sigma type? $\sum_{a:A}B$
- zero type?
- unit type?

- univalence
- function extensionality
- propositional resizing?

See axioms

This page lists some of the type theories and variations that have been used or proposed for doing homotopy type theory.

- The system presented in the HoTT book, chapter 1 and appendix A.
- Martin-LĂ¶f Intensional Type Theory: the original.
- The Calculus Of Constructions?: the basis of the Coq proof assistant.
- Agda: based on Martin-LĂ¶f type theory, extended by a flexible scheme for specifying inductive definitions.
- Homotopy Type System: a proposal by Vladimir Voevodsky.
- Two-level type theory?
- cubical type theory? (which has various forms)

âType theoryâ on the nLab wiki.

category: type theory

Revision on September 14, 2018 at 11:35:45 by Ali Caglayan. See the history of this page for a list of all contributions to it.