{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:42:49Z","timestamp":1770284569543,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,4,1]],"date-time":"1987-04-01T00:00:00Z","timestamp":544233600000},"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":9604,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1016\/0167-6423(87)90019-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"147-172","source":"Crossref","is-referenced-by-count":56,"title":["Basic polymorphic typechecking"],"prefix":"10.1016","volume":"8","author":[{"given":"Luca","family":"Cardelli","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(87)90019-0_BIB1","series-title":"Semantics of Data Types","article-title":"The semantics of second order polymorphic lambda calculus","volume":"173","author":"Bruce","year":"1984"},{"key":"10.1016\/0167-6423(87)90019-0_BIB2","first-page":"136","article-title":"Hope: An experimental applicative language","author":"Burstall","year":"1980","journal-title":"Conference Record of the 1980 LISP Conference"},{"key":"10.1016\/0167-6423(87)90019-0_BIB3","doi-asserted-by":"crossref","unstructured":"L. Cardelli and P. Wegner, On understanding types, data abstraction and polymorphism, Comput. Surveys, to appear.","DOI":"10.1145\/6041.6042"},{"key":"10.1016\/0167-6423(87)90019-0_BIB4","first-page":"194","article-title":"An extented polymorphic type system for applicative languages","volume":"88","author":"Coppo","year":"1980"},{"key":"10.1016\/0167-6423(87)90019-0_BIB5","series-title":"Combinatory Logic","author":"Curry","year":"1958"},{"key":"10.1016\/0167-6423(87)90019-0_BIB6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/582153.582176","article-title":"Principal type-schemes for functional programs","author":"Damas","year":"1982","journal-title":"Proc. POPL 82"},{"key":"10.1016\/0167-6423(87)90019-0_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0049-237X(08)70843-7","article-title":"Une extension de l'interpr\u00e9tation de G\u00f6del a l'analyse, et son application \u00e0 l'\u00e9limination des coupures dans l'analyse et la th\u00e9orie des types","author":"Girard","year":"1971","journal-title":"Proc. 2nd Scandinavian Logic Symposium"},{"key":"10.1016\/0167-6423(87)90019-0_BIB8","article-title":"Edinburgh LCF","volume":"78","author":"Gordon","year":"1979"},{"key":"10.1016\/0167-6423(87)90019-0_BIB9","first-page":"29","article-title":"The principal type scheme of an object in combinatory logic","volume":"146","author":"Hindley","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0167-6423(87)90019-0_BIB10","doi-asserted-by":"crossref","unstructured":"D.B. MacQueen, G.D. Plotkin and R. Sethi, An ideal model for recursive polymorphic types, Proc. POPL 84. Also to appear in Information and Control.","DOI":"10.1145\/800017.800528"},{"key":"10.1016\/0167-6423(87)90019-0_BIB11","series-title":"Semantics of Data Types","first-page":"301","article-title":"The typechecking of programs with implicit type structure","volume":"173","author":"McCracken","year":"1984"},{"key":"10.1016\/0167-6423(87)90019-0_BIB12","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6423(87)90019-0_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/800055.802035","article-title":"A proposal for Standard ML","author":"Milner","year":"1984","journal-title":"Proc. 1984 ACM Symposium on Lisp and Functional Programming"},{"issue":"1","key":"10.1016\/0167-6423(87)90019-0_BIB14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(87)90019-0_BIB15","article-title":"Data types as lattices","volume":"4","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(87)90019-0_BIB16","article-title":"Fundamental concepts in programming languages","author":"Strachey","year":"1967","journal-title":"Lecture notes for the International Summer School in Computer Programming"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900190?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900190?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:50:47Z","timestamp":1555091447000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642387900190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["0167642387900190"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90019-0","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}