Abstract
We present an internal formalisation of a type heory with dependent types in Type Theory using a special case of higher inductive types from Homotopy Type Theory which we call quotient inductive types (QITs). Our formalisation of type theory avoids referring to preterms or a typability relation but defines directly well typed objects by an inductive definition. We use the elimination principle to define the set-theoretic and logical predicate interpretation. The work has been formalized using the Agda system extended with QITs using postulates.
- nlab: Beck-chevalley condition. Available online. Accessed: 2015-10- 26.Google Scholar
- The Agda Wiki, 2015. Available online.Google Scholar
- T. Altenkirch and A. Kaposi. Supplementary material for the paper Type Theory in Type Theory using Quotient Inductive Types, 2015. Available online at the second author’s website.Google Scholar
- T. Altenkirch, M. Hofmann, and T. Streicher. Categorical reconstruction of a reduction free normalization proof. In D. Pitt, D. E. Rydeheard, and P. Johnstone, editors, Category Theory and Computer Science, LNCS 953, pages 182–199, 1995. Google Scholar
Digital Library
- T. Altenkirch, C. McBride, and W. Swierstra. Observational equality, now! In PLPV ’07: Proceedings of the 2007 workshop on Programming languages meets program verification, pages 57–68, New York, NY, USA, 2007. ACM. ISBN 978-1-59593-677-6.. Google Scholar
Digital Library
- T. Altenkirch, P. Morris, F. N. Forsberg, and A. Setzer. A categorical semantics for inductive-inductive definitions. In CALCO, pages 70– 84, 2011. Google Scholar
Digital Library
- J.-P. Bernardy, P. Jansson, and R. Paterson. Proofs for free — parametricity for dependent types. Journal of Functional Programming, 22(02):107–152, 2012.. Google Scholar
Digital Library
- M. Bezem, T. Coquand, and S. Huber. A model of type theory in cubical sets. In 19th International Conference on Types for Proofs and Programs (TYPES 2013), volume 26, pages 107–128, 2014.Google Scholar
- E. Brady. Idris, a general-purpose dependently typed programming language: Design and implementation. Journal of Functional Programming, 23:552–593, 2013. ISSN 1469-7653..Google Scholar
Cross Ref
- M. Brown and J. Palsberg. Self-representation in Girard’s System U. SIGPLAN Not., 50(1):471–484, Jan. 2015. ISSN 0362-1340.. Google Scholar
Digital Library
- J. Cartmell. Generalised algebraic theories and contextual categories. Annals of Pure and Applied Logic, 32:209–243, 1986.Google Scholar
Cross Ref
- J. Chapman. Type theory should eat itself. Electron. Notes Theor. Comput. Sci., 228:21–36, Jan. 2009. ISSN 1571-0661.. Google Scholar
Digital Library
- N. Danielsson. A formalisation of a dependently typed language as an inductive-recursive family. In T. Altenkirch and C. McBride, editors, Types for Proofs and Programs, volume 4502 of Lecture Notes in Computer Science, pages 93–109. Springer Berlin Heidelberg, 2007. ISBN 978-3-540-74463-4. Google Scholar
Digital Library
- D. Devriese and F. Piessens. Typed syntactic meta-programming. In Proceedings of the 2013 ACM SIGPLAN International Conference on Functional Programming (ICFP 2013), pages 73–85. ACM, September 2013. ISBN 978-1-4503-2326-0.. Google Scholar
Digital Library
- R. Diaconescu. Axiom of choice and complementation. Proceedings of the American Mathematical Society, 51(1):176–178, 1975.Google Scholar
Cross Ref
- P. Dybjer. Internal type theory. In Types for Proofs and Programs, pages 120–134. Springer, 1996. Google Scholar
Digital Library
- M. Hedberg. A coherence theorem for Martin-Löf’s type theory. Journal of Functional Programming, 8(04):413–436, 1998. Google Scholar
Digital Library
- M. Hofmann. Extensional Concepts in Intensional Type Theory. Thesis. University of Edinburgh, Department of Computer Science, 1995.Google Scholar
- M. Hofmann. Syntax and semantics of dependent types. In Extensional Constructs in Intensional Type Theory, pages 13–54. Springer, 1997.Google Scholar
- G. Jaber, N. Tabareau, and M. Sozeau. Extending type theory with forcing. In Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on, pages 395–404. IEEE, 2012. Google Scholar
Digital Library
- N. Kraus. Truncation Levels in Homotopy Type Theory. PhD thesis, University of Nottingham, 2015.Google Scholar
- D. Licata. Running circles around (in) your proof assistant; or, quotients that compute, 2011. Available online.Google Scholar
- C. McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.Google Scholar
- C. McBride. Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation. In B. C. d. S. Oliveira and M. Zalewski, editors, Proceedings of the ACM SIGPLAN Workshop on Generic Programming, pages 1–12. ACM, 2010. ISBN 978-1-4503- 0251-7.. Google Scholar
Digital Library
- N. Mendler. Quotient types via coequalizers in Martin-Löf type theory. In Proceedings of the Logical Frameworks Workshop, pages 349–361, 1990.Google Scholar
- F. Nordvall Forsberg. Inductive-inductive definitions. PhD thesis, Swansea University, 2013.Google Scholar
- U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology, 2007.Google Scholar
- F. Pfenning. Church and curry: Combining intrinsic and extrinsic typing. 2008.Google Scholar
- A. Pitts. Quotient types in Agda. Private email, May 2015.Google Scholar
- J. C. Reynolds. Types, abstraction and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, Proceedings of the IFIP 9th World Computer Congress, pages 513–523. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 1983.Google Scholar
- The Univalent Foundations Program. Homotopy type theory: Univalent foundations of mathematics. Technical report, Institute for Advanced Study, 2013.Google Scholar
- V. Voevodsky. A type system with two kinds of identity types. Slides of a talk at the Institute for Advanced Study, February 2013.Google Scholar
Index Terms
Type theory in type theory using quotient inductive types
Recommendations
Constructing quotient inductive-inductive types
Quotient inductive-inductive types (QIITs) generalise inductive types in two ways: a QIIT can have more than one sort and the later sorts can be indexed over the previous ones. In addition, equality constructors are also allowed. We work in a setting ...
Decidability of conversion for type theory in type theory
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 ...
Type theory in type theory using quotient inductive types
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesWe present an internal formalisation of a type heory with dependent types in Type Theory using a special case of higher inductive types from Homotopy Type Theory which we call quotient inductive types (QITs). Our formalisation of type theory avoids ...






Comments