Abstract
In this paper, the theory of constructions is reinterpreted as a type theory of "sets" and "predicates". Following some set-theoretical intuitions, it is modified at two points: (1) a simple new operation is added — to represent a constructive version of the comprehension principle; (2) a restriction on contexts is imposed — "sets" must not depend on "proofs" of "predicates". The resulting theory is called theory of predicates. Sufficiently constructive arguments from naive set theory can be directly written down in it. On the other hand, modification (2) is relevant from a computational point of view, since it corresponds to a necessary condition of the modular approach to programming.
Our main result tells that, despite (2), the theory of predicates is as powerful as the theory of constructions: the constructions obstructed by (2) can be recovered in another form using (1). In fact, the theory of constructions is equivalent with a special case of the theory of predicates.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Cartmell, J. (1986) Generalized algebraic theories and contextual categories, Ann. Pure Appl. Logic 32, 209–243
Church, A. (1940) A Formulation of the Simple Theory of Types, J. Symbolic Logic, 5(1), pp. 56–68
Coquand, Th. (1990) Metamathematical Investigations of a Calculus of Constructions, Logic and Computer Science (Academic Press)
Coquand, Th., Huet, G. (1986) Constructions: A higher order proof system of mechanizing mathematics, EUROCAL 85, Linz, Lecture notes in Computer Science 203 (Springer, Berlin)
— (1988) The Calculus of Constructions, Information and Computation 76, 95–120
Ehrhard, T. (1989) Dictoses, Category theory in computer science, Lecture Notes in Computer Science 389 (Springer, Berlin), 213–223
Girard, J.-Y. (1972) Une extension de l'interpretation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types, Proceedings of the Second Scandinavian Logic Symposium (North-Holland, Amsterdam) 63–92
Harper, R., Mitchell, J.C., Moggi, E. (1990) Higher-Order Modules and the Phase Distinction, to appear in the Proceedings of the 17 th POPL ACM Conference
Hyland, J.M.E., Pitts, A.M. (1989) The theory of constructions: categorical semantics and topos-theoretic models, Categories in Computer Science and Logic (Proc. Boulder 1987), Contemporary Math. (Amer. Math. Soc., Providence RI)
Lambek, J., Scott, P.J. (1986) Introduction to higher order categorical logic, Cambridge studies in advanced mathematics 7 (Cambridge University Press, Cambridge)
Meseguer, J. (1989) Relating Models of Polymorphism, Conference Record of the XVI ACM POPL Symposium, 228–241
Moggi, E. (1990) A category-theoretic account of program modules, Manuscript
Pavlović, D. (1990) Predicates and Fibrations: From Type Theoretical to Category Theoretical Presentation of Constructive Logic, Thesis (State University Utrecht)
Seely, R.A.G. (1987) Categorical semantics for higher order polymorphic lambda calculus, J. Symbolic Logic 52(4), 969–989
Troelstra, A.S., Dalen, D. van (1988) Constructivism in Mathematics. An Introduction, Studies in Logic and Foundations of Mathematics 121, 123 (North-Holland, Amsterdam)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pavlović, D. (1991). Constructions and predicates. In: Pitt, D.H., Curien, PL., Abramsky, S., Pitts, A.M., Poigné, A., Rydeheard, D.E. (eds) Category Theory and Computer Science. CTCS 1991. Lecture Notes in Computer Science, vol 530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013466
Download citation
DOI: https://doi.org/10.1007/BFb0013466
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54495-1
Online ISBN: 978-3-540-38413-7
eBook Packages: Springer Book Archive