Affiliation:
1. University of Gothenburg, Sweden
2. IMDEA Software Institute, Spain
3. Chalmers University of Technology, Sweden
Abstract
Type theory should be able to handle its own meta-theory, both to justify its foundational claims and to obtain a verified implementation. At the core of a type checker for intensional type theory lies an algorithm to check equality of types, or in other words, to check whether two types are convertible. We have formalized in Agda a practical conversion checking algorithm for a dependent type theory with one universe à la Russell, natural numbers, and η-equality for Π types. We prove the algorithm correct via a Kripke logical relation parameterized by a suitable notion of equivalence of terms. We then instantiate the parameterized fundamental lemma twice: once to obtain canonicity and injectivity of type formers, and once again to prove the completeness of the algorithm. Our proof relies on inductive-recursive definitions, but not on the uniqueness of identity proofs. Thus, it is valid in variants of intensional Martin-Löf Type Theory as long as they support induction-recursion, for instance, Extensional, Observational, or Homotopy Type Theory.
Funder
Vetenskapsrådet
European Cooperation in Science and Technology
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized;Proceedings of the ACM on Programming Languages;2023-08-30
2. Impredicative Observational Equality;Proceedings of the ACM on Programming Languages;2023-01-09
3. Normalization by evaluation for modal dependent type theory;Journal of Functional Programming;2023
4. Is sized typing for Coq practical?;Journal of Functional Programming;2023
5. Staged compilation with two-level type theory;Proceedings of the ACM on Programming Languages;2022-08-29