{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:24Z","timestamp":1725663384768},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190202"},{"type":"electronic","value":"9783540389200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19020-1_15","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:54:59Z","timestamp":1330181699000},"page":"303-310","source":"Crossref","is-referenced-by-count":2,"title":["New results on hierarchies of domains"],"prefix":"10.1007","author":[{"given":"Achim","family":"Jung","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"15_CR1","volume-title":"Profinite Solutions for Recursive Domain Equations","author":"C. Gunter","year":"1985","unstructured":"C. Gunter:Profinite Solutions for Recursive Domain Equations. Doctoral Dissertation, University of Wisconsin, Madison 1985."},{"key":"15_CR2","series-title":"Technical report","volume-title":"Comparing Categories of Domains","author":"C. Gunter","year":"1985","unstructured":"C. Gunter:Comparing Categories of Domains. Technical report, Carnegie-Mellon University, Pittsburg 1985."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02485815","volume":"6","author":"G. Markowsky","year":"1976","unstructured":"G. Markowsky:Chain-complete p.o. sets and directed sets with applications. Algebra Universalis 6 (1976), p.53\u201368.","journal-title":"Algebra Universalis"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. Plotkin","year":"1976","unstructured":"G. Plotkin:A powerdomain construction. SIAM J. Comput. 5 (1976), p.452\u2013488.","journal-title":"SIAM J. Comput."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(83)90095-6","volume":"27","author":"M. B. Smyth","year":"1983","unstructured":"M.B. Smyth:The Largest Cartesian Closed Category of Domains. Theoretical Computer Science 27 (1983), p.109\u2013119.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Language Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19020-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:18:58Z","timestamp":1619543938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19020-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190202","9783540389200"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-19020-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}