On the interpretation of type theory in locally cartesian closed categories

  • Martin Hofmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 933)


We show how to construct a model of dependent type theory (category with attributes) from a locally cartesian closed category (lccc). This allows to define a semantic function interpreting the syntax of type theory in an lccc. We sketch an application which gives rise to an interpretation of extensional type theory in intensional type theory.


Type Theory Canonical Projection Unique Section Interpretation Function Coherence Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Michael Barr and Charles Wells. Category Theory for Computing Science. International Series in Computer Science. Prentice Hall, 1990.Google Scholar
  2. 2.
    J. Bénabou. Fibred categories and the foundations of naive category theory. Journal of Symbolic Logic, 50:10–37, 1985.Google Scholar
  3. 3.
    A. Carboni. Some free constructions in realizability and proof theory. Journal of Pure and Applied Algebra, to appear.Google Scholar
  4. 4.
    J. Cartmell. Generalized algebraic theories and contextual categories. PhD thesis, Univ. Oxford, 1978.Google Scholar
  5. 5.
    Pierre-Louis Curien. Substitution up to isomorphism. Fundamenta Informaticae, 19:51–86, 1993.Google Scholar
  6. 6.
    Thomas Ehrhard. Dictoses. In Proc. Conf. Category Theory and Computer Science, Manchester, UK, pages 213–223. Springer LNCS vol. 389, 1989.Google Scholar
  7. 7.
    Bart Jacobs. Categorical Type Theory. PhD thesis, University of Nijmegen, 1991.Google Scholar
  8. 8.
    Bart Jacobs. Comprehension categories and the semantics of type theory. Theoretical Computer Science, 107:169–207, 1993.CrossRefGoogle Scholar
  9. 9.
    Nax P. Mendler. Quotient types via coequalisers in Martin-Löf's type theory. in the informal proceedings of the workshop on Logical Frameworks, Antibes, May 1990.Google Scholar
  10. 10.
    B. Nordström, K. Petersson, and J. M. Smith. Programming in Martin-Löf's Type Theory, An Introduction. Clarendon Press, Oxford, 1990.Google Scholar
  11. 11.
    Wesley Phoa. An introduction to fibrations, topos theory, the effective topos, and modest sets. Technical Report ECS-LFCS-92-208, LFCS Edinburgh, 1992.Google Scholar
  12. 12.
    Andrew Pitts. Categorical logic. In Handbook of Logic in Computer Science (Vol. VI). Oxford University Press, 199? to appear.Google Scholar
  13. 13.
    A. J. Power. A general coherence result. Journal of Pure and Applied Algebra, 57:165–173, 1989.CrossRefGoogle Scholar
  14. 14.
    Robert A. G. Seely. Locally cartesian closed categories and type theory. Mathematical Proceedings of the Cambridge Philosophical Society, 95:33–48, 1984.Google Scholar
  15. 15.
    Thomas Streicher. Semantics of Type Theory. Birkhäuser, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Martin Hofmann
    • 1
  1. 1.Department of Computer ScienceUniversity of Edinburgh JCMB, KBEdinburghScotland

Personalised recommendations