Skip to main content
×
×
Home

The biequivalence of locally cartesian closed categories and Martin-Löf type theories

  • PIERRE CLAIRAMBAULT (a1) and PETER DYBJER (a2)
Abstract

Seely's paper Locally cartesian closed categories and type theory (Seely 1984) contains a well-known result in categorical type theory: that the category of locally cartesian closed categories is equivalent to the category of Martin-Löf type theories with Π, Σ and extensional identity types. However, Seely's proof relies on the problematic assumption that substitution in types can be interpreted by pullbacks. Here we prove a corrected version of Seely's theorem: that the Bénabou–Hofmann interpretation of Martin-Löf type theory in locally cartesian closed categories yields a biequivalence of 2-categories. To facilitate the technical development, we employ categories with families as a substitute for syntactic Martin-Löf type theories. As a second result, we prove that if we remove Π-types, the resulting categories with families with only Σ and extensional identity types are biequivalent to left exact categories.

Copyright
References
Hide All
Abadi, M., Cardelli, L., Curien, P.-L. and Lévy, J.-J. (1990) Explicit substitutions. In: ACM Conference on Principles of Programming Languages, San Francisco.
Bénabou, J. (1985) Fibred categories and the foundation of naive category theory. Journal of Symbolic Logic 50 1037.
Cartmell, J. (1986) Generalized algebraic theories and contextual categories. Annals of Pure and Applied Logic 32 209243.
Curien, P.-L. (1993) Substitution up to isomorphism. Fundamenta Informaticae 19 (1–2)5186.
Dybjer, P. (1996) Internal type theory. In: TYPES '95, Types for Proofs and Programs. Springer-Verlag Lecture Notes in Computer Science 1158 120134.
Hofmann, M. (1994) On the interpretation of type theory in locally cartesian closed categories. In: Pacholski, L. and Tiuryn, J. (eds.) Computer Science Logic – 8th Workshop, CSL. Springer-Verlag Lecture Notes in Computer Science 933 427441.
Hofmann, M. (1996) Syntax and semantics of dependent types. In: Pitts, A. and Dybjer, P. (eds.) Semantics and Logics of Computation, Cambridge University Press 79130.
Lawvere, F. W. (1970) Equality in hyperdoctrines and comprehension schema as an adjoint functor. In: Heller, A. (ed.) Applications of Categorical Algebra, Proceedings of Symposia in Pure Mathematics, AMS.
Leinster, T. (1999) Basic bicategories. arXiv:math/9810017v1.
Martin-Löf, P. (1975) An intuitionistic theory of types: Predicative part. In: Rose, H. E. and Shepherdson, J. C. (eds.) Logic Colloquium '73, North Holland 73118.
Martin-Löf, P. (1982) Constructive mathematics and computer programming. In: Logic, Methodology and Philosophy of Science, VI, 1979, North-Holland 153175.
Martin-Löf, P. (1984) Intuitionistic Type Theory, Bibliopolis.
Martin-Löf, P. (1986) Amendment to intuitionistic type theory. Notes from a lecture given in Göteborg.
Martin-Löf, P. (1992) Substitution calculus. Notes from a lecture given in Göteborg.
Mimram, S. (2004) Decidability of equality in categories with families. Report, Magistère d'Informatique et Modelisation, École Normale Superieure de Lyon. Available at http://www.pps.jussieu.fr/~smmimram/.
Pitts, A. M. (2000) Categorical logic. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science, Volume 5 – Algebraic and Logical Structures, Oxford University Press, Chapter 2, 39128.
Seely, R. (1984) Locally cartesian closed categories and type theory. Mathematical Proceedings of the Cambridge Philosophical Society 95 (1)3348.
Tasistro, A. (1993) Formulation of Martin-Löf's theory of types with explicit substitutions. Licentiate Thesis. Technical report, Department of Computer Sciences, Chalmers University of Technology and University of Göteborg.
Taylor, P. (1999) Practical Foundations of Mathematics, Cambridge University Press.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed