Homotopy Type Theory homotopy type theory > history (Rev #9)

\tableofcontents

\section{Idea}

Homotopy type theory is a framework of dependent type theories which additionally consists of

\section{Presentation}

The model of homotopy type theory we shall be presenting here is the objective type theory version of homotopy type theory. There are multiple reasons for this:

  • Since objective type theory lacks definitional equality,

    • The ruleset is simpler in the objective type theory model of homotopy type theory than other models such as Martin-Löf type theory, cubical type theory, or higher observational type theory

    • The results in objective type theory are more general than in models which use definitional equality

    • It is similar to other non-type theory foundations such as the various flavors of set theory, since it also only has one notion of equality, which is propositional equality in both objective type theory and set theory, and uses propositional equality to define terms and types.

  • From a more practical standpoint, objective type theory not only has decidable type checking, it has polynomial (quadratic) time type checking, which makes it efficient from a computational standpoint.

\subsection{Types and terms}

As with any type theory, the basic judgments of this model are judging AA to be a type, AtypeA \; \mathrm{type}, and judging aa to be a term of AA, a:Aa:A, and judging Γ\Gamma to be a context, Γctx\Gamma \; \mathrm{ctx}. Contexts are lists of type and term judgments.

\subsection{Dependent types and sections}

A dependent type is a type BB in the context of the variable judgment x:Ax:A, x:ABtypex:A \vdash B \; \mathrm{type}. The dependent type is usually written as B(x)B(x) to indicate the dependence upon xx.

A section is a term b:Bb:B in the context of the variable judgment x:Ax:A, x:Ab:Bx:A \vdash b:B. Similarly for the case for dependent types, sections are usually written as b(x)b(x) to indicate its dependence upon xx.

\subsection{Variable, Substitution, and Weakening rules}

\subsection{Russell universes}

Universes are the types of types in type theory.

We introduce a universe UU, with rules for universe formation and type reflection

ΓctxΓUtypeΓA:UΓAtype\frac{\Gamma \; \mathrm{ctx}}{\Gamma \vdash U \; \mathrm{type}} \qquad \frac{\Gamma \vdash A:U}{\Gamma \vdash A \; \mathrm{type}}

\subsection{Equality}

Equality in type theory is represented by the identity type, which is also called the path type or identification type. The terms of the identity type could be called paths or identifications.

\subsection{Definitions}

\subsection{Functions}

\subsection{Dependent products}

\subsection{Products}

\subsection{Dependent sums}

\subsection{Sums}

\subsection{Empty type}

\subsection{Unit type}

\subsection{Booleans}

\subsection{Interval}

\subsection{Function extensionality}

\subsection{Equivalences}

\subsection{Univalence}

\subsection{Natural numbers}

\section{References}

  • Homotopy Type Theory: Univalent Foundations of Mathematics, The Univalent Foundations Program, Institute for Advanced Study, 2013. (web, pdf)

  • Egbert Rijke, Introduction to Homotopy Type Theory, Cambridge Studies in Advanced Mathematics, Cambridge University Press (pdf) (478 pages)

  • Benno van den Berg, Martijn den Besten?, Quadratic type checking for objective type theory (arXiv:2102.00905)

\section{External links}

Revision on September 30, 2022 at 12:37:34 by Anonymous?. See the history of this page for a list of all contributions to it.