{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:30Z","timestamp":1761611070661},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0304-3975(93)90082-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"9-58","source":"Crossref","is-referenced-by-count":41,"title":["Formal parametric polymorphism"],"prefix":"10.1016","volume":"121","author":[{"given":"M.","family":"Abadi","sequence":"first","affiliation":[]},{"given":"L.","family":"Cardelli","sequence":"additional","affiliation":[]},{"given":"P.-L.","family":"Curien","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90082-5_BIB1","article-title":"Formal parametric polymorphism","author":"Abadi","year":"1993","journal-title":"Proc. 20th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(93)90082-5_BIB2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(90)90151-7","article-title":"Functorial polymorphism","volume":"70","author":"Bainbridge","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90082-5_BIB3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(85)90135-5","article-title":"Automatic synthesis of typed \u03bb-programs on term algebras","volume":"39","author":"B\u00f6hm","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90082-5_BIB4","series-title":"Proc. Theoretical Aspects of Computer Software","article-title":"An extension of system F with subtyping","volume":"Vol. 526","author":"Cardelli","year":"1991"},{"issue":"5","key":"10.1016\/0304-3975(93)90082-5_BIB5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","article-title":"Lambda-calculus notation with nameless dummies","volume":"34","author":"de Bruijn","year":"1972","journal-title":"Indag. Math."},{"key":"10.1016\/0304-3975(93)90082-5_BIB6","series-title":"Proofs and Types","author":"Girard","year":"1989"},{"key":"10.1016\/0304-3975(93)90082-5_BIB7","series-title":"Proc. Theoretical Aspects of Computer Software","article-title":"Parametricity of extensionally collapsed term models of polymorphism and their categorical properties","volume":"Vol. 526","author":"Hasegawa","year":"1991"},{"key":"10.1016\/0304-3975(93)90082-5_BIB8","author":"Hasegawa","year":"1992","journal-title":"Categorical data types in parametric polymorphism"},{"key":"10.1016\/0304-3975(93)90082-5_BIB9","series-title":"Proc. Mathematical Foundations of Programming Semantics","article-title":"Algebraic types in PER models","volume":"Vol. 442","author":"Hyland","year":"1990"},{"key":"10.1016\/0304-3975(93)90082-5_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(93)90093-9","article-title":"The genericity theorem and the notion of parametricity in the polymorphic \u03bb-calculus","volume":"121","author":"Longo","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0304-3975(93)90082-5_BIB11","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129500001298","article-title":"Constructive natural deduction and its \u2018\u03c9-set\u2019 interpretation","volume":"1","author":"Longo","year":"1991","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/0304-3975(93)90082-5_BIB12","article-title":"Parametricity as subtyping","author":"Ma","year":"1992","journal-title":"Proc. 19th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(93)90082-5_BIB13","series-title":"Proc. Mathematical Foundations of Programming Semantics","article-title":"Types, abstraction, and parametric polymorphism, part 2","author":"Ma","year":"1991"},{"key":"10.1016\/0304-3975(93)90082-5_BIB14","series-title":"Proc. 5th Internat. Symp. on Functional Programming Languages and Computer Architecture","article-title":"Outline of a proof theory of parametricity","author":"Mairson","year":"1991"},{"key":"10.1016\/0304-3975(93)90082-5_BIB15","series-title":"Logical Foundations of Functional Programming","first-page":"273","article-title":"Empty types in polymorphic lambda calculus","author":"Meyer","year":"1990"},{"key":"10.1016\/0304-3975(93)90082-5_BIB16","series-title":"The definition of Standard ML","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(93)90082-5_BIB17","author":"Mitchell","year":"1992","journal-title":"Notes on sconing and relators"},{"key":"10.1016\/0304-3975(93)90082-5_BIB18","series-title":"Proc. Internat. Conf. on Typed Lambda Calculi and Applications","article-title":"A logic for parametric polymorphism","author":"Plotkin","year":"1993"},{"key":"10.1016\/0304-3975(93)90082-5_BIB19","author":"Plokin","year":"1993","journal-title":"Subtyping and parametricity"},{"key":"10.1016\/0304-3975(93)90082-5_BIB20","series-title":"Information Processing 83","article-title":"Types, abstraction, and parametric polymorphism","author":"Reynolds","year":"1983"},{"key":"10.1016\/0304-3975(93)90082-5_BIB21","series-title":"Lecture notes for the Internat","article-title":"Fundamental concepts in programming languages","author":"Strachey","year":"1967"},{"key":"10.1016\/0304-3975(93)90082-5_BIB22","series-title":"Proc. 4th Internat. Symp. on Functional Programming Languages and Computer Architecture","article-title":"Theorems for free!","author":"Wadler","year":"1989"},{"key":"10.1016\/0304-3975(93)90082-5_BIB23","unstructured":"P. Wadler, Recursive types for free! manuscript."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900825?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900825?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:24Z","timestamp":1555129524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593900825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0304397593900825"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90082-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}