Abstract
A categorical calculus of relations is used to derive a unified setting for higher order logic and polymorphic lambda calculus.
mcvax!i2unix!cca_umi!carboni
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bainbridge E. S., Freyd P. J., Scedrov A., Scott P. J. [88], Functorial polymorphism. In: "Logical Foundations of Functional Programming" (G. Huet, ed.), Addison-Wesley, to appear.
Beeson M. [1985], "Foundations of constructive mathematics". Ergeb. der Math., Springer-Verlag, New York.
Boileau A., Joyal A. [1981], La logique des topos. J. Symb. Logic 46, 6–16.
Breazu-Tannen V., Coquand T. [87], Extensional models for polymorphism. Proc. TAPSOFT '87 — CFLP, Pisa, Theor. Comp. Sci., to appear.
Bruce K. B., Meyer A. R., Mitchell J. C. [87], The semantics of second-order lambda calculus. Information & Computation, to appear.
Carboni A., Walters R. F. C. [88], Cartesian bicategories I. J. Pure Appl. Algebra, to appear.
Cardelli L., Wegner P. [1985], On understanding types, data abstraction, and polymorphism. ACM Comp. Surveys 17 (4) 471–522.
Cousineau G., Curien P. L., Robinet B. (eds.) [86], "Combinators and functional programming languages". Springer LNCS 242.
Freyd P. J. [74], On functorializing model theory, or: on canonizing category theory. Manuscript.
Freyd P. J., Kelly G. M. [1972], Categories of continuous functors I. J. Pure Appl. Alg. 2, 169–191; Erratum, ibid. 4 (1974), 121.
Freyd P. J., Scedrov, A. [1987], Some semantic aspects of polymorphic lambda calculus. Proc. 2nd IEEE Symp. Logic in Computer Science, Ithaca, N.Y., pp. 315–319.
Freyd P.J., Scedrov A. [1988], "Geometric logic". Math. Library Ser., North-Holland, Amsterdam, to appear.
Girard J.Y. [1971], Une extension de l'interprétation de l'interprétation de Gődel ... Proc. 2nd Scandinavian Logic Symp. (J. Fenstad, ed.), North-Holland, Amsterdam, 63–92.
Girard J.Y. [72], "Interprétation fonctionelle et élimination des coupures ...". Thèse de Doctorat d'Etat. Université Paris VII.
Hyland J.M.E. [1982], The effective topos. Proc. Brouwer Centenary Symposium (A. S. Troelstra, D. van Dalen, eds.), North-Holland, Amsterdam, 165–216.
Hyland J.M.E., Robinson, E., Rosolini, G. [87], Discrete objects in a topos. Preprint.
Kleene S.C. [1959], Recursive functionals and quantifiers of finite type I. Trans. Amer. Math. Soc. 91, 1–52.
Lambek J., Scott P. [86], "Introduction to higher-order categorical logic". Cambridge Univ. Press.
McCarty D.C. [1986], Realizability and recursive set theory. Ann. Pure Appl. Logic 32, 153–183.
Mitchell J.C. [86], A type-inference approach to reduction properties and semantics of polymorphic expressions. Symp. on Lisp and Functional Programming.
Reynolds J. C. [1974], Towards a theory of type structure. Springer LNCS 19, 408–425.
Reynolds J.C. [84], Polymorphism is not set-theoretic. Springer LNCS 173.
Rosolini G. [86], About modest sets. Preprint
Scedrov A. [88], Recursive realizability and the calculus of constructions. In: "Logical Foundations of Functional Programming" (G. Huet, ed.), Addison-Wesley, to appear.
Scott D.S. [82], Domains for denotational semantics. ICALP 82. Springer LNCS 140.
Seely R.A.G. [87], Categorical semanticsfor higher-order polymorphic lambda calculus. J. Symb. Logic, to appear.
Wagner E. [1969], Uniformly reflective structures: on the nature of gődelizations and relative computability. Trans. Amer. Math. Soc. 144, 1–41.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carboni, A., Freyd, P.J., Scedrov, A. (1988). A categorical approach to realizability and polymorphic types. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Language Semantics. MFPS 1987. Lecture Notes in Computer Science, vol 298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19020-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-19020-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19020-2
Online ISBN: 978-3-540-38920-0
eBook Packages: Springer Book Archive