Homotopy Type Theory: Univalent Foundations of Mathematics
Not on the map. Why?
Abstract (arXiv)
Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and beautiful "univalence axiom" implies that isomorphic structures can be identified. On the other hand, "higher inductive types" provide direct, logical descriptions of some of the basic spaces and constructions of homotopy theory. Both are impossible to capture directly in classical set-theoretic foundations, but when combined in homotopy type theory, they permit an entirely new kind of "logic of homotopy types". This suggests a new conception of foundations of mathematics, with intrinsic homotopical content, an "invariant" conception of the objects of mathematics -- and convenient machine implementations, which can serve as a practical aid to the working mathematician. This book is intended as a first systematic exposition of the basics of the resulting "Univalent Foundations" program, and a collection of examples of this new style of reasoning -- but without requiring the reader to know or learn any formal logic, or to use any computer proof assistant.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Aug 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 4.
8 papers.
- 2024Formal Mathematical Reasoning: A New Frontier in AIcited by 81
- 2026Semantic Search over 9 Million Mathematical Theoremscited by 8
- 2026Artificial Intelligence and the Structure of Mathematicscited by 4
- 2025Improving Autoformalization Using Direct Dependency Retrievalcited by 2
- 2026Evidence-Grounded Verified Agentic Reasoning: A Path Toward Eliminating LLM Hallucination in Empirical Inference via Tool-Attested Kernel Proofscited by 2
- 2023Semantic Composition in Visually Grounded Language Modelscited by 1
- 2025Hey Pentti, We Did It Again!: Differentiable vector-symbolic types that prove polynomial terminationcited by 0
- 2026Functorial Neural Architectures from Higher Inductive Typescited by 0
- 2026Evidence-Grounded Verified Agentic Reasoning: A Path Toward Eliminating LLM Hallucination in Empirical Inference via Tool-Attested Kernel Proofs14 Jul 2026
- 2026Artificial Intelligence and the Structure of Mathematics7 Apr 2026
- 2026Functorial Neural Architectures from Higher Inductive Types17 Mar 2026
- 2026Semantic Search over 9 Million Mathematical Theorems5 Feb 2026
- 2025Improving Autoformalization Using Direct Dependency Retrieval15 Nov 2025
- 2025Hey Pentti, We Did It Again!: Differentiable vector-symbolic types that prove polynomial termination18 Oct 2025
- 2024Formal Mathematical Reasoning: A New Frontier in AI20 Dec 2024
- 2023Semantic Composition in Visually Grounded Language Models15 May 2023