Internal type theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1158 LNCS, Issue , 1996, Pages 120-134

  Dybjer, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC THEORIES; CATEGORICAL DESCRIPTIONS; DEPENDENT TYPES; INTERNAL CATEGORY; INTERNAL TYPE; MARTIN-LOF; TYPE THEORY;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

FORMAL LANGUAGES;

EID: 0142228801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61780-9_66     Document Type: Conference Paper

References (21)

1. P. Aczel. Galois: a theory development project. A report on work in progress for the Turin meeting on the Representation of Logical Frameworks, 1993.
2. T. Altenkirch, V. Gaspes, B. Nordstrom, and B. von Sydow. A user's guide to ALF. Draft, January 1994.
3. J. Benabou. Fibred categories and the foundation of naive category theory. Journal of Symbolic Logic, 50:10-37, 1985.
4. I. Beylin and P. Dybjer. Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids. This volume.
5. J. Cartmell. Generalized algebraic theories and contextual categories. Annals of Pure and Applied Logic, 32:209-243, 1986.
6. T. Coquand and P. Dybjer. Intuitionistic model constructions and normalization proofs. Mathematical Structures in Computer Science, 1996. To appear.
7. P.-L. Curien. Substitution up to isomorphism. Fundamenta Informaticae, 19(1, 2):51-86, 1993.
8. P. Dybjer. Universes and a general notion of simultaneous inductive-recursive definition in type theory. In Proceedings of the 1992 Workshop on Types for Proofs and Programs, 1992.
9. P. Dybjer and R. Pollack, editors. Informal Proceedings of the CLICS-TYPES Workshop on Categories and Type Theory, Programming Methodology Group, Goteborg University and Chalmers University of Technology, Report 85, 1995.
10. T. Ehrhard. line semantique categorique des types dependents: Applications au Calcul des Constructions. PhD thesis, Universite Paris VII, 1988.
11. M. Hofmann. Elimination of extensionality and quotient types in Martin Löf's type theory. In Types for Proofs and Programs, International Workshop TYPES'93, LNCS 806, 1994.
12. M. Hofmann. Interpretation of type theory in locally cartesian closed categories. In Proceedings of CSL. Springer LNCS, 1994.
13. M. Hofmann. Extensional concepts in intensional type theory. PhD thesis, University of Edinburgh, 1995.
14. 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.
15. G, Huet and A. Saibi. Constructive category theory. In Proceedings of the Joint CLICS-TYPES Workshop on Categories and Type Theory, Goteborg, January 1995.
16. P. Martin-Löf. Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Science, VI, 1979, pages 153-175. North-Holland, 1982.
17. P. Martin-Löf. Substitution calculus. Notes from a lecture given in Goteborg, November 1992.
18. A. M. Pitts. Categorical logic. In Handbook of Logic in Computer Science. Oxford University Press, 1997. Draft version of article to appear.
19. R. Pollack. The Theory of Lego A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994.
20. E. Ritter. Categorical Abstract Machines for Higher-Order Typed Lambda Calculi. PhD thesis, Trinity College, Cambridge, September 1992.
21. R. A. G. Seely. Locally cartesian closed categories and type theory. Proceedings of the Cambridge Philosophical Society, 95:33-48, 1984.