{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T10:17:21Z","timestamp":1774865841846,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90095-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"109-119","source":"Crossref","is-referenced-by-count":77,"title":["The largest cartesian closed category of domains"],"prefix":"10.1016","volume":"27","author":[{"given":"Michael B.","family":"Smyth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90095-6_BIB1","series-title":"Th\u00e9se","article-title":"Mod\u00e9les compl\u00e8tement ad\u00e9quates et stables des lambda-calculs typ\u00e9s","author":"Berry","year":"1979"},{"key":"10.1016\/0304-3975(83)90095-6_BIB2","series-title":"MFCS '79","first-page":"108","article-title":"Full abstraction for a simple parallel programming language","volume":"74","author":"Hennessy","year":"1979"},{"key":"10.1016\/0304-3975(83)90095-6_BIB3","series-title":"Continuous Lattices","first-page":"298","article-title":"A motivation and generalization of Scott's notion of a continuous lattice","volume":"871","author":"Markowsky","year":"1981"},{"key":"10.1016\/0304-3975(83)90095-6_BIB4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1147\/rd.202.0138","article-title":"Bases for chain-continuous posets","volume":"20","author":"Markowsky","year":"1976","journal-title":"IBM J. Res. Develop"},{"key":"10.1016\/0304-3975(83)90095-6_BIB5","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(83)90095-6_BIB6","series-title":"Proc. Dalhousie Conf. on Toposes, Algebraic Geometry and Logic","first-page":"97","article-title":"Cotinuous lattices","volume":"274","author":"Scott","year":"1971"},{"key":"10.1016\/0304-3975(83)90095-6_BIB7","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900956?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900956?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:29:00Z","timestamp":1555111740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900956"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90095-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}