Kripke Semantics for Martin-Löf’s Extensional Type Theory
It is well-known that simple type theory is complete with respect to non-standard models. Completeness for standard models only holds when increasing the class of models, e.g., to cartesian closed categories. Similarly, dependent type theory is complete for locally cartesian closed categories. However, it is usually difficult to establish the coherence of interpretations of dependent type theory, i.e., to show that the interpretations of equal expressions are indeed equal. Several classes of models have been used to remedy this problem.
We contribute to this investigation by giving a semantics that is both coherent and sufficiently general for completeness while remaining relatively easy to compute with. Our models interpret types of Martin-Löf’s extensional dependent type theory as sets indexed over posets or, equivalently, as fibrations over posets. This semantics can be seen as a generalization to dependent type theory of the interpretation of intuitionistic first-order logic in Kripke models. This yields a simple coherent model theory with respect to which simple and dependent type theory are sound and complete.
KeywordsType Theory Natural Transformation Kripke Model Coherence Property Categorical Logic
Unable to display preview. Download preview PDF.
- [All87]Allen, S.: A Non-Type-Theoretic Definition of Martin-Löf’s Types. In: Gries, D. (ed.) Proceedings of the Second Annual IEEE Symp. on Logic in Computer Science, LICS 1987, pp. 215–221. IEEE Computer Society Press, Los Alamitos (1987)Google Scholar
- [AR09]Awodey, S., Rabe, F.: Kripke Semantics for Martin-Löf’s Extensional Type Theory (2009), http://kwarc.info/frabe/Research/LamKrip.pdf
- [Jac90]Jacobs, B.: Categorical Type Theory. PhD thesis, Catholic University of the Netherlands (1990)Google Scholar
- [Joh02]Johnstone, P.: Sketches of an Elephant: A Topos Theory Compendium. Oxford Science Publications (2002)Google Scholar
- [ML84]Martin-Löf, P.: Intuitionistic Type Theory. Bibliopolis (1984)Google Scholar
- [MS89]Mitchell, J., Scott, P.: Typed lambda calculus and cartesian closed categories. In: Categories in Computer Science and Logic. Contemporary Mathematics, vol. 92, pp. 301–316. Amer. Math. Society (1989)Google Scholar
- [Pit00]Pitts, A.: Categorical Logic. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, ch. 2. Algebraic and Logical Structures, vol. 5, pp. 39–128. Oxford University Press, Oxford (2000)Google Scholar
- [Sim95]Simpson, A.: Categorical completeness results for the simply-typed lambda-calculus. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) Typed Lambda Calculi and Applications, pp. 414–427 (1995)Google Scholar