Abstract
In dependent type theory, impredicativity is a powerful logical principle that allows the definition of propositions that quantify over arbitrarily large types, potentially resulting in self-referential propositions. Impredicativity can provide a system with increased logical strength and flexibility, but in counterpart it comes with multiple incompatibility results. In particular, Abel and Coquand showed that adding definitional uniqueness of identity proofs (UIP) to the main proof assistants that support impredicative propositions (Coq and Lean) breaks the normalization procedure, and thus the type-checking algorithm. However, it was not known whether this stems from a fundamental incompatibility between UIP and impredicativity or if a more suitable algorithm could decide type-checking for a type theory that supports both. In this paper, we design a theory that handles both UIP and impredicativity by extending the recently introduced observational type theory TTobs with an impredicative universe of definitionally proof-irrelevant types, as initially proposed in the seminal work on observational equality of Altenkirch et al. We prove decidability of conversion for the resulting system, that we call CCobs, by harnessing proof-irrelevance to avoid computing with impredicative proof terms. Additionally, we prove normalization for CCobs in plain Martin-Löf type theory, thereby showing that adding proof-irrelevant impredicativity does not increase the computational content of the theory.
- Andreas Abel, Klaus Aehlig, and Peter Dybjer. 2007. Normalization by evaluation for Martin-Löf type theory with one universe. Electronic Notes in Theoretical Computer Science, 173 (2007), 17–39.
Google Scholar
Digital Library
- Andreas Abel and Thierry Coquand. 2005. Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs. In Typed Lambda Calculi and Applications, Paweł Urzyczyn (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 23–38. isbn:978-3-540-32014-2
Google Scholar
- Andreas Abel and Thierry Coquand. 2020. Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality. Logical Methods in Computer Science, Volume 16, Issue 2 (2020), June, https://doi.org/10.23638/LMCS-16(2:14)2020
Google Scholar
Cross Ref
- Andreas Abel, Joakim Öhman, and Andrea Vezzosi. 2018. Decidability of Conversion for Type Theory in Type Theory. Proceedings of the ACM on Programming Languages, 2, POPL (2018), Article 23, Jan., 29 pages. issn:2475-1421 https://doi.org/10.1145/3158111
Google Scholar
Digital Library
- Guillaume Allais, Conor McBride, and Pierre Boutillier. 2013. New Equations for Neutral Terms: A Sound and Complete Decision Procedure, Formalized. In Proceedings of the 2013 ACM SIGPLAN Workshop on Dependently-typed Programming (DTP ’13). ACM, New York, NY, USA. 13–24. isbn:978-1-4503-2384-0 https://doi.org/10.1145/2502409.2502411
Google Scholar
Digital Library
- T. Altenkirch. 1999. Extensional equality in intensional type theory. In Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158). 412–420. issn:1043-6871 https://doi.org/10.1109/LICS.1999.782636
Google Scholar
Cross Ref
- Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, and Nicolas Tabareau. 2019. Setoid type theory - a syntactic translation. In MPC 2019 - 13th International Conference on Mathematics of Program Construction (LNCS, Vol. 11825). Springer, 155–196. https://doi.org/10.1007/978-3-030-33636-3_7
Google Scholar
Digital Library
- Thorsten Altenkirch, Conor McBride, and Wouter Swierstra. 2007. Observational equality, now!. In Proceedings of the Workshop on Programming Languages meets Program Verification (PLPV 2007). 57–68. https://doi.org/10.1145/1292597.1292608
Google Scholar
Digital Library
- HP Barendregt. 1993. Lambda calculi with types. In Handbook of logic in computer science (vol. 2) background: computational structures. 117–309.
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 (21st International Conference on Types for Proofs and Programs, 69). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Tallinn, Estonia. 262. https://doi.org/10.4230/LIPIcs.TYPES.2015.5
Google Scholar
Cross Ref
- Thierry Coquand and Gérard Huet. 1988. The calculus of constructions. Information and Computation, 76, 2 (1988), 95–120. issn:0890-5401 https://doi.org/10.1016/0890-5401(88)90005-3
Google Scholar
Digital Library
- Yannick Forster. 2021. Church’s Thesis and Related Axioms in Coq’s Type Theory. In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), Christel Baier and Jean Goubault-Larrecq (Eds.) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 183). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany. 21:1–21:19. isbn:978-3-95977-175-7 issn:1868-8969 https://doi.org/10.4230/LIPIcs.CSL.2021.21
Google Scholar
Cross Ref
- Gaëtan Gilbert, Jesper Cockx, Matthieu Sozeau, and Nicolas Tabareau. 2019. Definitional Proof-Irrelevance without K. Proceedings of the ACM on Programming Languages, 3 (2019), Jan., 1–28. https://doi.org/10.1145/3290316
Google Scholar
Digital Library
- Jean-Yves Girard. 1972. Interprétation fonctionnelle et élimination des coupures dans l’arithmétique d’ordre supérieur. Thèse de Doctorat d’État, Université de Paris VII
Google Scholar
- Daniel Gratzer. 2022. An inductive-recursive universe generic for small families. https://doi.org/10.48550/ARXIV.2202.05529
Google Scholar
- Peter Hancock, Conor McBride, Neil Ghani, Lorenzo Malatesta, and Thorsten Altenkirch. 2013. Small Induction Recursion. In Typed Lambda Calculi and Applications, Masahito Hasegawa (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 156–172. isbn:978-3-642-38946-7
Google Scholar
- Martin Hofmann. 1995. Extensional concepts in intensional type theory. Ph. D. Dissertation. University of Edinburgh.
Google Scholar
- Chung-Kil Hur, Georg Neis, Derek Dreyer, and Viktor Vafeiadis. 2013. The Power of Parameterization in Coinductive Proof. In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’13). Association for Computing Machinery, New York, NY, USA. 193–206. isbn:9781450318327 https://doi.org/10.1145/2429069.2429093
Google Scholar
Digital Library
- Antonius J. C. Hurkens. 1995. A Simplification of Girard’s Paradox. In Proceedings of the Second International Conference on Typed Lambda Calculi and Applications (TLCA ’95). Springer-Verlag, Berlin, Heidelberg. 266–278. isbn:354059048X
Google Scholar
Cross Ref
- 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). Elsevier, 73 – 118. issn:0049-237X https://doi.org/10.1016/S0049-237X(08)71945-1
Google Scholar
Cross Ref
- Loïc Pujet and Nicolas Tabareau. 2022. Observational Equality: Now For Good. Proceedings of the ACM on Programming Languages, 6, POPL (2022), Jan., 1–29. https://doi.org/10.1145/3498693
Google Scholar
Digital Library
- Jonathan Sterling, Carlo Angiuli, and Daniel Gratzer. 2019. Cubical Syntax for Reflection-Free Extensional Equality. In 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), Herman Geuvers (Ed.) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 131). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. 31:1–31:25. isbn:978-3-95977-107-8 issn:1868-8969 https://doi.org/10.4230/LIPIcs.FSCD.2019.31
Google Scholar
Cross Ref
- Benjamin Werner. 1994. Une Théorie des Constructions Inductives. Université Paris-Diderot - Paris VII. https://tel.archives-ouvertes.fr/tel-00196524
Google Scholar
Index Terms
Impredicative Observational Equality
Recommendations
Observational equality: now for good
Building on the recent extension of dependent type theory with a universe of definitionally proof-irrelevant types, we introduce TTobs, a new type theory based on the setoidal interpretation of dependent type theory. TTobs equips every type with an ...
The taming of the rew: a type theory with computational assumptions
Dependently typed programming languages and proof assistants such as Agda and Coq rely on computation to automatically simplify expressions during type checking. To overcome the lack of certain programming primitives or logical principles in those ...
Type-preserving CPS translation of Σ and Π types is not not possible
Dependently typed languages such as Coq are used to specify and prove functional correctness of source programs, but what we ultimately need are guarantees about correctness of compiled code. By preserving dependent types through each compiler pass, we ...






Comments