Homotopy Type Theory: Univalent Foundations of Mathematics

Homotopy type theory is a new branch of mathematics that combines aspects of several different fields in a surprising way. It is based on a recently discovered connection between homotopy the- ory and type theory. Homotopy theory is an outgrowth of algebraic topology and homological algebra, with relationships to higher category theory; while type theory is a branch of mathematical logic and theoretical computer science. Although the connections between the two are currently the focus of intense investigation, it is increasingly clear that they are just the beginning of a subject that will take more time and more hard work to fully understand. It touches on topics as seemingly distant as the homotopy groups of spheres, the algorithms for type checking, and the definition of weak ∞-groupoids.

[1]  Lawrence C. Paulson,et al.  Constructing Recursion Operators in Intuitionistic Type Theory , 1986, J. Symb. Comput..

[2]  S. Awodey,et al.  Homotopy theoretic models of identity types , 2007, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[4]  M Makkai.  First Order Logic with Dependent Sorts, with Applications to Category Theory , .

[5]  P. Martin-Löf.  Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions , 1971 .

[6]  Thorsten Altenkirch.  Extensional equality in intensional type theory , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[7]  A. Church.  A Set of Postulates for the Foundation of Logic , 1932 .

[8]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.

[9]  F. William Lawvere,et al.  Adjointness in Foundations , 1969 .

[10]  Christine Paulin-Mohring,et al.  Inductive Definitions in the system Coq - Rules and Properties , 1993, TLCA.

[11]  U. Norell,et al.  Towards a practical programming language based on dependent type theory , 2007 .

[12]  Robert Harper,et al.  Canonicity for 2-dimensional type theory , 2012, POPL '12.

[13]  Wim Ruitenburg,et al.  A Course in Constructive Algebra , 1987 .

[14]  T. Streicher.  Semantics of Type Theory , 1991, Progress in Theoretical Computer Science.

[15]  Peter LeFanu Lumsdaine.  Weak omega-categories from intensional type theory , 2010 .

[16]  Grothendieck topos,et al.  TOPOSES AND HOMOTOPY TOPOSES , 2010 .

[17]  Michael Hedberg,et al.  A coherence theorem for Martin-Löf's type theory , 1998, Journal of Functional Programming.

[18]  Thierry Coquand,et al.  A Generalization of Takeuti-Gandy Interpretation , 2013 .

[19]  E. Bishop.  Foundations of Constructive Analysis , 2012 .

[20]  Mihaly Makkai.  On comparing definitions of weak n-category , 2001 .

[21]  Michael Shulman,et al.  Quantum Gauge Field Theory in Cohesive Homotopy Type Theory , 2014, QPL.

[22]  Peter Aczel,et al.  Collection Principles in Dependent Type Theory , 2000, TYPES.

[23]  André Joyal,et al.  Strong stacks and classifying spaces , 1991 .

[24]  Richard Garner.  On the strength of dependent products in the type theory of Martin-Löf , 2009, Ann. Pure Appl. Log..

[25]  A. Kolmogoroff.  Zur Deutung der intuitionistischen Logik , 1932 .

[26]  Giovanni Sommaruga.  History and philosophy of constructive type theory , 2000, Synthese library.

[27]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[28]  A. Church.  The calculi of lambda-conversion , 1941 .

[29]  Daniel R. Licata,et al.  Calculating the Fundamental Group of the Circle in Homotopy Type Theory , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[30]  Andreas Blass.  Words, free algebras, and coequalizers , 1983 .

[31]  Erik Palmgren,et al.  Constructivist and structuralist foundations: Bishop's and Lawvere's theories of sets , 2012, Ann. Pure Appl. Log..

[32]  M. Hofmann.  Extensional concepts in intensional type theory , 1995 .

[33]  The (∞,1)-accidentopos model of unintentional type theory , 2013 .

[34]  Frank Pfenning,et al.  Inductively Defined Types in the Calculus of Constructions , 1989, Mathematical Foundations of Programming Semantics.

[35]  Erik Palmgren,et al.  Wellfounded trees in categories , 2000, Ann. Pure Appl. Log..

[36]  Fred Richman,et al.  Real numbers and other completions , 2008, Math. Log. Q..

[37]  Julia E. Bergner,et al.  A Survey of (∞, 1)-Categories , 2010 .

[38]  Peter Freyd.  Properties Invariant within Equivalence Types of Categories , 1976 .

[39]  P. Lumsdaine.  WEAK ω-CATEGORIES FROM INTENSIONAL TYPE THEORY , 2008 .

[40]  D. Hilbert.  Über das Unendliche , 1926 .

[41]  Thierry Coquand,et al.  The paradox of trees in type theory , 1992, BIT.

[42]  Clark Barwick,et al.  On the Unicity of the Homotopy Theory of Higher Categories , 2011 .

[43]  Maria Emilia Maietti,et al.  Toward a minimalistic foundation for constructive mathematics , 2005, From sets and types to topology and analysis.

[44]  Vladimir Voevodsky.  A universe polymorphic type system , 2014 .

[45]  Robert L. Constable,et al.  Constructive Mathematics as a Programming Logic I: Some Principles of Theory , 1983, FCT.

[46]  Paul Taylor,et al.  Intuitionistic sets and ordinals , 1996, Journal of Symbolic Logic.

[47]  Douglas S. Bridges,et al.  Compactness and Continuity, Constructively Revisited , 2002, CSL.

[48]  de Ng Dick Bruijn.  Automath A Language for Mathematics , 1973 .

[49]  Dominique Devriese,et al.  Pattern matching without K , 2014, ICFP.

[50]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[51]  P. Dybjer.  Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics , 1991 .

[52]  Jeremy Avigad,et al.  A Machine-Checked Proof of the Odd Order Theorem , 2013, ITP.

[53]  B. Russell.  Mathematical Logic as Based on the Theory of Types , 1908 .

[54]  Charles Rezk,et al.  A model for the homotopy theory of homotopy theory , 1998, math/9811037.

[55]  J. Paris,et al.  The Type Theoretic Interpretation of Constructive Set Theory , 1978 .

[56]  F. William Lawvere,et al.  Metric spaces, generalized logic, and closed categories , 1973 .

[57]  Paul Taylor,et al.  Practical Foundations of Mathematics , 1999, Cambridge studies in advanced mathematics.

[58]  Erik Palmgren,et al.  A constructive and functorial embedding of locally compact metric spaces into locales , 2007 .

[59]  Anton Setzer,et al.  A finite axiomatisation of inductive-inductive definitions , 2012 .

[60]  P. Lumsdaine,et al.  THE SIMPLICIAL MODEL OF UNIVALENT FOUNDATIONS , 2014 .

[61]  A. Carboni,et al.  Some free constructions in realizability and proof theory , 1995 .

[62]  Steven Awodey,et al.  Inductive Types in Homotopy Type Theory , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[63]  Martín Hötzel Escardó,et al.  A universal characterization of the closed Euclidean interval , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[64]  G. Gentzen.  Die Widerspruchsfreiheit der reinen Zahlentheorie , 1936 .

[65]  Bengt Nordström.  Terminating general recursion , 1988, BIT Comput. Sci. Sect..

[66]  Thierry Coquand,et al.  Generalizations of Hedberg's Theorem , 2013, TLCA.

[67]  Philip Wadler,et al.  Propositions as types , 2015, Commun. ACM.

[68]  R.K. Guy,et al.  On numbers and games , 1978, Proceedings of the IEEE.

[69]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[70]  Modalities in constructive logics and type theories , 2004 .

[71]  F W Lawvere,et al.  AN ELEMENTARY THEORY OF THE CATEGORY OF SETS. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[72]  F. Richman.  The fundamental theorem of algebra: a constructive development without choice , 2000 .

[73]  Olov Wilander.  Setoids and universes , 2010, Math. Struct. Comput. Sci..

[74]  M. Hofmann,et al.  The groupoid interpretation of type theory , 1998 .

[75]  R. Ho.  Algebraic Topology , 2022 .

[76]  Robert L. Constable,et al.  Recursive Definitions in Type Theory , 1985, Logic of Programs.

[77]  Benjamin C. Pierce,et al.  Types and programming languages: the next generation , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[78]  M. Warren.  Homotopy Theoretic Aspects of Constructive Type Theory , 2008 .

[79]  Andrej Bauer,et al.  The Dedekind reals in abstract Stone duality , 2009, Mathematical Structures in Computer Science.

[80]  R. Diaconescu.  Axiom of choice and complementation , 1975 .

[81]  Von Kurt Gödel,et al.  ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES , 1958 .

[82]  Peter Dybjer,et al.  A general formulation of simultaneous inductive-recursive definitions in type theory , 2000, Journal of Symbolic Logic.

[83]  Georges Blanc.  Équivalence naturelle et formules logiques en théorie des catégories , 1978, Arch. Math. Log..

[84]  Ieke Moerdijk,et al.  W-types in homotopy type theory , 2015, Math. Struct. Comput. Sci..

[85]  Marta Bunge,et al.  Stack completions and Morita equivalence for categories in a topos , 1979 .

[86]  Thierry Coquand,et al.  Pattern Matching with Dependent Types , 1992 .

[87]  Dan Synek,et al.  A Set Constructor for Inductive Sets in Martin-Löf's Type Theory , 1989, Category Theory and Computer Science.

[88]  Harrie C. M. de Swart.  A Modern Perspective on Type Theory From its Origins until Today. , 2006, J. Log. Lang. Inf..

[89]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[90]  Thorsten Altenkirch,et al.  Observational equality, now! , 2007, PLPV.

[91]  Erik Palmgren,et al.  Type theories, toposes and constructive set theory: predicative aspects of AST , 2002, Ann. Pure Appl. Log..