• Corpus ID: 2365963

The equivalence axiom and univalent models of type theory. (Talk at CMU on February 4, 2010)

  title={The equivalence axiom and univalent models of type theory. (Talk at CMU on February 4, 2010)},
  author={Vladimir Voevodsky},
  journal={arXiv: Logic},
This is the text of my talk at CMU on Feb. 4, 2010 were I gave the second public presentation of the Univalence Axiom (called "equivalence axiom" in the text). The first presentation of the axiom was in a lecture at LMU Munich in November 2009. 

A Model of Type Theory in Cubical Sets

A model of type theory with dependent product, sum, and identity, in cubical sets is presented, and is a step towards a computational interpretation of Voevodsky's Univalence Axiom.

Stack semantics of type theory

We give a model of dependent type theory with one univalent universe and propositional truncation interpreting a type as a stack, generalizing the groupoid model of type theory. As an application, we

Computational Higher Type Theory III: Univalent Universes and Exact Equality

The main result is a canonicity theorem stating that closed terms of boolean type evaluate to either true or false, establishing the computational interpretation of Cartesian cubical higher type theory based on cubical programs equipped with a deterministic operational semantics.


Work on proving consistency of the intensional Martin-Löf type theory with a sequence of univalent universes (“MLTT+UA”) led to the understanding that in type theory we do not know how to construct

Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom

A type theory in which it is possible to directly manipulate n-dimensional cubes based on an interpretation of dependenttype theory in a cubical set model that enables new ways to reason about identity types, for instance, function extensionality is directly provable in the system.

A survey of constructive presheaf models of univalence

Voevodsky noticed that, by extending some versions of dependent type theory with one further axiom - the univalenceAxiom - one obtains a formal system in which all notions and operations are automatically invariant under isomorphisms and even under higher notions of equivalence.

Martin-Lof identity types in the C-systems defined by a universe category 1

This paper continues the series of papers that develop a new approach to syntax and semantics of dependent type theories. Here we study the interpretation of the rules of the identity types in the

The Marriage of Univalence and Parametricity

This work first clarifies the limitations of these two concepts when considered in isolation and then devises a fruitful marriage between both, which is an extension of parametricity strengthened with univalence that fully realizes programming and proving modulo equivalences.

The RedPRL Proof Assistant (Invited Paper)

RedPRL is an experimental proof assistant based on Cartesian cubical computational type theory, a new type theory for higher-dimensional constructions inspired by homotopy type theory that implements a two-level type theory.

Partial Horn logic and cartesian categories

Simplicial objects in algebraic topology

Since it was first published in 1967, Simplicial Objects in Algebraic Topology has been the standard reference for the theory of simplicial sets and their relationship to the homotopy theory of

Generalised algebraic theories and contextual categories

Semantics of Type Theory

  • T. Streicher
  • Mathematics
    Progress in Theoretical Computer Science
  • 1991

Progress in Theoretical Computer Science

  • Correctness, completeness and independence results
  • 1991