{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:25:30Z","timestamp":1648988730727},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bf00572989","type":"journal-article","created":{"date-parts":[[2004,11,20]],"date-time":"2004-11-20T20:28:54Z","timestamp":1100982534000},"page":"217-245","source":"Crossref","is-referenced-by-count":2,"title":["Describing semantic domains with sprouts"],"prefix":"10.1007","volume":"27","author":[{"given":"Gunther","family":"Schmidt","sequence":"first","affiliation":[]},{"given":"Rudolf","family":"Berghammer","sequence":"additional","affiliation":[]},{"given":"Hans","family":"Zierer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","series-title":"CMU-CS-85-107","volume-title":"Profinite solutions for recursive domain equations","author":"C.A. Gunter","year":"1985","unstructured":"Gunter, C.A.: Profinite solutions for recursive domain equations. CMU-CS-85-107, Carnegie-Mellon University, Pittsburgh, Pa 1985"},{"key":"CR2","series-title":"CMU-CS-85-141","volume-title":"Comparing categories of domains","author":"C.A. Gunter","year":"1985","unstructured":"Gunter, C.A.: Comparing categories of domains. CMU-CS-85-141, Carnegie-Mellon University, Pittsburgh, Pa 1985"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Winskel, G.: Using information systems to solve recursive domain equations effectively. In: Kahn, G., MacQueen, D.B., Plotkin, G. (eds.) Semantics of data types, pp. 109?130. Lect. Notes Comput. Sci.173. Heidelberg Berlin New York: Springer 1984","DOI":"10.1007\/3-540-13346-1_5"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"Plotkin, G.: LCF considered as a programming language. Theor. Comput. Sci.5, 223?255 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"CR5","unstructured":"Schmidt, G.: Semantik der Programmiersprachen. Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen 1985 (Unpublished lecture notes)"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Schmidt, G., Berghammer, R., Zierer, H.: Describing semantic domains with sprouts. In: Brandenburg, F., Vidal-Naquet, G., Wirsing, M. (eds.) 4th Symposium on Theoretical Aspects of Computer Science, pp. 299?310. February, 19?21, 1987, Passau. Lect. Notes Comput. Sci.247. Heidelberg Berlin New York: Springer 1987","DOI":"10.1007\/BFb0039614"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Scott, D.S.: Continuous lattices. In: Lawvere, F.W. (ed.) Proc. Dalhousie Conf. on Toposes, Algebraic Geometry and Logic, pp. 97?136. Lect. Notes Math.274. Heidelberg Berlin New York: Springer 1972","DOI":"10.1007\/BFb0073967"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Scott, D.S.: Domains for denotational semantics. In: Nielsen, M., Schmidt, E.M. (eds.) 9th Int. Coll. on Automata, Languages and Programming, pp. 577?613. Lect. Notes Comput. Sci.140. Heideberg Berlin New York: Springer 1982","DOI":"10.1007\/BFb0012801"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(83)90095-6","volume":"27","author":"M.B. Smyth","year":"1983","unstructured":"Smyth, M.B.: The largest cartesian closed category of domains. Theoret. Comput. Sci.27, 109?119 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M.B. Smyth","year":"1982","unstructured":"Smyth, M.B., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM J. Comput.11, 761?783 (1982)","journal-title":"SIAM J. Comput."},{"key":"CR11","unstructured":"Stoy, J.E.: Denotational semantics: The Scott-Strachey approach to programming language theory. MIT Press 1977"},{"key":"CR12","unstructured":"Zierer, H.: Programmierung mit Funktionsobjekten: Konstruktive Erzeugung semantischer Bereiche und Anwendung auf die partielle Auswertung. Dissertation, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen 1988"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00572989.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00572989\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00572989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T15:05:51Z","timestamp":1554822351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00572989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989]]}},"alternative-id":["BF00572989"],"URL":"https:\/\/doi.org\/10.1007\/bf00572989","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}