{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:57Z","timestamp":1761610077190,"version":"build-2065373602"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(04)80014-8","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T15:29:25Z","timestamp":1096385365000},"page":"253-272","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Maximal Limit Spaces, Powerspaces, and Scott Domains"],"prefix":"10.1016","volume":"1","author":[{"given":"D.N.","family":"Hoover","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB1","unstructured":"Karl Aberer. Combinatory differential fields: An algebraic approach to approximate computation and constructive analysis. Technical Report TR-91-061, International Computer Science Institute, Berkeley, CA 94704, 1991."},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB2","article-title":"Domain theory","volume":"volume 2","author":"Abramsky","year":"1993"},{"year":"1990","series-title":"Set-Valued Analysis","author":"Aubin","key":"10.1016\/S1571-0661(04)80014-8_NEWBIB3"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB4","series-title":"Topology and Category Theory in Computer Science","first-page":"113","article-title":"Concurrency semantics based on metric domain equations","author":"de Bakker","year":"1992"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Abbas Edalat. Dynamical systems, measures and fractals via domain theory. Information and Computation, 1993. To appear.","DOI":"10.1007\/978-1-4471-3503-6_7"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB6","series-title":"LICS '94","article-title":"Domain theory and integration","author":"Edalat","year":"1994"},{"year":"1980","series-title":"A Compendium of Continuous Lattices","author":"Gierz","key":"10.1016\/S1571-0661(04)80014-8_NEWBIB7"},{"year":"1992","series-title":"Semantics of Programming Languages. Structures and Techniques","author":"Gunter","key":"10.1016\/S1571-0661(04)80014-8_NEWBIB8"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB9","doi-asserted-by":"crossref","unstructured":"K. H. Hofmann and M. W. Mislove. Local compactness and continuous lattices. In B. Banaschewski and R.-E. Hoffmann, editors, Continuous Lattices, Proceedings Bremen 1979, pages 209\u2013248. Springer-Verlag, 1981. Lecture Notes in Mathematics 871.","DOI":"10.1007\/BFb0089908"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB10","unstructured":"D. N. Hoover. Denotational semantics of numerical programs. Technical Report 92-0004, Odyssey Research Associates, Inc., July 1992."},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB11","unstructured":"D. N. Hoover. Limiting semantics of numerical programs. Technical report, Odyssey Research Associates, Inc., November 1994."},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1080\/17442508108833169","article-title":"Existence of weak solutions for stochastic differential equations with driving semimartingales","volume":"4","author":"Jacod","year":"1984","journal-title":"Stochastics"},{"year":"1955","series-title":"General Topology","author":"Kelley","key":"10.1016\/S1571-0661(04)80014-8_NEWBIB13"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB14","series-title":"Topology and Category Theory in Computer Science","first-page":"179","article-title":"Order and strongly sober compactifications","author":"Lawson","year":"1992"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02924844","article-title":"Metric spaces, closed categories, and generalized logic","volume":"43","author":"Lawvere","year":"1973","journal-title":"Rendiconti del Seminario Matematico e Fisico di Milano"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB16","first-page":"1","article-title":"Infinite words, infinite trees, infinite computations","volume":"109","author":"Nivat","year":"1979","journal-title":"Mathematical Centre Tracts"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB17","unstructured":"Andrea Schalk. Algebras for Generalized Power Constructions. PhD thesis, Technische Hochschule Darmstadt, 1993."},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB18","unstructured":"D. S. Scott. Outline of a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, pages 169\u2013176, 1970."},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB19","doi-asserted-by":"crossref","unstructured":"D. S. Scott. Continuous lattices. In Proceedings of the 1971 Dalhousie Conference, pages 97\u2013136, 1972. Lecture Notes in Mathematics 274.","DOI":"10.1007\/BFb0073967"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB20","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 Journal on Computing"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Power domains","volume":"16","author":"Smyth","year":"1978","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB22","doi-asserted-by":"crossref","unstructured":"M. B. Smyth. Power domains and predicate transformers: a topological view. In Automata, Languages and Programming, 10th Colloquium, pages 662\u2013675, 1983. Lecture Notes in Computer Science 74.","DOI":"10.1007\/BFb0036946"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB23","series-title":"Third Workshop on Mathematical Foundations of Programming Language Semantics","first-page":"236","article-title":"Quasi-uniformities: Reconciling domains with metric spaces","author":"Smyth","year":"1988"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB24","series-title":"Topology and Category Theory in Computer Science","first-page":"207","article-title":"Totally bounded spaces and compact ordered spaces as domains of computation","author":"Smyth","year":"1992"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB25","article-title":"Topology","volume":"volume 1","author":"Smyth","year":"1993"},{"issue":"2","key":"10.1016\/S1571-0661(04)80014-8_NEWBIB26","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1112\/jlms\/49.2.385","article-title":"Completeness of quasi-uniform and syntopological spaces","volume":"49","author":"Smyth","year":"1994","journal-title":"Journal of the London Mathematical Society (2)"},{"key":"10.1016\/S1571-0661(04)80014-8_NEWBIB27","unstructured":"Philipp S\u00fcnderhauf. Discrete Approximation of Spaces. PhD thesis, Technische Hochschule Darmstadt, 1994."},{"year":"1991","series-title":"Semantics of Programming Languages","author":"Tennent","key":"10.1016\/S1571-0661(04)80014-8_NEWBIB28"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800148?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800148?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:04:07Z","timestamp":1761609847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104800148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":28,"alternative-id":["S1571066104800148"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80014-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maximal Limit Spaces, Powerspaces, and Scott Domains","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80014-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}