{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:19:18Z","timestamp":1694629158305},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T00:00:00Z","timestamp":1174348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T00:00:00Z","timestamp":1174348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s00500-007-0153-3","type":"journal-article","created":{"date-parts":[[2007,3,19]],"date-time":"2007-03-19T12:09:23Z","timestamp":1174306163000},"page":"1059-1063","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A concrete realization of the Hoare powerdomain"],"prefix":"10.1007","volume":"11","author":[{"given":"James B.","family":"Hart","sequence":"first","affiliation":[]},{"given":"Constantine","family":"Tsinakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,20]]},"reference":[{"key":"153_CR1","first-page":"1","volume-title":"Handbook of logic in computer science","author":"S Abramsky","year":"1994","unstructured":"Abramsky S, Jung A (1994) Domain theory. In: Abramsky S, Gabbay D, Maibaum TSE (eds). Handbook of logic in computer science. Oxford University Press, New York, pp. 1\u2013168"},{"key":"153_CR2","volume-title":"Introduction to lattices and order","author":"BA Davey","year":"1990","unstructured":"Davey BA, Priestley HA (1990) Introduction to lattices and order. Cambridge University Press, Cambridge"},{"key":"153_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(90)90097-2","volume":"75","author":"M Droste","year":"1990","unstructured":"Droste M, G\u00f6bel R (1990) Non-deterministic information systems and their domains. Theor Comput Sci 75:289\u2013309","journal-title":"Theor Comput Sci"},{"key":"153_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-67678-9","volume-title":"A compendium of continuous lattices","author":"G Geirz","year":"1980","unstructured":"Geirz G, Hofmann KH, Keimel K, Lawson JD, Mislove M, Scott DS (1980) A compendium of continuous lattices. Springer, Berlin"},{"key":"153_CR5","first-page":"142","volume-title":"Symposium on logic in computer science","author":"C Gunter","year":"1986","unstructured":"Gunter C (1986) The largest first-order axiomatizable cartesian-closed category of domains. In: Meyer AR (ed) Symposium on logic in computer science. IEEE Computer Soc. Press, Silver Spring, pp 142\u2013148"},{"issue":"1","key":"153_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(87)90048-4","volume":"72","author":"C Gunter","year":"1987","unstructured":"Gunter C (1987) Universal profinite domains. Inform Comput 72(1): 1\u201330","journal-title":"Inform Comput"},{"key":"153_CR7","unstructured":"Gunter C (1985) Profinite solutions for recursive domain equations, Technical Report CMU-CS-85-107, Carnegie-Melon University"},{"key":"153_CR8","unstructured":"Jung A (1989) Cartesian closed categories of domains, CWI Tracts, Centrum voor Wiskunde en Informatica, vol 66"},{"key":"153_CR9","doi-asserted-by":"crossref","unstructured":"Jung A (1988) New results on hierarchies of domains. In: Mathematical foundations of programming language semantics. Lecture Notes on Computer Science, vol 238. Springer, New York, pp. 303\u2013310","DOI":"10.1007\/3-540-19020-1_15"},{"key":"153_CR10","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"GD Plotkin","year":"1976","unstructured":"Plotkin GD (1976) A powerdomain construction. SIAM J Comput 5:452\u2013487","journal-title":"SIAM J Comput"},{"key":"153_CR11","unstructured":"Plotkin GD (1981) Post-graduate lecture notes in advanced domain theory (incorporating the Pisa Lecture Notes). Technical report, Department of Computer Science, University of Edinburgh"},{"key":"153_CR12","unstructured":"Scott DS (1970) Outline of a mathematical theory of computation. In: Proceedings of 4th annual Princeton conference on information science and systems, pp 169\u2013176"},{"key":"153_CR13","doi-asserted-by":"crossref","unstructured":"Scott DS (1971) The lattice of flow diagrams. In: Engeler E (ed) Symposium on semantics of algorithmic languages. Lecture Notes in Mathematics, vol 188. Springer, New York, pp 311\u2013366","DOI":"10.1007\/BFb0059703"},{"key":"153_CR14","first-page":"65","volume-title":"Formal semantics of programming languages","author":"DS Scott","year":"1972a","unstructured":"Scott DS (1972a) Lattice theory, data types, and semantics. In: Rustin R (eds). Formal semantics of programming languages. Prentice Hall, Englewood Cliffs, pp. 65\u2013106"},{"key":"153_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0073967","volume-title":"Toposes, algebraic geometry and logic. Lecture Notes in Mathematics 274","author":"DS Scott","year":"1972b","unstructured":"Scott DS (1972b) Continuous lattices. In: Lawvere FW (eds). Toposes, algebraic geometry and logic. Lecture Notes in Mathematics 274. Springer, New York, pp. 97\u2013136"},{"key":"153_CR16","doi-asserted-by":"crossref","unstructured":"Scott DS (1982) Domains for denotational semantics. In: Lecture notes in computer science, vol 140. Springer, Berlin, pp 577\u2013613","DOI":"10.1007\/BFb0012801"},{"key":"153_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(83)90095-6","volume":"27","author":"M Smyth","year":"1983","unstructured":"Smyth M (1983) The largest cartesian-closed category of domains. Theor Comput Sci 27:109\u2013119","journal-title":"Theor Comput Sci"},{"key":"153_CR18","volume-title":"Topology via logic","author":"S Vickers","year":"1989","unstructured":"Vickers S (1989) Topology via logic. Cambridge University Press, Cambridge"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0153-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-007-0153-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0153-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0153-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T20:21:04Z","timestamp":1652905264000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-007-0153-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,20]]},"references-count":18,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["153"],"URL":"https:\/\/doi.org\/10.1007\/s00500-007-0153-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,20]]},"assertion":[{"value":"20 March 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}