{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:45Z","timestamp":1761611145888},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987,1]]},"DOI":"10.1016\/0890-5401(87)90048-4","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"1-30","source":"Crossref","is-referenced-by-count":30,"title":["Universal profinite domains"],"prefix":"10.1016","volume":"72","author":[{"given":"Carl A.","family":"Gunter","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(87)90048-4_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(87)90048-4_BIB2","article-title":"The Lambda Calculus: Its Syntax and Semantics","volume":"Vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/0890-5401(87)90048-4_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(89)90166-7","article-title":"Continuously Generated Fixed-Points","author":"Bracho","year":"1983"},{"key":"10.1016\/0890-5401(87)90048-4_BIB4","article-title":"Profinite Solutions for Recursive Domain Equations","author":"Gunter","year":"1985"},{"key":"10.1016\/0890-5401(87)90048-4_BIB5","series-title":"Mathematical Foundations of Computer Science","first-page":"108","article-title":"Full abstraction for a simple parallel programming language","volume":"Vol. 74","author":"Hennessy","year":"1979"},{"key":"10.1016\/0890-5401(87)90048-4_BIB6","series-title":"Automata, Languages and Programming","first-page":"281","article-title":"Powerdomain construction in the category of algebraic lattices","volume":"Vol. 194","author":"Hrbacek","year":"1985"},{"key":"10.1016\/0890-5401(87)90048-4_BIB7","series-title":"A note on inconsistencies caused by fix-points in a cartesian closed category","author":"Huwig","year":"1986"},{"key":"10.1016\/0890-5401(87)90048-4_BIB29","unstructured":"Kamimura, T., and Tang, A. (in press). Finitely continuous posets, Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(87)90048-4_BIB8","series-title":"Mathematical Foundations of Computer Science","article-title":"Fully effective solutions of recursive domain equations","volume":"Vol. 74","author":"Kanda","year":"1979"},{"key":"10.1016\/0890-5401(87)90048-4_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09526-8_30","article-title":"Effective Solutions of Recursive Domain Equations","author":"Kanda","year":"1980"},{"key":"10.1016\/0890-5401(87)90048-4_BIB10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0019-9958(82)90796-3","article-title":"Models of the lambda calculus","volume":"52","author":"Koymans","year":"1982","journal-title":"Inform. Contr."},{"key":"10.1016\/0890-5401(87)90048-4_BIB11","article-title":"Introduction to Higher-Order Categorical Logic","volume":"Vol. 7","author":"Lambek","year":"1986"},{"key":"10.1016\/0890-5401(87)90048-4_BIB12","series-title":"Category Theory, Homology Theory and their Aplications II","article-title":"Diagonal arguments and cartesian closed categories","volume":"Vol. 92","author":"Lawvere","year":"1969"},{"key":"10.1016\/0890-5401(87)90048-4_BIB13","series-title":"Principles of Programming Languages","first-page":"165","article-title":"An ideal model for recursive polymorphic types","author":"MacQueen","year":"1984"},{"key":"10.1016\/0890-5401(87)90048-4_BIB14","article-title":"Full Abstraction and Semantic Equivalence","author":"Mulmuley","year":"1985"},{"key":"10.1016\/0890-5401(87)90048-4_BIB15","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"Plotkin","year":"1976","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0890-5401(87)90048-4_BIB16","series-title":"Summer School on Foundations of Artificial Intelligence and Computer Science","article-title":"The category of complete partial orders: A tool for making meaning","author":"Plotkin","year":"1978"},{"key":"10.1016\/0890-5401(87)90048-4_BIB17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","article-title":"T\u03c9 as a universal domain","volume":"17","author":"Plotkin","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(87)90048-4_BIB18","series-title":"Category Theory and Computer Programming","first-page":"252","article-title":"A note on distributive laws and power domains","volume":"Vol. 240","author":"Poign\u00e9","year":"1986"},{"key":"10.1016\/0890-5401(87)90048-4_BIB19","series-title":"Toposes, Algebraic Geometry and Logic","first-page":"97","article-title":"Continuous lattices","volume":"Vol. 274","author":"Scott","year":"1976"},{"key":"10.1016\/0890-5401(87)90048-4_BIB20","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(87)90048-4_BIB21","article-title":"Lectures on a Mathematical Theory of Computation","author":"Scott","year":"1981"},{"key":"10.1016\/0890-5401(87)90048-4_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(87)90048-4_BIB23","series-title":"Automata, Languages and Programming","first-page":"577","article-title":"Domains for denotational semantics","volume":"Vol. 140","author":"Scott","year":"1982"},{"key":"10.1016\/0890-5401(87)90048-4_BIB24","series-title":"Notes on cpo's\/SFP-objects and the like","author":"Scott","year":"1982"},{"key":"10.1016\/0890-5401(87)90048-4_BIB25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Powerdomains","volume":"16","author":"Smyth","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(87)90048-4_BIB26","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(87)90048-4_BIB27","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(87)90048-4_BIB28","series-title":"Semantics of Data Types","first-page":"109","article-title":"Using information systems to solve recursive domain equations effectively","volume":"Vol. 173","author":"Winskel","year":"1984"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900484?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900484?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:26:16Z","timestamp":1548879976000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540187900484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0890540187900484"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(87)90048-4","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}