American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
ams election 2014
733 honeycomb meets plane at infinity
feature column
today at math camp
about the ams
Serving the Community
Mathematics Awareness
In the News
Events & Announcements
Publishing Highlights

Introducing RightsLink®

Interested in republishing or reusing AMS content? The American Mathematical Society has partnered with the Copyright Clearance Center to provide an easy way to request permission to reuse content from AMS journals, books, and ebooks. To get started,  look for the button on ebook, journal, or article pages here on More information.

Bulletin of the AMS

Bulletin of the AMS Homotopy type theory and Voevodsky's univalent foundations
( view abstract )
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, called the Univalence Axiom, which has a number of striking consequences. He has subsequently advocated a program, which he calls univalent foundations, of developing mathematics in the setting of type theory with the Univalence Axiom and possibly other additional axioms motivated by the simplicial set model. Because type theory possesses good computational properties, this program can be carried out in a computer proof assistant. In this paper we give an introduction to homotopy type theory in Voevodsky's setting, paying attention to both theoretical and practical issues. In particular, the paper serves as an introduction to both the general ideas of homotopy type theory as well as to some of the concrete details of Voevodsky's work using the well-known proof assistant Coq. The paper is written for a general audience of mathematicians with basic knowledge of algebraic topology; the paper does not assume any preliminary knowledge of type theory, logic, or computer science. Because a defining characteristic of Voevodsky's program is that the Coq code has fundamental mathematical content, and many of the mathematical concepts which are efficiently captured in the code cannot be explained in standard mathematical English without a lengthy detour through type theory, the later sections of this paper (beginning with Section [*]) make use of code; however, all notions are introduced from the beginning and in a self-contained fashion.

Browse the archive 1891 - 2014.

Featured Publication

Pearls from a Lost City: The Lvov School of Mathematics
Roman Duda, University of Wrocław, Poland

This chronicle will appeal to anyone seeking a cultural and institutional overview of key aspects of twentieth-century Polish mathematics.

Research Journals Spotlight