Abstract
This paper is motivated by the discovery that an appropriate quotient SN of the strongly normalising untyped λ *-terms (where * is just a formal constant) forms a partial applicative structure with the inherent application operation. The quotient structure satisfies all but one of the axioms of a partial combinatory algebra (pca). We call such partial applicative structures conditionally partial combinalory algebras (c-pca). Remarkably, an arbitrary rightabsorptive c-pca gives rise to a tripos provided the underlying intuitionistic predicate logic is given an interpretation in the style of Kreisel's modified realizabilily, as opposed to the standard Kleene-style realizability. Starting from an arbitrary right-absorptive C-PCA U, the tripos-to-topos construction due to Hyland et al. can then be carried out to build a modified realizability topos TOPm(U) of non-standard sets equipped with an equality predicate. Church's Thesis is internally valid in TOP m (K 1) (where the pca k 1 is “Kleene's first model” of natural numbers) but not Markov's Principle. There is a topos inclusion of SET-the “classical” topos of sets-into TOP m(U); the image of the inclusion is just sheaves for the ⌝⌝-topology. Separated objects of the ⌝⌝-topology are characterized. We identify the appropriate notion of PER's (partial equivalence relations) in the modified realizability setting and state its completeness properties. The topos TOP m (U) has enough completeness property to provide a category-theoretic semantics for a family of higher type theories which include Girard's System F and the Calculus of Constructions due to Coquand and Huet. As an important application, by interpreting type theories in the topos TOP m (SN.), a clean semantic explanation of the Tait-Girard style strong normalization argument is obtained. We illustrate how a strong normalization proof for an impredicative and dependent type theory may be assembled from two general “stripping arguments” in the framework of the topos TOP m (SN.). This opens up the possibility of a “generic” strong normalization argument for an interesting class of type theories.
On leave from the National University of Singapore and supported by a fellowship from Trinity College, Cambridge.
Preview
Unable to display preview. Download preview PDF.
References
J. Bénabou. Fibred categories and the foundations of naïve category theory. J. Symb. Logic, pages 10–37, 1985.
H. Barendregt. The Lambda Calculus. North-Holland, revised edition, 1984.
H. Barendregt. Introduction to generalized type systems. J. Functional Prog., 1:125–154, 1991.
M. J. Beeson. Foundations of Constructive Mathematics. Springer-Verlag, 1985.
I. Bethke. On the existence of extensional partial combinatory algebras. J. Symb. Logic, pages 819–833, 1987.
T. Coquand and G. Huet. The Calculus of Constructions. Info. and Comp., 76:95–120, 1988.
J. Gallier. On Girard's “Candidats de Réductibilité”. In P. Odifreddi, editor, Logic and Computer Science. Academic Press, 1990.
J.-Y. Girard. Interprétation fonctionelle et elimination des coupures dans l'arithmétique d'order supérieur. Thèse de Doctorat d'Etat, Paris, 1972.
J.-Y. Girard. The system F of variable types, fifteen years later. Theoretical Computer Science, 45:159–192, 1986.
R. Grayson. Modified realizability toposes. unpublished manuscipt, 1981.
J. M. E. Hyland, P. T. Johnstone, and A. M. Pitts. Tripos theory. Math. Proc. Camb. Phil. Soc., 88:205–232, 1980.
J. M. E. Hyland and A. M. Pitts. The theory of constructions: Categorical semantics and topos-theoretic models. Contemporary Mathematics, 92:137–199, 1989.
J. M. E. Hyland, E. P. Robinson, and G. Rosolini. The discrete objects in the effective topos. Proc. London Math. Soc. (3), 60:1–36, 1990.
J. M. E. Hyland. The effective topos. In The L. E. J. Brouwer Centenary Symposium, pages 165–216. North-Holland, 1982.
J. M. E. Hyland. A small complete category. Annals of Pure and Applied Logic, 40:135–165, 1988.
P. T. Johnstone. Topos Theory. Academic Press, 1977. L.M.S. Monograph No. 10.
G. Kreisel. Interpretation of analysis by means of constructive functionals of finite type. In A Heyting, editor, Constructivity in Mathematics. North-Holland, 1959.
J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics No. 7. Cambridge University Press, 1986.
P. Martin-Löf. An intuitionistic theory of types: Predicative part. In Rose and Shepherdson, editors, Logic Colloquium '73. North-Holland, 1973.
P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984. Studies in Proof Theory Series.
A. M. Pitts. Polymorphism is set-theoretical, constructively. In D. H. Pitt et al., editor, Proc. Conf. Category Theory and Computer Science, Edinburgh, Berlin, 1987. Springer-Verlag. LNCS. Vol. 287.
D. Prawitz. Natural Deduction. Almqvist and Wiksell, 1965. Stockholm Studies in Philosophy 3.
J. C. Reynolds. Towards a theory of type structure. In B. Robinet, editor, Colloque sur la Programmation, pages 405–425. Springer-Verlag, 1974. Lecture Notes in Computer Science Vol. 19.
A. Scedrov. Normalization revisited. In J. W. Gray and A. Scedrov, editors, Categories in Computer Science and Logic, pages 357–369. AMS, 1989.
R. A. G. Seely. Categorical semantics for higher order polymorphic lambda calculus. J. Symb. Logic, 52:969–989, 1987.
T. Streicher. Truly intensional models of type theory arising from modified realizability. dated 25 May '92 mailing list at CATEGORIES@mta.ca, 1992.
W. W. Tait. Intensional interpretation of functionals of finite type i. J. Symb. Logic, 32:198–212, 1967.
W. W. Tait. A realizability interpretation of the theory of species. In Logic Colloquium. Springer-Verlag, 1975. Lecture Notes in Mathematics Vol. 453.
A. Troelstra. Metatnathematical Investigation of Intuitionistic Arithmetic and Analysis. Springer, 1973. Springer Lecture Notes in Mathematics 344.
J. van Oosten. Exercises in Realizability. PhD thesis, University of Amsterdam, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hyland, J.M.E., Ong, C.H.L. (1993). Modified realizability toposes and strong normalization proofs. In: Bezem, M., Groote, J.F. (eds) Typed Lambda Calculi and Applications. TLCA 1993. Lecture Notes in Computer Science, vol 664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037106
Download citation
DOI: https://doi.org/10.1007/BFb0037106
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56517-8
Online ISBN: 978-3-540-47586-6
eBook Packages: Springer Book Archive