Kristina Sojakova
Abstract
Homotopy Type Theory is a new field of mathematics based on the recently-discovered correspondence between Martin-Löf's constructive type theory and abstract homotopy theory. We have a powerful interplay between these disciplines - we can use geometric intuition to formulate new concepts in type theory and, conversely, use type-theoretic machinery to verify and often simplify existing mathematical proofs.
Higher inductive types form a crucial part of this new system since they allow us to represent mathematical objects, such as spheres, tori, pushouts, and quotients, in the type theory. We investigate a class of higher inductive types called W-suspensions which generalize Martin-Löf's well-founded trees. We show that a propositional variant of W-suspensions, whose computational behavior is determined up to a higher path, is characterized by the universal property of being a homotopy-initial algebra. As a corollary we get that W-suspensions in the strict form are homotopy-initial.
Supplemental Material
Available for Download
- S. Awodey and A. Bauer. Propositions as {types}. Journal of Logic and Computation, 14(4):447--471, 2004. Google Scholar
Digital Library
- S. Awodey and M. Warren. Homotopy-theoretic models of identity types. Mathematical Proceedings of the Cambridge Philosophical Society, 146(1):45--55, 2009.Google ScholarCross Ref
- S. Awodey, N. Gambino, and K. Sojakova. Inductive types in Homotopy Type Theory. In Logic in Computer Science (LICS 2012), pages 95--104. IEEE Computer Society, 2012. Google ScholarDigital Library
- M. Bezem, T. Coquand, and S. Huber. A model of type theory in cubical sets, 2014. Available at http://www.cse.chalmers.se/~coquand/mod1.pdf.Google Scholar
- Coq Development Team. The Coq Proof Assistant Reference Manual, version 8.4pl3. INRIA, 2012. Available at coq.inria.fr.Google Scholar
- N. Gambino and R. Garner. The identity type weak factorisation system. Theoretical Computer Science, 409(3):94--109, 2008. Google ScholarDigital Library
- R. Garner. Two-dimensional models of type theory. Mathematical Structures in Computer Science, 19(4):687--736, 2009. Google ScholarDigital Library
- M. Hofmann and T. Streicher. The groupoid interpretation of type theory. In Twenty-five years of constructive type theory 1995, volume 36 of Oxford Logic Guides, pages 83--111. Oxford Univ. Press, 1998.Google Scholar
- C. Kapulkin, P. Lumsdaine, and V. Voevodsky. The simplicial model of univalent foundations. Available as arXiv:1211.2851v1, 2012.Google Scholar
- N. Kraus. The truncation map |_| : N -- ||N|| is nearly invertible, 2013. Post on the Homotopy Type Theory blog.Google Scholar
- D. Licata and G. Brunerie. πnSn) in Homotopy Type Theory. In Certified Programs and Proofs, volume 8307 of LNCS, pages 1--16. Springer, 2013. Google ScholarDigital Library
- D. Licata and R. Harper. Canonicity for 2-dimensional type theory. In Principles of Programming Languages (POPL 2012), pages 337--348. ACM, 2012. Google ScholarDigital Library
- D. Licata and M. Shulman. Calculating the fundamental group of the circle in Homotopy Type Theory. In Logic in Computer Science (LICS 2013), pages 223--232. IEEE Computer Society, 2013. Google ScholarDigital Library
- P. Lumsdaine. Weak ω-categories from intensional type theory. Logical Methods in Computer Science, 6:1--19, 2010.Google ScholarCross Ref
- P. Lumsdaine. Higher inductive types: a tour of the menagerie, 2011. Post on the Homotopy Type Theory blog.Google Scholar
- P. Lumsdaine and M. Shulman. Semantics of higher inductive types, 2012. Available at http://uf-ias-2012.wikispaces.com/file/view/semantics.pdf.Google Scholar
- P. Martin-Löf. An intuitionistic theory of types: Predicative part. In Logic Colloquium 1973, pages 73--118. North-Holland, 1975.Google ScholarCross Ref
- P. Martin-Löf. Constructive mathematics and computer programming. In Logic, Methodology, and Philosophy of Science, pages 153--175. North-Holland, 1982.Google ScholarCross Ref
- U. Norell. Towards a practical programming language based on de- pendent type theory. PhD thesis, Chalmers University of Technology, 2007.Google Scholar
- M. Shulman. Homotopy Type Theory, VI, 2011. Post on the n- category cafe blog.Google Scholar
- K. Sojakova. Higher inductive types as homotopy-initial algebras. Technical Report Carnegie Mellon University-CS-14--101R, Carnegie Mellon University, 2014. Available at http://reports-archive.adm.cs.cmu.edu/.Google Scholar
- T. Streicher. Investigations into intensional type theory. Habilitation Thesis. Available from the authors web page, 1993.Google Scholar
- The Univalent Foundations Program, Institute for Advanced Study. Homotopy Type Theory - Univalent Foundations of Mathematics. Univalent Foundations Project, 2013.Google Scholar
- B. van den Berg and R. Garner. Types are weak ε-groupoids. London Mathematical Society, 102(2):370--394, 2011.Google ScholarCross Ref
- B. van den Berg and R. Garner. Topological and simplicial models of identity types. ACM TOCL, 13(1), 2012. Google ScholarDigital Library
- V. Voevodsky. Univalent foundations of mathematics, 2011. Invited talk at the Workshop on Logic, Language, Information and Computation (WoLLIC 2011). Google ScholarDigital Library
- M. Warren. Homotopy-theoretic aspects of constructive type theory. PhD thesis, Carnegie Mellon University, 2008.Google Scholar
Index Terms
- Higher Inductive Types as Homotopy-Initial Algebras
Recommendations
Homotopy-Initial Algebras in Type Theory
We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a purely type-...
Cubical agda: a dependently typed programming language with univalence and higher inductive types
Proof assistants based on dependent type theory provide expressive languages for both programming and proving within the same system. However, all of the major implementations lack powerful extensionality principles for reasoning about equality, such as ...
Higher Inductive Types as Homotopy-Initial Algebras
POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesHomotopy Type Theory is a new field of mathematics based on the recently-discovered correspondence between Martin-Löf's constructive type theory and abstract homotopy theory. We have a powerful interplay between these disciplines - we can use geometric ...
Comments