2000 character limit reached
A topological reading of inductive and coinductive definitions in Dependent Type Theory (2404.03494v1)
Published 4 Apr 2024 in math.LO and cs.LO
Abstract: In the context of dependent type theory, we show that coinductive predicates have an equivalent topological counterpart in terms of coinductively generated positivity relations, introduced by G. Sambin to represent closed subsets in point-free topology. Our work is complementary to a previous one with M.E. Maietti, where we showed that, in dependent type theory, the well-known concept of wellfounded trees has a topological equivalent counterpart in terms of proof-relevant inductively generated formal covers used to provide a predicative and constructive representation of complete suplattices. All proofs in Martin-L\"of's type theory are formalised in the Agda proof assistant.
- Michael Gordon Abbott, Thorsten Altenkirch and Neil Ghani “Containers: Constructing strictly positive types” In Theor. Comput. Sci. 342.1, 2005, pp. 3–27
- “Notes on constructive set theory.” Mittag-Leffler Technical Report No.40, 2001
- Peter Aczel “An Introduction to Inductive Definitions” In HANDBOOK OF MATHEMATICAL LOGIC 90, Studies in Logic and the Foundations of Mathematics Elsevier, 1977, pp. 739–782 DOI: https://doi.org/10.1016/S0049-237X(08)71120-0
- Benedikt Ahrens, Paolo Capriotti and Régis Spadotti “Non-wellfounded trees in homotopy type theory” In 13th International Conference on Typed Lambda Calculi and Applications 38, LIPIcs. Leibniz Int. Proc. Inform. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2015, pp. 17–30
- “Indexed containers” In Journal of Functional Programming 25 Cambridge University Press, 2015, pp. e5 DOI: 10.1017/S095679681500009X
- “Reducibility, a constructive dual of spatiality” In J. Log. Anal. 11, 2019, pp. Paper No. FT1\bibrangessep26
- Michele Contente and Maria Emilia Maietti “The Compatibility of the Minimalist Foundation with Homotopy Type Theory”, 2022 URL: https://api.semanticscholar.org/CorpusID:250408058
- T. Coquand “Metamathematical investigations of a calculus of constructions”, 1989 URL: https://inria.hal.science/inria-00075471
- “Inductively generated formal topologies.” In Annals of Pure and Applied Logic 124.1-3, 2003, pp. 71–106
- “Formal Topology and Univalent Foundations” In Proof and Computation II, 2020, pp. 255–266 DOI: 10.1142/9789811236488˙0006
- “Wellfounded trees and dependent polynomial functors” In Types for proofs and programs 3085, Lecture Notes in Comput. Sci. Springer, Berlin, 2004, pp. 210–225 DOI: 10.1007/978-3-540-24849-1“˙14
- “Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice” In Arch. Math. Logic 57.7-8, 2018, pp. 873–888 DOI: 10.1007/s00153-018-0612-9
- “An extensional Kleene realizability semantics for the Minimalist Foundation” In 20th International Conference on Types for Proofs and Programs 39, LIPIcs. Leibniz Int. Proc. Inform. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2015, pp. 162–186
- Maria Emilia Maietti “A minimalist two-level foundation for constructive mathematics” In Ann. Pure Appl. Logic 160.3, 2009, pp. 319–354 DOI: 10.1016/j.apal.2009.01.006
- Maria Emilia Maietti “Modular correspondence between dependent type theories and categories including pretopoi and topoi” In Math. Structures Comput. Sci. 15.6, 2005, pp. 1089–1149 DOI: 10.1017/S0960129505004962
- Maria Emilia Maietti “On choice rules in dependent type theory” In Theory and applications of models of computation 10185, Lecture Notes in Comput. Sci. Springer, Cham, 2017, pp. 12–23 DOI: 10.1007/978-3-319-55911-7“˙2
- Maria Emilia Maietti, Samuele Maschio and Michael Rathjen “A realizability semantics for inductive formal topologies, Church’s thesis and axiom of choice” In Log. Methods Comput. Sci. 17.2, 2021, pp. Paper No. 21\bibrangessep21 URL: https://doi.org/10.23638/LMCS-17(2:21)2021
- Maria Emilia Maietti, Samuele Maschio and Michael Rathjen “Inductive and coinductive topological generation with Church’s thesis and the axiom of choice” In Log. Methods Comput. Sci. 18.4, 2022, pp. Paper No. 5\bibrangessep28
- Maria Emilia Maietti and Pietro Sabelli “A topological counterpart of well-founded trees in dependent type theory” In Electronic Notes in Theoretical Informatics and Computer Science Volume 3 - Proceedings of MFPS XXXIX , 2023 DOI: 10.46298/entics.11755
- Maria Emilia Maietti and Giovanni Sambin “Toward a minimalist foundation for constructive mathematics” In From sets and types to topology and analysis 48, Oxford Logic Guides Oxford Univ. Press, Oxford, 2005, pp. 91–114 DOI: 10.1093/acprof:oso/9780198566519.003.0006
- Maria Emilia Maietti and Silvio Valentini “A Structural Investigation on Formal Topology: Coreflection of Formal Covers and Exponentiability” In The Journal of Symbolic Logic 69.4 Association for Symbolic Logic, 2004, pp. 967–1005 URL: http://www.jstor.org/stable/30041774
- B. Nordström, K. Petersson and J. Smith “Programming in Martin Löf’s Type Theory.” Clarendon Press, Oxford, 1990
- “A set constructor for inductive sets in Martin-Löf’s type theory” In Category theory and computer science (Manchester, 1989) 389, Lecture Notes in Comput. Sci. Springer, Berlin, 1989, pp. 128–140 DOI: 10.1007/BFb0018349
- Michael Rathjen “Generalized inductive definitions in constructive set theory” In From sets and types to topology and analysis 48, Oxford Logic Guides Oxford Univ. Press, Oxford, 2005, pp. 23–40 DOI: 10.1093/acprof:oso/9780198566519.003.0002
- G. Sambin “Some points in formal topology” In Theoretical Computer Science 305, 2003, pp. 347–408
- Giovanni Sambin “Dynamics in Foundations: What Does It Mean in the Practice of Mathematics?” In Reflections on the Foundations of Mathematics: Univalent Foundations, Set Theory and General Thoughts Cham: Springer International Publishing, 2019, pp. 455–494 DOI: 10.1007/978-3-030-15655-8˙21
- Thomas Streicher “Investigations into intensional type theory”, 1993