Abstract
Quotient inductive-inductive types (QIITs) generalise inductive types in two ways: a QIIT can have more than one sort and the later sorts can be indexed over the previous ones. In addition, equality constructors are also allowed. We work in a setting with uniqueness of identity proofs, hence we use the term QIIT instead of higher inductive-inductive type. An example of a QIIT is the well-typed (intrinsic) syntax of type theory quotiented by conversion. In this paper first we specify finitary QIITs using a domain-specific type theory which we call the theory of signatures. The syntax of the theory of signatures is given by a QIIT as well. Then, using this syntax we show that all specified QIITs exist and they have a dependent elimination principle. We also show that algebras of a signature form a category with families (CwF) and use the internal language of this CwF to show that dependent elimination is equivalent to initiality.
Supplemental Material
- Michael Abbott, Thorsten Altenkirch, and Neil Ghani. 2005. Containers — Constructing Strictly Positive Types. Theoretical Computer Science 342 (September 2005), 3–27. Applied Semantics: Selected Topics. Google Scholar
Digital Library
- Benedikt Ahrens and Peter LeFanu Lumsdaine. 2017. Displayed Categories. arXiv: arXiv:1705.04296Google Scholar
- Thorsten Altenkirch, Paolo Capriotti, Gabe Dijkstra, Nicolai Kraus, and Fredrik Nordvall Forsberg. 2018. Quotient inductiveinductive types. In International Conference on Foundations of Software Science and Computation Structures. Springer, 293–310.Google Scholar
Cross Ref
- Thorsten Altenkirch and Ambrus Kaposi. 2016. Type theory in type theory using quotient inductive types. In Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20 - 22, 2016 , Rastislav Bodik and Rupak Majumdar (Eds.). ACM, 18–29. Google Scholar
Digital Library
- Robert Atkey, Neil Ghani, and Patricia Johann. 2014. A relationally parametric model of dependent type theory. In The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’14, San Diego, CA, USA, January 20-21, 2014 , Suresh Jagannathan and Peter Sewell (Eds.). ACM, 503–516. Google Scholar
Digital Library
- Steve Awodey, Jonas Frey, and Sam Speight. 2018. Impredicative Encodings of (Higher) Inductive Types. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ’18) . ACM, New York, NY, USA, 76–85. Google Scholar
Digital Library
- Henning Basold and Herman Geuvers. 2016. Type Theory Based on Dependent Inductive and Coinductive Types. In Proceedings of LICS ’16 , Martin Grohe, Eric Koskinen, and Natarajan Shankar (Eds.). ACM, 327–336. Google Scholar
Digital Library
- Henning Basold, Herman Geuvers, and Niels van der Weide. 2017. Higher Inductive Types in Programming. Journal of Universal Computer Science 23, 1 (jan 2017), 63–88.Google Scholar
- Jean-Philippe Bernardy, Patrik Jansson, and Ross Paterson. 2012. Proofs for Free — Parametricity for Dependent Types. Journal of Functional Programming 22, 02 (2012), 107–152. Google Scholar
Digital Library
- Paolo Capriotti and Nicolai Kraus. 2017. Univalent Higher Categories via Complete Semi-Segal Types. Proc. ACM Program. Lang. 2, POPL, Article 44 (Dec. 2017), 29 pages. Google Scholar
Digital Library
- John Cartmell. 1986. Generalised algebraic theories and contextual categories. Annals of Pure and Applied Logic 32 (1986), 209–243.Google Scholar
Cross Ref
- James Chapman, Pierre-Évariste Dagand, Conor McBride, and Peter Morris. 2010. The gentle art of levitation. ACM Sigplan Notices 45, 9 (2010), 3–14. Google Scholar
Digital Library
- Pierre Clairambault and Peter Dybjer. 2014. The biequivalence of locally cartesian closed categories and Martin-Löf type theories. Mathematical Structures in Computer Science 24, 6 (2014).Google Scholar
- Jesper Cockx, Dominique Devriese, and Frank Piessens. 2014. Pattern Matching Without K. In Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming (ICFP ’14) . ACM, New York, NY, USA, 257–268. Google Scholar
Digital Library
- Cyril Cohen, Thierry Coquand, Simon Huber, and Anders Mörtberg. 2016. Cubical Type Theory: a constructive interpretation of the univalence axiom. CoRR abs/1611.02108 (2016). arXiv: 1611.02108 http://arxiv.org/abs/1611.02108Google Scholar
- Thierry Coquand, Simon Huber, and Anders Mörtberg. 2018. On Higher Inductive Types in Cubical Type Theory. LICS ’18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (2018). Google Scholar
Digital Library
- Peter Dybjer. 1996. Internal Type Theory. In Lecture Notes in Computer Science. Springer, 120–134. Google Scholar
Digital Library
- Peter Dybjer. 1997. Inductive Families. Formal Aspects of Computing 6 (1997), 440–465.Google Scholar
Cross Ref
- Peter Dybjer. 2000. A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory. Journal of Symbolic Logic 65 (2000), 525–549.Google Scholar
Cross Ref
- Peter Dybjer and Hugo Moeneclaey. 2018. Finitary Higher Inductive Types in the Groupoid Model. Electronic Notes in Theoretical Computer Science 336 (2018), 119 – 134.Google Scholar
Cross Ref
- Martin Hofmann. 1995a. Conservativity of Equality Reflection over Intensional Type Theory.. In TYPES 95. 153–164. Google Scholar
Digital Library
- Martin Hofmann. 1995b. Extensional concepts in intensional type theory. University of Edinburgh, Department of Computer Science. http://books.google.co.uk/books?id=HK3xtgAACAAJGoogle Scholar
- Ambrus Kaposi. 2017. Type theory in a type theory with quotient inductive types. Ph.D. Dissertation. University of Nottingham.Google Scholar
- Ambrus Kaposi and András Kovács. 2018. A Syntax for Higher Inductive-Inductive Types. In 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) (Leibniz International Proceedings in Informatics (LIPIcs)) , Hélène Kirchner (Ed.), Vol. 108. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 20:1–20:18.Google Scholar
- Peter LeFanu Lumsdaine and Mike Shulman. 2017. Semantics of higher inductive types. arXiv: arXiv:1705.07088Google Scholar
- Peter Morris and Thorsten Altenkirch. 2009. Indexed Containers. In Twenty-Fourth IEEE Symposium in Logic in Computer Science (LICS 2009) . Google Scholar
Digital Library
- Fredrik Nordvall Forsberg. 2013. Inductive-inductive definitions. Ph.D. Dissertation. Swansea University.Google Scholar
- Nicolas Oury. 2005. Extensionality in the calculus of constructions. Springer Berlin Heidelberg, Berlin, Heidelberg, 278–293. Google Scholar
Digital Library
- Christine Paulin-Mohring. 1993. Inductive Definitions in the system Coq — Rules and Properties. In Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA ’93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings (Lecture Notes in Computer Science) , Marc Bezem and Jan Friso Groote (Eds.), Vol. 664. Springer, 328–345. Google Scholar
Digital Library
- John C. Reynolds. 1983. Types, Abstraction and Parametric Polymorphism. In Information Processing 83, Proceedings of the IFIP 9th World Computer Congress, Paris, September 19-23, 1983 , R. E. A. Mason (Ed.). Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 513–523.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 ’15) . ACM, New York, NY, USA, 31–42. Google Scholar
Digital Library
- The Univalent Foundations Program. 2013. Homotopy type theory: Univalent foundations of mathematics. Technical Report. Institute for Advanced Study.Google Scholar
- Niels van der Weide. 2016. Higher Inductive Types. Ph.D. Dissertation. Radboud University, Nijmegen. Master’s thesis.Google Scholar
- Théo Winterhalter, Matthieu Sozeau, and Nicolas Tabareau. 2018. Using reflection to eliminate reflection. In 24th International Conference on Types for Proofs and Programs, TYPES 2018 , José Espírito Santo and Luís Pinto (Eds.). University of Minho.Google Scholar
Index Terms
Constructing quotient inductive-inductive types
Recommendations
Higher inductive types in cubical computational type theory
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 ...
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 '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesWe 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