{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:42Z","timestamp":1761611142142},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0890-5401(89)90068-0","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"123-167","source":"Crossref","is-referenced-by-count":42,"title":["Domain theoretic models of polymorphism"],"prefix":"10.1016","volume":"81","author":[{"given":"Thierry","family":"Coquand","sequence":"first","affiliation":[]},{"given":"Carl","family":"Gunter","sequence":"additional","affiliation":[]},{"given":"Glynn","family":"Winskel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90068-0_BIB1","series-title":"Logic in Computer Science","first-page":"122","article-title":"The finitary projection model for second order lambda calculus and solutions to higher order domain equations","author":"Amadio","year":"1986"},{"key":"10.1016\/0890-5401(89)90068-0_BIB2","series-title":"Fifth International Colloquium on Automata, Languages and Programs","first-page":"72","article-title":"Stable models of typed \u03bb-calculi","volume":"Vol. 62","author":"Berry","year":"1978"},{"key":"10.1016\/0890-5401(89)90068-0_BIB3","series-title":"Semantics of Data Types","first-page":"131","article-title":"The semantics of polymorphic lambda-calculus","volume":"Vol. 173","author":"Bruce","year":"1984"},{"key":"10.1016\/0890-5401(89)90068-0_BIB4","series-title":"Proceedings, Third Wokshop on the Mathematical Foundations of Programming Language Semantics","first-page":"344","article-title":"dI-domains as a model of polymorphism","volume":"Vol. 298","author":"Coquand","year":"1987"},{"key":"10.1016\/0890-5401(89)90068-0_BIB5","series-title":"Proceedings, Conference on Category Theory and Computer Science","first-page":"40","article-title":"An equational presentation of higher-order logic","volume":"Vol. 283","author":"Coquand","year":"1987"},{"key":"10.1016\/0890-5401(89)90068-0_BIB6","article-title":"Design and Implementation of a Simple Typed Language Based on the lambda-calculus","author":"Fairbairn","year":"1985"},{"key":"10.1016\/0890-5401(89)90068-0_BIB7","article-title":"Interpr\u00e9tation fonctionelle et \u00e9limination des coupures de l'arithm\u00e9tique d'ordre sup\u00e9rieur","author":"Girard","year":"1972"},{"key":"10.1016\/0890-5401(89)90068-0_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","article-title":"The system F of variable types, fifteen years later","volume":"45","author":"Girard","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90068-0_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90048-4","article-title":"Universal profinite domains","volume":"72","author":"Gunter","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(89)90068-0_BIB10","series-title":"Proceedings, Symposium on Logic in Computer Science","first-page":"194","article-title":"A framework for defining logics","author":"Harper","year":"1987"},{"key":"10.1016\/0890-5401(89)90068-0_BIB11","series-title":"The L.E.J. Brouwer Centenary Symposium","article-title":"The effective topos","author":"Hyland","year":"1982"},{"key":"10.1016\/0890-5401(89)90068-0_BIB12","series-title":"Proceedings, Conference on Abstract Datatypes, Sophia-Antipolis","article-title":"Using information systems to solve recursive domain equations effectively","volume":"Vol. 173","author":"Winskel","year":"1984"},{"key":"10.1016\/0890-5401(89)90068-0_BIB13","series-title":"Proceedings, Annu. ACM Symp. on Principles of Programming","article-title":"An ideal model for recursive polymorphic types","author":"MacQueen","year":"1984"},{"key":"10.1016\/0890-5401(89)90068-0_BIB14","series-title":"An intuitionistic theory of types","author":"Martin-L\u00f6f","year":"1971"},{"key":"10.1016\/0890-5401(89)90068-0_BIB15","author":"Martin-L\u00f6f","year":"1980"},{"key":"10.1016\/0890-5401(89)90068-0_BIB16","series-title":"Lecture Notes, Workshop on Semantics of Programming Languages","article-title":"The domain interpretation of type theory","author":"Martin-L\u00f6f","year":"1983"},{"key":"10.1016\/0890-5401(89)90068-0_BIB17","article-title":"An Investigation of a Programming Language with a Polymorphic Type Structure","author":"McCracken","year":"1979"},{"key":"10.1016\/0890-5401(89)90068-0_BIB18","series-title":"Proceedings, Conference on Category Theory and Computer Science","first-page":"12","article-title":"Polymorphism is set-theoretic constructively","author":"Pitts","year":"1987"},{"key":"10.1016\/0890-5401(89)90068-0_BIB19","series-title":"Lecture Notes, Pisa Summerschool","article-title":"Complete partial orders, a tool for making meanings","author":"Plotkin","year":"1978"},{"key":"10.1016\/0890-5401(89)90068-0_BIB20","series-title":"Semantics of Data Types","first-page":"145","article-title":"Polymorphism is not set-theoretic","volume":"Vol. 173","author":"Reynolds","year":"1984"},{"key":"10.1016\/0890-5401(89)90068-0_BIB21","series-title":"Colloque sur la Programmation","first-page":"408","article-title":"Towards a theory of type structures","volume":"Vol. 19","author":"Reynolds","year":"1974"},{"key":"10.1016\/0890-5401(89)90068-0_BIB22","series-title":"Ordered Sets","first-page":"677","article-title":"Some ordered sets in computer science","author":"Scott","year":"1981"},{"key":"10.1016\/0890-5401(89)90068-0_BIB23","series-title":"Internat. Colloq. Automata, Lang., Programming","article-title":"Domains for denotational semantics","volume":"Vol. 140","author":"Scott","year":"1982"},{"key":"10.1016\/0890-5401(89)90068-0_BIB24","series-title":"Categorical semantics for higher order polymorphic lambda calculus","author":"Seely","year":"1986"},{"key":"10.1016\/0890-5401(89)90068-0_BIB25","doi-asserted-by":"crossref","first-page":"840","DOI":"10.2307\/2274575","article-title":"The independence of Peano's fourth axiom from Martin-L\u00f6f's type theory without universes","volume":"53","author":"Smith","year":"1988","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0890-5401(89)90068-0_BIB26","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","article-title":"Effectively given domains","volume":"5","author":"Smyth","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90068-0_BIB27","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(83)90095-6","article-title":"The largest cartesian-closed category of domains","volume":"27","author":"Smyth","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90068-0_BIB28","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\/0890-5401(89)90068-0_BIB29","article-title":"Recursive Domains, Indexed Category Theory and Polymorhism","author":"Taylor","year":"1987"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900680?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900680?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:27:11Z","timestamp":1549027631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0890540189900680"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90068-0","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}