Abstract
We present an algebraic approach to the syntax and semantics of Martin-Löf type theory and the calculus of constructions developed by T. Coquand and G. Huet. In our approach, models of this theory and this calculus are treated as three-sorted partial algebras, called ITSΠ-structures, described by essentially algebraic theories. We give a proof that derived statements of Martin-Löf type theory hold in appropriate ITSΠ-structures. In this proof, a formal translation from the language of terms and types into the language of terms of an appropriate essentially algebraic theory of ITSΠ-structures is used. A straightforward set-theoretic construction of ITSΠ-structures that are models of Martin-Löf type theory is demonstrated. We present a construction of a recursive ITSΠ-structure(i.e. its partial and total operations are recursive functions over some alphabet) that is a model of the calculus of constructions and demonstrates the decidability of this calculus.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference19 articles.
1. Algebra of constructions I. The word problem for partial algebras
2. Modular proof of strong normalization for the calculus of constructions;Geuvers;Journal of Functional Programming,1991
3. Streicher T. (1988) Correctness and Completeness of Categorical Semantics of the Calculus of Constructions, Ph. D. Thesis, Passau Universität.
4. Initial Algebra Semantics and Continuous Algebras