Abstract
Homotopy type theory proposes higher inductive types (HITs) as a means of defining and reasoning about inductively-generated objects with higher-dimensional structure. As with the univalence axiom, however, homotopy type theory does not specify the computational behavior of HITs. Computational interpretations have now been provided for univalence and specific HITs by way of cubical type theories, which use a judgmental infrastructure of dimension variables. We extend the cartesian cubical computational type theory introduced by Angiuli et al. with a schema for indexed cubical inductive types (CITs), an adaptation of higher inductive types to the cubical setting. In doing so, we isolate the canonical values of a cubical inductive type and prove a canonicity theorem with respect to these values.
Supplemental Material
- Stuart F. Allen, Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo, and E. Moran. 2006. Innovations in computational type theory using Nuprl. J. Applied Logic 4, 4 (2006), 428–469.Google Scholar
- Thorsten Altenkirch and Peter Morris. 2009. Indexed Containers. In Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA. 277–285. Google Scholar
Digital Library
- Carlo Angiuli, Guillaume Brunerie, Thierry Coquand, Kuen-Bang Hou (Favonia), Robert Harper, and Daniel R. Licata. 2017a. Cartesian Cubical Type Theory. (Dec. 2017). https://github.com/dlicata335/cart- cube .Google Scholar
- Carlo Angiuli, Robert Harper, and Todd Wilson. 2017b. Computational higher-dimensional type theory. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017. 680–693. Google Scholar
Digital Library
- Carlo Angiuli, Kuen-Bang Hou (Favonia), and Robert Harper. 2017c. Computational higher type theory III: Univalent universes and exact equality. (Dec. 2017). arXiv:1712.01800 .Google Scholar
- Carlo Angiuli, Kuen-Bang Hou (Favonia), and Robert Harper. 2018. Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities. In 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, United Kingdom.Google Scholar
- Steve Awodey, Nicola Gambino, and Kristina Sojakova. 2012. Inductive Types in Homotopy Type Theory. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012. 95–104. Google Scholar
Digital Library
- Henning Basold, Herman Geuvers, and Niels van der Weide. 2017. Higher Inductive Types in Programming. J. UCS 23, 1 (2017), 63–88.Google Scholar
- Marc Bezem, Thierry Coquand, and Simon Huber. 2013. A Model of Type Theory in Cubical Sets. In 19th International Conference on Types for Proofs and Programs, TYPES 2013, April 22-26, 2013, Toulouse, France. 107–128.Google Scholar
- Evan Cavallo and Robert Harper. 2018. Computational higher type theory IV: Inductive types. (Jan. 2018). arXiv:1801.01568 .Google Scholar
- Cyril Cohen, Thierry Coquand, Simon Huber, and Anders Mörtberg. 2015. Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom. In 21st International Conference on Types for Proofs and Programs, TYPES 2015, May 18-21, 2015, Tallinn, Estonia. 5:1–5:34.Google Scholar
- Thierry Coquand, Simon Huber, and Anders Mörtberg. 2018. On Higher Inductive Types in Cubical Type Theory. In 33nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 9-12, 2018. Google Scholar
Digital Library
- Thierry Coquand and Christine Paulin. 1988. Inductively defined types. In COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings. 50–66. Google Scholar
Digital Library
- Peter Dybjer. 1994. Inductive Families. Formal Aspects of Computing 6, 4 (1994), 440–465.Google Scholar
Cross Ref
- Peter Dybjer and Hugo Moeneclaey. 2017. Finitary Higher Inductive Types in the Groupoid Model. In Mathematical Foundations of Programming Semantics, 33rd International Conference, Ljubljana, Slovenia.Google Scholar
- Martin Hofmann and Thomas Streicher. 1998. The groupoid interpretation of type theory. In Twenty-five years of constructive type theory (Venice, 1995). Oxford Logic Guides, Vol. 36. Oxford Univ. Press, New York, 83–111.Google Scholar
- Simon Huber. 2016. Cubical Interpretations of Type Theory. Ph.D. Dissertation. University of Gothenburg.Google Scholar
- Ambrus Kaposi and András Kovács. 2018. A syntax for higher inductive-inductive types. In 3nd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK.Google Scholar
- Nicolai Kraus. 2016. Constructions with Non-Recursive Higher Inductive Types. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’16, New York, NY, USA, July 5-8, 2016. 595–604. Google Scholar
Digital Library
- Peter LeFanu Lumsdaine. 2011. Model Structures from Higher Inductive Types. (2011). Unpublished note. http: //peterlefanulumsdaine.com/research/Lumsdaine- Model- strux- from- HITs.pdf .Google Scholar
- Peter LeFanu Lumsdaine and Michael Shulman. 2017. Semantics of higher inductive types. (May 2017). arXiv:1705.07088 .Google Scholar
- Per Martin-Löf. 1975. An intuitionistic theory of types: predicative part. In Logic Colloquium ’73, H.E. Rose and J.C. Shepherdson (Eds.). Studies in Logic and the Foundations of Mathematics, Vol. 80. North-Holland, 73–118.Google Scholar
- Per Martin-Löf. 1982. Constructive Mathematics and Computer Programming. In Logic, Methodology and Philosophy of Science, L.J. Cohen, J. Łoś, H. Pfeiffer, and K.-P. Podewski (Eds.), Vol. VI. 153–175.Google Scholar
- Egbert Rijke. 2017. The join construction. (Jan. 2017). arXiv:1701.07538 .Google Scholar
- Kristina Sojakova. 2015. Higher Inductive Types as Homotopy-Initial Algebras. In Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, January 15-17, 2015. 31–42. Google Scholar
Digital Library
- Andrew Swan. 2014. An Algebraic Weak Factorisation System on 01-Substitution Sets: A Constructive Proof. (Sept. 2014). arXiv:1409.1829 .Google Scholar
- Andrew Swan. 2018a. Identity Types in Algebraic Model Structures and Cubical Sets. (Aug. 2018). arXiv:1808.00915 .Google Scholar
- Andrew Swan. 2018b. Separating Path and Identity Types in Presheaf Models of Univalent Type Theory. (Aug. 2018). arXiv:1808.00920 .Google Scholar
- The RedPRL Development Team. 2018a. RedPRL – the People’s Refinement Logic. (2018). http://www.redprl.org/Google Scholar
- The RedPRL Development Team. 2018b. redtt. (2018). https://github.com/RedPRL/redttGoogle Scholar
- The Univalent Foundations Program. 2013. Homotopy Type Theory: Univalent Foundations of Mathematics. https: //homotopytypetheory.org/book , Institute for Advanced Study.Google Scholar
- Floris van Doorn. 2016. Constructing the propositional truncation using non-recursive HITs. In Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, Saint Petersburg, FL, USA, January 20-22, 2016. 122–129. Google Scholar
Digital Library
- Vladimir Voevodsky. 2010. The equivalence axiom and univalent models of type theory. (2010). http://www.math.ias.edu/ vladimir/files/CMU_talk.pdf Notes from a talk at Carnegie Mellon University.Google Scholar
Index Terms
Higher inductive types in cubical computational type theory
Recommendations
On Higher Inductive Types in Cubical Type Theory
LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer ScienceCubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly provable in ...
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 ...
Type theory in type theory using quotient inductive types
POPL '16We present an internal formalisation of a type heory with dependent types in Type Theory using a special case of higher inductive types from Homotopy Type Theory which we call quotient inductive types (QITs). Our formalisation of type theory avoids ...






Comments