Functorial polymorphism and semantic parametricity
Diagrammes, Tome 22 (1989), pp. 77-90. 
@article{DIA_1989__22__77_0,
     author = {Scott, Philip J.},
     title = {Functorial polymorphism and semantic parametricity},
     journal = {Diagrammes},
     pages = {77--90},
     publisher = {Universit\'e Paris 7, Unit\'e d'enseignement et de recherche de math\'ematiques},
     volume = {22},
     year = {1989},
     mrnumber = {1059272},
     zbl = {0704.03047},
     language = {en},
     url = {http://www.numdam.org/item/DIA_1989__22__77_0/}
}
TY  - JOUR
AU  - Scott, Philip J.
TI  - Functorial polymorphism and semantic parametricity
JO  - Diagrammes
PY  - 1989
SP  - 77
EP  - 90
VL  - 22
PB  - Université Paris 7, Unité d'enseignement et de recherche de mathématiques
UR  - http://www.numdam.org/item/DIA_1989__22__77_0/
LA  - en
ID  - DIA_1989__22__77_0
ER  - 
%0 Journal Article
%A Scott, Philip J.
%T Functorial polymorphism and semantic parametricity
%J Diagrammes
%D 1989
%P 77-90
%V 22
%I Université Paris 7, Unité d'enseignement et de recherche de mathématiques
%U http://www.numdam.org/item/DIA_1989__22__77_0/
%G en
%F DIA_1989__22__77_0
Scott, Philip J. Functorial polymorphism and semantic parametricity. Diagrammes, Tome 22 (1989), pp. 77-90. http://www.numdam.org/item/DIA_1989__22__77_0/

[BFSS a] Bainbridge, E.S., Freyd, P.J., Scedrov, A., Scott, P.J. Functorial polymorphism. In: Huet, G. Logical Foundations of Functional Programming, Proceedings University of Texas Programming Institute, Austin, Texas, June 1987, ed. by G. Huet, to appear. | MR

[BFSS b] Bainbridge, E.S., Freyd, P.J., Scedrov, A., Scott, P.J. Functorial polymorphism, Theoretical Computer Science, to appear. | MR | Zbl

Barendregt, H.P., The Lambda Calculus (Revised Edition), Studies in Logic and the Foundations of Mathematics, North-Holland, 1984. | MR | Zbl

Breazu-Tannen, V., Coquand, T[87] Extensional models for polymorphism. Proc. TAPSOFT '87 - CFLP, Pisa. Springer LNCS 250. Expanded version to appear in Theor. Comp. Science. | MR | Zbl

Carboni, A., Freyd, P., Scedrov, A. [88] A categorical approach to realizability and polymorphic types. Proc. 3rd ACM Workshop on the Mathematical Foundations of the Programming Semantics, New Orleans, April, 1987, ed. by M. Main et al., Springer LNCS 298, 1988, pp. 23-42. | MR | Zbl

[CGW] Coquand, T., Gunter, C.A., Winskel, G. Domain theoretic models for polymorphism. Information and Computation, to appear. | MR | Zbl

[DS70] Dubuc, E.J., Street, R., Dinatural transformations, Reports of the Midwest Category Seminar IV, Springer LNM Vol. 137 [ 1970], pp. 126-128. | MR | Zbl

Eilenberg, S., Kelly, G.M. A generalization of the functorial calculus, J. Algebra 3 [ 1966], pp. 366-375. | MR | Zbl

[F89] Freyd, P.J. Structural Polymorphism I, II, III (Preliminary Report) Univ. of Pennsylvania, Jan. 1989.

[FGSS] Freyd, P.J., Girard, J.Y., Scedrov, A., Scott, P.J. [88] Semantic parametricity in polymorphic lambda calculus. Proc. 3rd IEEE Symposium on Logic in Computer Science, Edinburgh, Scotland, July 1988.

[Gi 72] Girard, J.-Y. Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur. Thèse de Doctorat d'Etat, Université de Paris VII.

[Gi 86] Girard, J.-Y. The system F of variables types, fifteen years later. Theor. Comp. Science 45 [ 1986] pp. 159-192. | MR | Zbl

[Gi87] Girard, J.-Y. Le Lambda Calcul Du Second Ordre, Séminaire Bourbaki, Astérisque 152-153 ( 1987), pp. 173-185. | Numdam | MR | Zbl

Hasagawa, Ryu. Parametric Polymorphism and Internal Representations of Recursive Type Definitions, Manuscript, 12 April, 1989

Hyland, J.M.E. A small complete category, Ann. Pure and Applied Logic, V. 40, ( 1988) 135-165. | MR | Zbl

Hyland, J.M.E., Robinson, E.P., Rosolini, G. The discrete objects in the Effective Topos. Preprint, 1987.

Kelly, M. Many-variable Functional Calculus I, Coherence in Categories, SLNM281, S. MacLane, ed., 1977, pp. 66-105. | Zbl

[LS] Lambek, J., Scott, P.J. Introduction to higher-order categorical logic. Cambridge University Press, Studies in Advanced Mathematics 7, 1986. | MR | Zbl

[Mac] Maclane, S. Categories for the working Mathematician, Graduate Texts in Mathematics 5, Springer-Verlag, 1971. | MR | Zbl

[R83] Reynolds, J.C. Types, abstraction, and parametric polymorphism. In: Information Processing '83, ed. by R.E.A. Mason. North-Holland, Amsterdam, pp. 513-523.

[R84] Reynolds, J.C. Polymorphism is not set-theoretic. Symposium on Semantics of Data Types, ed. by Kahn et al., Springer LNCS 173, 1984. | MR | Zbl

[RP88] Reynolds, J.C., Plotkin, G.D. On functors expressible in the polymorphic typed lambda calculus. To appear in Information and Computation. | MR | Zbl

Robinson, E.P. [89] How Complete is PER ? Proc. 4th IEEE Symposium on Logic in Computer Science, Asilomar, Califomia, June 1989. | Zbl

Seely, R.A.G. [87] Categorical semantics for higher-order polymorphic lambda calculus. J. Symbolic Logic 52 [ 1987] pp. 969-989. | MR | Zbl

Wadler, P. Theorems for Free! To appear in : 4th International Symposium on Functional Languages and Computer Architecture, London, Sept 1989.

[Y60] Yoneda, N. On Ext and exact sequences J. Fac. Sci., Tokyo Sec 1, Vol. 8, 1960, pp. 507-526. | MR | Zbl