Voevodsky’s Univalence Axiom in homotopy type theory
نویسندگان
چکیده
In this short note we give a glimpse of homotopy type theory, a new field of mathematics at the intersection of algebraic topology and mathematical logic, and we explain Vladimir Voevodsky’s univalent interpretation of it. This interpretation has given rise to the univalent foundations program, which is the topic of the current special year at the Institute for Advanced Study. The Institute for Advanced Study in Princeton is hosting a special program during the academic year 2012-2013 on a new research theme that is based on recently discovered connections between homotopy theory, a branch of algebraic topology, and type theory, a branch of mathematical logic and theoretical computer science. In this brief paper our goal is to take a glance at these developments. For those readers who would like to learn more about them, we recommend a number of references throughout. Type theory was invented by Bertrand Russell [20], but it was first developed as a rigorous formal system by Alonzo Church [3, 4, 5]. It now has numerous applications in computer science, especially in the theory of programming languages [19]. Per Martin-Löf [15, 11, 13, 14], among others, developed a generalization of Church’s system which is now usually called dependent, constructive, or simply Martin-Löf type theory; this is the system that we consider here. It was originally intended as a rigorous framework for constructive mathematics. In type theory objects are classified using a primitive notion of type, similar to the data-types used in programming languages. And as in programming languages, these elaborately structured types can be used to express detailed specifications of the objects classified, giving rise to principles of reasoning about them. To take a simple example, the objects of a product type A × B are known to be of the form 〈a, b〉, and so one automatically knows how to form them and how to decompose them. This aspect of type
منابع مشابه
Homotopy type theory and Voevodsky's univalent foundations
Recent discoveries have been made connecting abstract homotopy theory and the field of type theory from logic and theoretical computer science. This has given rise to a new field, which has been christened “homotopy type theory”. In this direction, Vladimir Voevodsky observed that it is possible to model type theory using simplicial sets and that this model satisfies an additional property, cal...
متن کاملThe Univalence Axiom in posetal model categories
In this note we interpret Voevodsky’s Univalence Axiom in the language of (abstract) model categories. We then show that any posetal locally Cartesian closed model category Qt in which the mapping Hom(w)(Z × B,C) : Qt −→ Sets is functorial in Z and represented in Qt satisfies our homotopy version of the Univalence Axiom, albeit in a rather trivial way. This work was motivated by a question repo...
متن کاملOn Higher Inductive Types in Cubical Type Theory
Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky’s univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly provable in the theory. This paper describes a constructive semantics, expressed in a presheaf topos with suitable structure inspired by cubical sets, of some...
متن کاملHigher Inductive Types in Homotopy Type Theory
Homotopy Type Theory (HoTT) refers to the homotopical interpretation [1] of Martin-Löf’s intensional, constructive type theory (MLTT) [5], together with several new principles motivated by that interpretation. Voevodsky’s Univalent Foundations program [6] is a conception for a new foundation for mathematics, based on HoTT and implemented in a proof assistant like Coq [2]. Among the new principl...
متن کاملCubical Type Theory: A Constructive Interpretation of the Univalence Axiom
This paper presents a type theory in which it is possible to directly manipulate n-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways to reason about identity types, for instance, function extensionality is directly provable in the system. Further, Voevodsky’s univalence axiom is provable in t...
متن کاملUnivalence for inverse diagrams and homotopy canonicity
We describe a homotopical version of the relational and gluing models of type theory, and generalize it to inverse diagrams and oplax limits. Our method uses the Reedy homotopy theory on inverse diagrams, and relies on the fact that Reedy fibrant diagrams correspond to contexts of a certain shape in type theory. This has two main applications. First, by considering inverse diagrams in Voevodsky...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013