{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T04:28:34Z","timestamp":1781756914457,"version":"3.54.5"},"reference-count":31,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":9787,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1986,10]]},"DOI":"10.1016\/s0019-9958(86)80019-5","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T16:43:56Z","timestamp":1115397836000},"page":"95-130","source":"Crossref","is-referenced-by-count":124,"title":["An ideal model for recursive polymorphic types"],"prefix":"10.1016","volume":"71","author":[{"given":"David","family":"MacQueen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gordon","family":"Plotkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ravi","family":"Sethi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(86)80019-5_bib1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(80)90045-6","article-title":"Metric interpretations of infinite trees and semantics of non deterministic recursive programs","volume":"11","author":"Arnold","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80019-5_bib2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.4064\/fm-3-1-133-181","article-title":"Sur les op\u00e9rations dans les ensembles abstraits et leurs applications aux \u00e9quations int\u00e9grales","volume":"3","author":"Banach","year":"1922","journal-title":"Fund. Math."},{"key":"10.1016\/S0019-9958(86)80019-5_bib3","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/S0019-9958(86)80019-5_bib4","series-title":"Lisp Conference","first-page":"136","article-title":"Hope: An experimental applicative language","author":"Burstall","year":"1980"},{"key":"10.1016\/S0019-9958(86)80019-5_bib5","series-title":"Twelfth Ann. ACM Sympos. Principles of Programm. Lang","first-page":"22","article-title":"Types as intervals","author":"Cartwright","year":"1985"},{"key":"10.1016\/S0019-9958(86)80019-5_bib6","series-title":"12th Colloq., Nafplion","first-page":"120","article-title":"A completeness theorem for recursively defined types","volume":"Vol. 194","author":"Coppo","year":"1985"},{"issue":"No. 4","key":"10.1016\/S0019-9958(86)80019-5_bib7","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","article-title":"An extension of the basic functionality theory for the \u03bb-calculus","volume":"21","author":"Coppo","year":"1980","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/S0019-9958(86)80019-5_bib8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/malq.19810270205","article-title":"Functional characters of solvable terms","volume":"26","author":"Coppo","year":"1981","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0019-9958(86)80019-5_bib9","volume":"Vol. 1","author":"Curry","year":"1958"},{"key":"10.1016\/S0019-9958(86)80019-5_bib10","series-title":"Ninth Annull ACM Symposium on Principles of Programming Languages","first-page":"207","article-title":"Principal type-schemes for Functional programs","author":"Damas","year":"1982"},{"key":"10.1016\/S0019-9958(86)80019-5_bib11","series-title":"Fourteenth Annu. ACM Sympos. Theory of Computing","first-page":"153","article-title":"Denotational semantics of concurrency","author":"de Bakker","year":"1982"},{"key":"10.1016\/S0019-9958(86)80019-5_bib12","article-title":"Interpretation fonctionelle et \u00e9limination des coupres de l'arithm\u00e9tique d'ordre sup\u00e9rieur","author":"Girard","year":"1972"},{"key":"10.1016\/S0019-9958(86)80019-5_bib13","article-title":"Edinburgh LCF","volume":"Vol. 78","author":"Gordon","year":"1979"},{"key":"10.1016\/S0019-9958(86)80019-5_bib14","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\/S0019-9958(86)80019-5_bib15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90136-6","article-title":"The completeness theorem for typing \u03bb-terms","volume":"22","author":"Hindley","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80019-5_bib16","series-title":"Set Theory and Metric Spaces","author":"Kaplansky","year":"1972"},{"key":"10.1016\/S0019-9958(86)80019-5_bib17","series-title":"Symposium on Lisp and Functional Programming","first-page":"243","article-title":"A higher order polymorphic type system for applicative languages","author":"MacQueen","year":"1982"},{"key":"10.1016\/S0019-9958(86)80019-5_bib18","article-title":"An investigation of a programming language with a polymorphic type structure","author":"McCracken","year":"1979"},{"issue":"No. 3","key":"10.1016\/S0019-9958(86)80019-5_bib19","doi-asserted-by":"crossref","first-page":"348","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\/S0019-9958(86)80019-5_bib20","series-title":"Twelfth Annu. ACM Sympos. Principles of Programming Languages","first-page":"37","article-title":"Abstract types have existential types","author":"Mitchell","year":"1985"},{"key":"10.1016\/S0019-9958(86)80019-5_bib21","article-title":"Lambda-calculus Models of Programming Languages","author":"Morris","year":"1968"},{"key":"10.1016\/S0019-9958(86)80019-5_bib22","series-title":"Advanced domains","author":"Plotkin","year":"1978"},{"key":"10.1016\/S0019-9958(86)80019-5_bib23","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"561","article-title":"A type assignment for the strongly normalizable \u03bb-terms, in J.P. Seldin and J. R. Hindley","author":"Pottinger","year":"1980"},{"key":"10.1016\/S0019-9958(86)80019-5_bib24","first-page":"408","article-title":"Towards a theory of type structure","volume":"Vol. 19","author":"Reynolds","year":"1974"},{"key":"10.1016\/S0019-9958(86)80019-5_bib25","series-title":"Mathematical Foundations of Software Development","first-page":"97","article-title":"Three approaches to type structure","volume":"Vol. 185","author":"Reynolds","year":"1985"},{"key":"10.1016\/S0019-9958(86)80019-5_bib26","first-page":"398","article-title":"Une extension de la th\u00e9orie des types","volume":"Vol. 62","author":"Salle","year":"1978"},{"key":"10.1016\/S0019-9958(86)80019-5_bib27","first-page":"97","article-title":"Continuous lattices","volume":"Vol. 274","author":"Scott","year":"1972"},{"key":"10.1016\/S0019-9958(86)80019-5_bib28","series-title":"4th Colloq. Automata, Languages and Programming","first-page":"465","article-title":"Data types as objects","volume":"Vol. 52","author":"Shamir","year":"1977"},{"issue":"No. 4","key":"10.1016\/S0019-9958(86)80019-5_bib29","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category-theoretic solution of recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(86)80019-5_bib30","series-title":"Introduction to Metric and Topological Spaces","author":"Sutherland","year":"1975"},{"key":"10.1016\/S0019-9958(86)80019-5_bib31","unstructured":"Wadge, W. W. (1978), Personal communication to R. Milner, March."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800195?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800195?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T03:52:29Z","timestamp":1550461949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995886800195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["S0019995886800195"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(86)80019-5","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}