Towards Formalizing Categorical Models of Type Theory in Type Theory

Electronic Notes in Theoretical Computer Science

Volumn 196, Issue C, 2008, Pages 137-151

  Buisse, Alexandre ^a   Dybjer, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Categorical logic; categories with families; constructive type theory; dependent types; internal type theory; proof assistants

Indexed keywords

CATEGORICAL LOGIC; CONSTRUCTIVE TYPE THEORY; INTERNAL TYPE THEORY; PROOF ASSISTANTS;

FORMAL LOGIC; MATHEMATICAL MODELS; THEOREM PROVING;

SYNTACTICS;

EID: 38549117213     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.09.023     Document Type: Article

References (24)

1. Abel A., Aehlig K., and Dybjer P. Normalization by evaluation for Martin-Löf type theory with one universe. 23rd Conference on the Mathematical Foundations of Programming Semantics, MFPS XXIII. Electronic Notes in Theoretical Computer Science (2007) 17-40 Elsevier
2. A. Abel, T. Coquand, and P. Dybjer. Normalization by evaluation for Martin-Lf type theory with equality judgements. In Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, July 2007. To appear
3. Aczel P. Frege Structures and the Notions of Proposition, Truth, and Set (1980), North-Holland pages 31-59
4. B. Barras. Auto-validation d'un système de preuves avec familles inductives. Thèse de doctorat, Université Paris 7, Nov. 1999
5. Benabou J. Fibered categories and the foundations of naive category theory. J. Symb. Log 50 1 (1985) 10-37
6. Cartmell J. Generalized algebraic theories and contextual categories. Annals of Pure and Applied Logic 32 (1986) 209-243
7. Curien P.-L. Substitution up to isomorphism. Fundamenta Informaticae 19 1,2 (1993) 51-86
8. Danielsson N.A. A formalisation of a dependently typed language as an inductive-recursive family. Proceedings of the TYPES meeting 2006 (2007), Springer-Verlag
9. Dybjer P. Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics. In: Huet G., and Plotkin G. (Eds). Logical Frameworks (1991), Cambridge University Press 280-306
10. Dybjer P. Inductive families. Formal Aspects of Computing 6 (1994) 440-465
11. Dybjer P. Internal type theory. TYPES '95, Types for Proofs and Programs. Lecture Notes in Computer Science number 1158 (1996), Springer 120-134
12. Dybjer P. A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic 65 2 (June 2000) 525-549
13. Dybjer P., and Setzer A. A finite axiomatization of inductive-recursive definitions. In: Girard J.-Y. (Ed). Typed Lambda Calculi and Applications. Lecture Notes in Computer Science volume 1581 (April 1999), Springer 129-146
14. Dybjer P., and Setzer A. Induction-recursion and initial algebras. Annals of Pure and Applied Logic 124 (2003) 1-47
15. Dybjer P., and Setzer A. Indexed induction-recursion. Journal of Logic and Algebraic Programming (2006)
16. Hofmann M. On the interpretation of type theory in locally cartesian closed categories. In: Pacholski L., and Tiuryn J. (Eds). CSL. Lecture Notes in Computer Science volume 933 (1994), Springer
17. M. Hofmann. Syntax and semantics of dependent types. In A. Pitts and P. Dybjer, editors, Semantics and Logics of Computation. Cambridge University Press, 1996. To appear
18. G. Huet and A. Saibi. Constructive category theory. In Proceedings of the Joint CLICS-TYPES Workshop on Categories and Type Theory, Göteborg, January 1995
19. P. Martin-Löf. About models for intuitionistic type theories and the notion of definitional equality. In S. Kanger, editor, Proceedings of the 3rd Scandinavian Logic Symposium, pages 81-109, 1975
20. P. Martin-Löf. Substitution calculus. Notes from a lecture given in Göteborg, November 1992
21. A.M. Pitts. Categorical logic. In Handbook of Logic in Computer Science. Oxford University Press, 1997. Draft version of article to appear
22. R. Pollack. The Theory of Lego A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994
23. D.S. Scott. Combinators and classes. In C. Böhm, editor, Lambda-Calculus and Computer Science Theory, volume 37, pages 1-26, 1975
24. Seely R.A.G. Locally cartesian closed categories and type theory. Proceedings of the Cambridge Philosophical Society 95 (1984) 33-48