Homotopy limits in type theory-Reference-Cited by-同舟云学术

Homotopy limits in type theory

Published:2015-01-19 Issue:5 Volume:25 Page:1040-1070
ISSN:0960-1295
Container-title:Mathematical Structures in Computer Science
language:en
Short-container-title:Math. Struct. Comp. Sci.

Author:

AVIGAD JEREMY,KAPULKIN KRZYSZTOF,LUMSDAINE PETER LEFANU

Abstract

Working in homotopy type theory, we provide a systematic study of homotopy limits of diagrams over graphs, formalized in the Coq proof assistant. We discuss some of the challenges posed by this approach to the formalizing homotopy-theoretic material. We also compare our constructions with the more classical approach to homotopy limits via fibration categories.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,Mathematics (miscellaneous)

Reference29 articles.

1. Pelayo Á. and Warren M. (2012) Homotopy type theory and Voevodsky's univalent foundations. (arXiv:1210.5658)

2. Awodey S. , Gambino N. and Sojakova K. (2012) Inductive types in homotopy type theory. Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 95–104.

3. Weak ω-Categories from Intensional Type Theory

4. Homotopy theoretic models of identity types

5. Warren M. A. (2008) Homotopy Theoretic Aspects of Constructive Type Theory, Ph.D. thesis, Carnegie Mellon University.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cofibration category of digraphs for path homology;Algebraic Combinatorics;2024-04-29

2. Automated Reasoning for Mathematics;Lecture Notes in Computer Science;2024

3. Homotopy groups of cubical sets;Expositiones Mathematicae;2023-12

4. Extensional Concepts in Intensional Type Theory, Revisited;2023

5. Constructive sheaf models of type theory;Mathematical Structures in Computer Science;2021-11-18