{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:38:04Z","timestamp":1752230284542},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"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":[[1990,10]]},"DOI":"10.1016\/0304-3975(90)90097-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"289-309","source":"Crossref","is-referenced-by-count":19,"title":["Non-deterministic information systems and their domains"],"prefix":"10.1016","volume":"75","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"G\u00f6bel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90097-2_BIB1","first-page":"771","article-title":"On the partially ordered set of prime ideals of a distributive lattice, II","volume":"26","author":"Balbes","year":"1978","journal-title":"Bull. Acad. Polon. Sci. S\u00e9r. Math. Astron. Phys."},{"key":"10.1016\/0304-3975(90)90097-2_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","article-title":"Sequential algorithms on concrete data structures","volume":"20","author":"Berry","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90097-2_BIB3","series-title":"Research Notes in Theoretical Computer Science","article-title":"Categorial Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1986"},{"key":"10.1016\/0304-3975(90)90097-2_BIB4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(89)90117-5","article-title":"Event structures and domains","volume":"68","author":"Droste","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90097-2_BIB5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0890-5401(89)90065-5","article-title":"Recursive domain equations for concrete data structures","volume":"82","author":"Droste","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(90)90097-2_BIB6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.2307\/2043231","article-title":"Separation axioms for interval topologies","volume":"79","author":"Ern\u00e9","year":"1980","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(90)90097-2_BIB7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1216\/RMJ-1981-11-2-271","article-title":"Generalized continuous and hypercontinuous lattices","volume":"11","author":"Gierz","year":"1981","journal-title":"Rocky Mountain J. Math."},{"key":"10.1016\/0304-3975(90)90097-2_BIB8","series-title":"Dissertation","article-title":"Cartesian closed categories of algebraic cpo's","author":"Jung","year":"1988"},{"key":"10.1016\/0304-3975(90)90097-2_BIB9","series-title":"Rapport de Recherche no. 336","article-title":"Domaines concretes","author":"Kahn","year":"1978"},{"key":"10.1016\/0304-3975(90)90097-2_BIB10","series-title":"Semantics of Data Types, International Symposium Sophia-Antipolis 1984","first-page":"109","article-title":"Using information systems to solve recursive domain equations effectively","volume":"173","author":"Larsen","year":"1984"},{"key":"10.1016\/0304-3975(90)90097-2_BIB11","first-page":"97","article-title":"Data types","author":"Lehmann","year":"1977","journal-title":"Proc. 18th Conf. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90097-2_BIB12","doi-asserted-by":"crossref","first-page":"820","DOI":"10.4153\/CJM-1976-079-2","article-title":"The ordering of Spec R","volume":"3","author":"Lewis","year":"1976","journal-title":"Canad. J. Math."},{"key":"10.1016\/0304-3975(90)90097-2_BIB13","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\/0304-3975(90)90097-2_BIB14","series-title":"Orders: Description and Roles","first-page":"39","article-title":"Ordered sets and duality for distributive lattices","volume":"23","author":"Priestley","year":"1984"},{"key":"10.1016\/0304-3975(90)90097-2_BIB15","series-title":"Proc. 1971 Dalhousie Conference on Toposes, Algebraic Geometry and Logic","first-page":"97","article-title":"Continuous lattices","volume":"274","author":"Scott","year":"1971"},{"key":"10.1016\/0304-3975(90)90097-2_BIB16","series-title":"Proc. 9th Internat. Coll. on Automata, Languages and Programming","first-page":"577","article-title":"Domains for denotational semantics","volume":"140","author":"Scott","year":"1982"},{"key":"10.1016\/0304-3975(90)90097-2_BIB17","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\/0304-3975(90)90097-2_BIB18","article-title":"The category-theoretic solution of recursive domain equations","author":"Smyth","year":"1977","journal-title":"Proc. 18th Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90097-2_BIB19","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Languages","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(90)90097-2_BIB20","series-title":"Research Report TR 23","article-title":"Fixed-point constructions in order-enriched categories","author":"Wand","year":"1975"},{"key":"10.1016\/0304-3975(90)90097-2_BIB21","first-page":"325","article-title":"Event Structures","volume":"255","author":"Winskel","year":"1987"},{"key":"10.1016\/0304-3975(90)90097-2_BIB22","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1090\/S0002-9939-1958-0096596-8","article-title":"Order-compatible topologies on a partially ordered set","volume":"9","author":"Wolk","year":"1958","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(90)90097-2_BIB23","series-title":"PhD thesis","article-title":"Logic of domains","author":"Zhang","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590900972?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590900972?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:52:14Z","timestamp":1555113134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397590900972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["0304397590900972"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90097-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}