A categorical approach to realizability and polymorphic types

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

Volumn 298 LNCS, Issue , 1988, Pages 23-42

  Carboni, Aurelio ^a   Freyd, Peter J ^b   Scedrov, Andre ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; SEMANTICS;

HIGHER ORDER LOGIC; POLYMORPHIC LAMBDA CALCULUS; POLYMORPHIC TYPES; REALIZABILITY;

CALCULATIONS;

EID: 85027611941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-19020-1_2     Document Type: Conference Paper

References (28)

1. 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.
2. Beeson M. [1985], “Foundations of constructive mathematics”. Ergeb. der Math., Springer-Verlag, New York.
3. Boileau A., Joyal A. [1981], La logique des topos. J. Symb. Logic 46, 6-16.
4. Breazu-Tannen V., Coquand T. [87], Extensional models for polymorphism. Proc. TAPSOFT '87 — CFLP, Pisa, Theor. Comp. Sci., to appear.
5. Bruce K. B., Meyer A. R., Mitchell J. C. [87], The semantics of second-order lambda calculus. Information & Computation, to appear.
6. Carboni A., Walters R. F. C. [88], Cartesian bicategories I. J. Pure Appl. Algebra, to appear.
7. Cardelli L., Wegner P. [1985], On understanding types, data abstraction, and polymorphism. ACM Comp. Surveys 17 (4) 471-522.
8. Cousineau G., Curien P. L., Robinet B. (eds.) [86], “Combinators and functional programming languages”. Springer LNCS 242.
9. Freyd P. J. [74], On functorializing model theory, or: on canonizing category theory. Manuscript.
10. Freyd P. J., Kelly G. M. [1972], Categories of continuous functors I. J. Pure Appl. Alg. 2, 169-191
11. Erratum, ibid. 4 (1974), 121.
12. 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.
13. Freyd P.J., Scedrov A. [1988], “Geometric logic”. Math. Library Ser., North-Holland, Amsterdam, to appear.
14. 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.
15. Girard J.Y. [72], “Interprétation fonctionelle et élimination des coupures…”. Thèse de Doctorat d'Etat. Université Paris VII.
16. Hyland J.M.E. [1982], The effective topos. Proc. Brouwer Centenary Symposium (A. S. Troelstra, D. van Dalen, eds.), North-Holland, Amsterdam, 165-216.
17. Hyland J.M.E., Robinson, E., Rosolini, G. [87], Discrete objects in a topos. Preprint.
18. Kleene S.C. [1959], Recursive functionals and quantifiers of finite type I. Trans. Amer. Math. Soc. 91, 1-52.
19. Lambek J., Scott P. [86], “Introduction to higher-order categorical logic”. Cambridge Univ. Press.
20. McCarty D.C. [1986], Realizability and recursive set theory. Ann. Pure Appl. Logic 32, 153-183.
21. Mitchell J.C. [86], A type-inference approach to reduction properties and semantics of polymorphic expressions. Symp. on Lisp and Functional Programming.
22. Reynolds J. C. [1974], Towards a theory of type structure. Springer LNCS 19, 408-425.
23. Reynolds J.C. [84], Polymorphism is not set-theoretic. Springer LNCS 173.
24. Rosolini G. [86], About modest sets. Preprint
25. Scedrov A. [88], Recursive realizability and the calculus of constructions. In: “Logical Foundations of Functional Programming” (G. Huet, ed.), Addison-Wesley, to appear.
26. Scott D.S. [82], Domains for denotational semantics. ICALP 82. Springer LNCS 140.
27. Seely R.A.G. [87], Categorical semanticsfor higher-order polymorphic lambda calculus. J. Symb. Logic, to appear.
28. Wagner E. [1969], Uniformly reflective structures: on the nature of gődelizations and relative computability. Trans. Amer. Math. Soc. 144, 1-41.