{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:28:41Z","timestamp":1781386121023,"version":"3.54.1"},"reference-count":24,"publisher":"Elsevier","isbn-type":[{"value":"9780444880741","type":"print"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1016\/b978-0-444-88074-1.50017-2","type":"book-chapter","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T10:34:48Z","timestamp":1404124488000},"page":"633-674","source":"Crossref","is-referenced-by-count":56,"title":["Semantic Domains"],"prefix":"10.1016","author":[{"given":"C.A.","family":"GUNTER","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.S.","family":"SCOTT","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib1","volume":"103","author":"BARENDREGT","year":"1984"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib2","doi-asserted-by":"crossref","unstructured":"BERRY, G., Stable models of typed \u03bb-calculi, in: Proc. 5th Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 62 (Springer, Berlin, 1978) 72\u201389.","DOI":"10.1007\/3-540-08860-1_7"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02483849","article-title":"Algebra and combinators","volume":"13","author":"ENGELER","year":"1981","journal-title":"Algebra Universalis"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib4","unstructured":"ENGELER, E., A combinatory representation of varieties and universal classes. Algebra Universalis, to appear."},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib5","series-title":"A Compendium of Continuous Lattices","author":"GIERZ","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib6","unstructured":"GUNTER, C.A., The largest first-order axiomatizable cartesian closed category of domains, in: Proc. Symp. on Logic in Computer Science (IEEE Computer Soc. Press, Silver Spring, MD, 1986) 142\u2013148."},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90048-4","article-title":"Universal profinite domains","volume":"72","author":"GUNTER","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-4049(90)90055-M","article-title":"Coherence and consistency in domains","volume":"63","author":"GUNTER","year":"1990","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(84)90016-1","article-title":"Effectively given spaces","volume":"29","author":"KAMIMURA","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib10","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\/B978-0-444-88074-1.50017-2_bib11","first-page":"43","article-title":"Rule-based semantics for an extended lambda-calculus","volume":"298","author":"R\u00c9V\u00c9SZ","year":"1987"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib12","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\/B978-0-444-88074-1.50017-2_bib13","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/359810.359826","article-title":"Logic and programming languages","volume":"20","author":"SCOTT","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib14","series-title":"The Kleene Symposium","first-page":"381","article-title":"The lambda calculus: some models, some philosophy","author":"SCOTT","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib15","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"403","article-title":"Relating theories of the lambda calculus","author":"SCOTT","year":"1980"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib16","series-title":"Ordered Sets","first-page":"677","article-title":"Some ordered sets in computer science","author":"SCOTT","year":"1981"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib17","doi-asserted-by":"crossref","unstructured":"SCOTT, D.S., Domains for denotational semantics, in: M. Nielsen and E.M. Schmidt, eds., Proc. 9th Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 140 (Springer, Berlin, 1982) 577\u2013613.","DOI":"10.1007\/BFb0012801"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib18","series-title":"Theoretical Foundations of Programming Methodology","first-page":"145","article-title":"Lectures on a mathematical theory of computation","author":"SCOTT","year":"1982"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","article-title":"Effectively given domains","volume":"5","author":"SMYTH","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib20","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":"J. Comput. System Sci."},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib21","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\/B978-0-444-88074-1.50017-2_bib22","doi-asserted-by":"crossref","unstructured":"SMYTH, M., Power domains and predicate transformers: a topological view, in: J. Diaz, ed., Proc. 10th Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 154 (Springer, Berlin, 1983) 662\u2013676.","DOI":"10.1007\/BFb0036946"},{"key":"10.1016\/B978-0-444-88074-1.50017-2_bib23","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\/B978-0-444-88074-1.50017-2_bib24","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01191754","article-title":"Order completion monads","volume":"16","author":"MESEGUER","year":"1983","journal-title":"Algebra Universalis"}],"container-title":["Formal Models and Semantics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444880741500172?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444880741500172?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T14:28:51Z","timestamp":1538490531000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444880741500172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780444880741"],"references-count":24,"URL":"https:\/\/doi.org\/10.1016\/b978-0-444-88074-1.50017-2","relation":{},"subject":[],"published":{"date-parts":[[1990]]}}}