{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:49Z","timestamp":1725456769965},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540529538"},{"type":"electronic","value":"9783540471851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/bfb0029606","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"180-186","source":"Crossref","is-referenced-by-count":0,"title":["Retractions in comparing prolog semantics (extended abstract)"],"prefix":"10.1007","author":[{"given":"A.","family":"de Bruin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. P.","family":"de VINK","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,11]]},"reference":[{"key":"15_CR1","volume-title":"Mathematical Theory of Program Correctness","author":"J.W. Bakker de","year":"1980","unstructured":"J.W. de Bakker, Mathematical Theory of Program Correctness, Prentice Hall International, London (1980)."},{"key":"15_CR2","unstructured":"J.W. de Bakker, \u201cDesigning Concurrency Semantics,\u201d pp. 591\u2013598 in Proc. 11th World Computer Congress, G.X. Ritter (ed.) (1989)."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(84)90114-2","volume":"34","author":"J.W. Bakker de","year":"1984","unstructured":"J.W. de Bakker, J.A. Bergstra, J.W. Klop, and J.-J.Ch Meyer, \u201cLinear Time and Branching Time Semantics for Recursion with Merge,\u201d Theoretical Computer Science\n34, pp. 135\u2013156 (1984).","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/BF01941131","volume":"28","author":"J.W. Bakker de","year":"1988","unstructured":"J.W. de Bakker and J.-J.Ch. Meyer, \u201cMetric Semantics for Concurrency,\u201d BIT\n28, pp. 504\u2013529 (1988).","journal-title":"BIT"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(83)90079-8","volume":"26","author":"J.W. Bakker de","year":"1983","unstructured":"J.W. de Bakker, J.-J.Ch Meyer, and J.I Zucker, \u201cOn Infinite Computations in Denotational Semantics,\u201d Theoretical Computer Science\n26, pp. 53\u201382 (1983).","journal-title":"Theoretical Computer Science"},{"key":"15_CR6","first-page":"178","volume":"351","author":"A. Bruin de","year":"1989","unstructured":"A. de Bruin and E.P. de Vink, \u201cContinuation Semantics for Prolog with Cut,\u201d pp. 178\u2013192 in Proc. TAPSOFT'89, volume 1, J. D\u00edaz & F. Orejas (eds.), LNCS 351 (1989).","journal-title":"LNCS"},{"key":"15_CR7","volume-title":"Retractions in Comparing Prolog Semantics","author":"A. Bruin de","year":"1989","unstructured":"A. de Bruin and E.P. de Vink, \u201cRetractions in Comparing Prolog Semantics,\u201d Report IR-198, Vrije Universiteit, Amsterdam (1989)."},{"key":"15_CR8","first-page":"317","volume":"317","author":"J.N. Kok","year":"1988","unstructured":"J.N. Kok and J.J.M.M. Rutten, \u201cContractions in Comparing Concurrency Semantics,\u201d pp. 317\u2013332 in Proc. ICALP'88, T. Lepist\u00f6 & A. Salomaa (eds.), LNCS 317 (1988).","journal-title":"LNCS"},{"key":"15_CR9","volume-title":"Programming Calculi Based on Fixed Point Transformations: Semantics and Applications","author":"J. Meyer","year":"1985","unstructured":"J.-J.Ch. Meyer, Programming Calculi Based on Fixed Point Transformations: Semantics and Applications, Dissertation, Vrije Universiteit, Amsterdam (1985)."},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(88)90042-4","volume":"57","author":"J. Meyer","year":"1988","unstructured":"J.-J.Ch. Meyer and E.P. de Vink, \u201cApplications of Compactness in the Smyth Powerdomain of Streams,\u201d Theoretical computer Science\n57, pp. 251\u2013282 (1988).","journal-title":"Theoretical computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:09:40Z","timestamp":1549411780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540529538","9783540471851"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0029606","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}