Abstract
This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of inductive-inductive definitions involving strictly positive occurrences of Hofmann-style quotient types, and Abel’s size types. The latter, which provide a convenient constructive abstraction of what classically would be accomplished with transfinite ordinals, are used to prove termination of the recursive definitions of the elimination and computation properties of our encoding of QW-types. The development is formalized using the Agda theorem prover.
Chapter PDF
Similar content being viewed by others
Keywords
References
Abbott, M., Altenkirch, T., Ghani, N.: Containers: Constructing strictly positive types. Theoretical Computer Science vol. 342(1), 3–27 (2005). DOI: 10.1016/j.tcs.2005.06.002.
Abel, A.: Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types. Electronic Proceedings in Theoretical Computer Science vol. 77, 1–11 (2012). DOI: 10.4204/EPTCS.77.1.
Abel, A., Pientka, B.: Well-Founded Recursion with Copatterns and Sized Types. J. Funct. Prog. vol. 26, e2 (2016). DOI: 10.1017/S0956796816000022.
Altenkirch, T., Capriotti, P., Dijkstra, G., Kraus, N., Nordvall Forsberg, F.: Quotient Inductive-Inductive Types. In: Baier, C., Dal Lago, U. (eds.) Foundations of Software Science and Computation Structures, FoSSaCS 2018, LNCS, vol. 10803, pp. 293–310. Springer, Heidelberg (2018).
Altenkirch, T., Kaposi, A.: 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, pp. 18–29. ACM Press, St. Petersburg, FL, USA (2016). DOI: 10.1145/2837614.2837638.
Basold, H., Geuvers, H., van der Weide, N.: Higher Inductive Types in Programming. Journal of Universal Computer Science vol. 23 (1), 27 (2017). DOI: 10.3217/jucs-023-01-0063.
Blass, A.: Words, Free Algebras, and Coequalizers. Fundamenta Mathematicae vol. 117 (2), 117–160 (1983).
Cockx, J., Abel, A.: “Sprinkles of Extensionality for Your Vanilla Type Theory”. Abstract for the 22nd International Conference on Types for Proofs and Programs (TYPES 2016), Novi Sad, Serbia.
Cockx, J., Abel, A.: Elaborating Dependent (Co)Pattern Matching. Proceedings of the ACM on Programming Languages vol. 2, 1–30 (2018). DOI: 10.1145/3236770.
Dijkstra, G.: Quotient Inductive-Inductive Definitions. PhD thesis, University of Nottingham (2017), URL: http://eprints.nottingham.ac.uk/42317/1/thesis.pdf.
Dybjer, P.: Representing Inductively Defined Sets by Well orderings in Martin-Löf’s Type Theory. Theoretical Computer Science vol. 176 (1-2), 329–335 (1997). DOI: 10.1016/S0304-3975(96)00145-4.
Dybjer, P., Moeneclaey, H.: Finitary Higher Inductive Types in the Groupoid Model. Electronic Notes in Theoretical Computer Science vol. 336, 119–134 (2018). DOI: 10.1016/j.entcs.2018.03.019.
Fiore, M.: An Equational Metalogic for Monadic Equational Systems. Theory and Applications of Categories vol. 27(18), 464–492 (2013). URL: https://emis.de/journals/TAC/volumes/27/18/27-18.pdf.
Fiore, M., Hur, C.-K.: On the Construction of Free Algebras for Equational Systems. Theoretical Computer Science vol. 410(18), 1704–1729 (2009). DOI: 10.1016/j.tcs.2008.12.052.
Forsberg, F.N., Setzer, A.: A Finite Axiomatisation of Inductive-Inductive Definitions. In: Berger, U., Diener, H., Schuster, P., Seisenberger, M. (eds.) Logic, Construction, Computation, Ontos mathematical logic, pp. 259–287. De Gruyter (2012). DOI: 10.1515/9783110324921.259.
Gambino, N., Kock, J.: Polynomial Functors and Polynomial Monads. Math. Proc. Camb. Phil. Soc. vol. 154 (1), 153–192 (2013). DOI: 10.1017/S0305004112000394.
Gitik, M.: All Uncountable Cardinals Can Be Singular. Israel J. Math. vol. 35 (1–2), 61–88 (1980).
Hofmann, M.: Extensional Concepts in Intensional Type Theory. PhD thesis, University of Edinburgh (1995).
Kaposi, A., Kovács, A., Altenkirch, T.: Constructing Quotient Inductive-Inductive Types. Proc. ACM Program. Lang. vol. 3, 1–24 (2019). DOI: 10.1145/3290315.
Kelly, M.: A Unified Treatment of Transfinite Constructions for Free Algebras, Free Monoids, Colimits, Associated Sheaves, and so on. Bull. Austral. Math. Soc. vol. 22, 1–83 (1980).
Lumsdaine, P.L., Shulman, M.: Semantics of Higher Inductive Types. Math. Proc. Camb. Phil. Soc. (2019). DOI: 10.1017/S030500411900015X.
Martin-Löf, P.: Constructive Mathematics and Computer Programming. In: Cohen, L.J., Łoś, J., Pfeiffer, H., Podewski, K.-P. (eds.) Studies in Logic and the Foundations of Mathematics, pp. 153–175. Elsevier (1982). https://doi.org/10.1016/S0049-237X(09)70189-210.1016/S0049-237X(09)70189-2.
McBride, C.: Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh (1999).
Nordström, B., Petersson, K., Smith, J.M.: Programming in Martin-Löf’s Type Theory. Oxford University Press (1990).
Shulman, M.: Brouwer’s Fixed-Point Theorem in Real-Cohesive Homotopy Type Theory. Mathematical Structures in Computer Science vol. 28, 856–941 (2018).
Sojakova, K.: Higher Inductive Types as Homotopy-Initial Algebras. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages – POPL ’15, pp.31–42. ACM Press, Mumbai, India (2015). DOI: 10.1145/2676726.2676983.
Streicher, T.: Investigations into Intensional Type Theory. Habilitation Thesis, Ludwig Maximilian University (1993).
Swan, A.: W-Types with Reductions and the Small Object Argument. (2018). arXiv:1802.07588 [math].
The Univalent Foundations Program, Homotopy Type Theory: Univalent Foundations for Mathematics. http://homotopytypetheory.org/book, Institute for Advanced Study (2013).
Vezzosi, A., Mörtberg, A., Abel, A.: Cubical Agda: A Dependently Typed Programming Language with Univalence and Higher Inductive Types. Proc. ACM Program. Lang. vol. 3 (ICFP), 87:1–87:29 (2019). DOI: 10.1145/3341691.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2020 The Author(s)
About this paper
Cite this paper
Fiore, M.P., Pitts, A.M., Steenkamp, S.C. (2020). Constructing Infinitary Quotient-Inductive Types. In: Goubault-Larrecq, J., König, B. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2020. Lecture Notes in Computer Science(), vol 12077. Springer, Cham. https://doi.org/10.1007/978-3-030-45231-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-45231-5_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-45230-8
Online ISBN: 978-3-030-45231-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)