Quotients, inductive types, and quotient inductive types

This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly infinitary operators and equations. We prove that QWI types can be derived from quotient types and inductive types in the type theory of toposes with natural number object and universes, provided those universes satisfy the Weakly Initial Set of Covers (WISC) axiom. We do so by constructing QWI types as colimits of a family of approximations to them defined by well-founded recursion over a suitable notion of size, whose definition involves the WISC axiom. We developed the proof and checked it using the Agda theorem prover.

[1]  Andrew W. Swan,et al.  W-Types with Reductions and the Small Object Argument , 2018, 1802.07588.

[2]  Ieke Moerdijk,et al.  The axiom of multiple choice and models for constructive set theory , 2012, J. Math. Log..

[3]  Peter Dybjer,et al.  Representing Inductively Defined Sets by Wellorderings in Martin-Löf's Type Theory , 1997, Theor. Comput. Sci..

[4]  C. Flori,et al.  Homotopy Type Theory : Univalent Foundations of Mathematics , 2014 .

[5]  Thomas Streicher.  Universes in Toposes , 2005, From sets and types to topology and analysis.

[6]  Thorsten Altenkirch,et al.  Constructing quotient inductive-inductive types , 2019, Proc. ACM Program. Lang..

[7]  Ambrus Kaposi,et al.  A Syntax for Higher Inductive-Inductive Types , 2018, FSCD.

[8]  Andreas Abel,et al.  Cubical agda: a dependently typed programming language with univalence and higher inductive types , 2019, Journal of Functional Programming.

[9]  David Michael Roberts.  The Weak Choice Principle WISC may Fail in the Category of Sets , 2013, Stud Logica.

[10]  Erik Palmgren,et al.  Wellfounded trees in categories , 2000, Ann. Pure Appl. Log..

[11]  Chung-Kil Hur,et al.  On the construction of free algebras for equational systems , 2009, Theor. Comput. Sci..

[12]  Peter Dybjer,et al.  Finitary Higher Inductive Types in the Groupoid Model , 2018, MFPS.

[13]  G. Kelly.  A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on , 1980, Bulletin of the Australian Mathematical Society.

[14]  Conor McBride,et al.  Dependently typed functional programs and their proofs , 2000 .

[15]  G. M. Kelly.  Applications of Categories in Computer Science: On clubs and data-type constructors , 1992 .

[16]  F. E. J. Linton,et al.  Some Aspects of Equational Categories , 1966 .

[17]  Paul Blain Levy.  Broad Infinity and Generation Principles , 2021 .

[18]  M. Hofmann.  Extensional concepts in intensional type theory , 1995 .

[19]  Andreas Blass.  Words, free algebras, and coequalizers , 1983 .

[20]  Michael Shulman,et al.  Brouwer's fixed-point theorem in real-cohesive homotopy type theory , 2015, Mathematical Structures in Computer Science.

[21]  Thorsten Altenkirch,et al.  Quotient inductive-inductive types , 2018, FoSSaCS.

[22]  Marcelo Fiore,et al.  AN EQUATIONAL METALOGIC FOR MONADIC EQUATIONAL SYSTEMS , 2013, 1309.4821.

[23]  Samuel Mimram,et al.  Homological Computations for Term Rewriting Systems , 2016, FSCD.

[24]  Thorsten Altenkirch,et al.  Containers: Constructing strictly positive types , 2005, Theor. Comput. Sci..

[25]  Martin Hyland,et al.  Wellfounded Trees and Dependent Polynomial Functors , 2003, TYPES.

[26]  Andreas Abel.  Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types , 2012, FICS.

[27]  Peter Morris,et al.  Indexed Containers , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[28]  P. Lumsdaine,et al.  Semantics of higher inductive types , 2017, Mathematical Proceedings of the Cambridge Philosophical Society.

[29]  András Kovács,et al.  Large and Infinitary Quotient Inductive-Inductive Types , 2020, LICS.

[30]  Erik Palmgren,et al.  Type theories, toposes and constructive set theory: predicative aspects of AST , 2002, Ann. Pure Appl. Log..

[31]  Thierry Coquand,et al.  Pattern Matching with Dependent Types , 1992 .

[32]  Paul Taylor,et al.  Intuitionistic sets and ordinals , 1996, Journal of Symbolic Logic.

[33]  Thorsten Altenkirch,et al.  Type theory in type theory using quotient inductive types , 2016, POPL.

[34]  M. Gitik,et al.  All uncountable cardinals can be singular , 1980 .

[35]  Kristina Sojakova,et al.  Higher Inductive Types as Homotopy-Initial Algebras , 2014, POPL.

[36]  Asaf Karagila.  Embedding Orders Into Cardinals With $DC_\kappa$ , 2012 .

[37]  Herman Geuvers,et al.  Higher Inductive Types in Programming , 2017, J. Univers. Comput. Sci..

[38]  Gabe Dijkstra.  Quotient inductive-inductive definitions , 2017 .