{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:38Z","timestamp":1725663398649},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540176602"},{"type":"electronic","value":"9783540477464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17660-8_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:17:08Z","timestamp":1330197428000},"page":"241-255","source":"Crossref","is-referenced-by-count":1,"title":["Applications of compactness in the Smyth powerdomain of streams"],"prefix":"10.1007","author":[{"given":"J. -J. Ch.","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. P.","family":"Vink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(83)90055-5","volume":"23","author":"R.J.R. Back","year":"1983","unstructured":"R.J.R. Back, \u201cA Continuous Semantics for Unbounded Nondeterminism,\u201d Theoretical Computer Science 23, pp. 187\u2013210 (1983).","journal-title":"Theoretical Computer Science"},{"key":"17_CR2","unstructured":"J.W. de Bakker, Mathematical Theory of Program Correctness, Prentice-Hall (1980)."},{"key":"17_CR3","doi-asserted-by":"publisher","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 34, pp. 135\u2013156 (1984).","journal-title":"Theoretical Computer Science"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"J.W. de Bakker and J.N. Kok, \u201cTowards a Uniform Topological Treatment of Streams and Functions on Streams,\u201d Proceedings of the 12th ICALP, pp. 140\u2013148, Springer, LNCS 194 (1985).","DOI":"10.1007\/BFb0015739"},{"key":"17_CR5","unstructured":"J.W. de Bakker, J.N. Kok, J.-J.Ch. Meyer, E.-R. Olderog and J.I. Zucker, \u201cContrasting Themes in the Semantics of Imperative Concurrency,\u201d in Current Trends in Concurrency: Overviews and Tutorials, pp. 51\u2013121, Springer, LNCS 224 (1986)."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"J.W. de Bakker, J.-J.Ch. Meyer, and E.-R. Olderog, \u201cInfinite Streams and Finite Observations in the Semantics of Uniform Concurrency,\u201d Proceedings of the 12th ICALP, pp. 149\u2013157, Springer, LNCS 194 (1985).","DOI":"10.1007\/BFb0015740"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"J.W. de Bakker and J.I. Zucker, \u201cCompactnes in Semantics for Merge and Fair Merge,\u201d Proceedings Workshop Logics of Programs, Pittsburgh, pp. 18\u201333, Springer, LNCS 154 (1983).","DOI":"10.1007\/3-540-12896-4_352"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra and J.W. Klop, \u201cProcess Algebra for Synchronous Communication,\u201d Information and Control 60, pp. 109\u2013137 (1984).","journal-title":"Information and Control"},{"key":"17_CR9","volume-title":"Proceedings of the IFIP TC2 Working Conference '82","author":"M. Broy","year":"1983","unstructured":"M. Broy, \u201cFixed Point Theory for Communication and Concurrency,\u201d Proceedings of the IFIP TC2 Working Conference '82, Garmisch-Partenkirchen, North-Holland (1983)."},{"key":"17_CR10","unstructured":"M. Broy, \u201cExtensional Behaviour of Concurrent, Nondetermininstic, Communicating Systems,\u201d pp. 229\u2013276 in Control Flow and Data Flow: Concepts of Distributed Programming, ed. M. Broy, Springer (1985)."},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1147\/rd.191.0012","volume":"19","author":"W.H. Burge","year":"1975","unstructured":"W.H. Burge, \u201cStream Processing Functions,\u201d IBM Journal of Research and Development 19, pp. 12\u201325 (1975).","journal-title":"IBM Journal of Research and Development"},{"key":"17_CR12","unstructured":"J. Dugundji, Topology, Allyn and Bacon (1966)."},{"key":"17_CR13","unstructured":"R. Engelking, General Topology, Polish Scientific Publishers (1977)."},{"key":"17_CR14","unstructured":"N.D. Jones and A. Mycroft, \u201cStepwise Development of Operational and Denotational Semantics for Prolog,\u201d 1984 International Symposium on Logic Programming, Atlantic City, pp. 281\u2013288 (1984)."},{"key":"17_CR15","unstructured":"R. Kuiper, \u201cAn Operational Semantics for Bounded Nondeterminism Equivalent to a Denotaional One,\u201d IFIP TC2-MC Symposium on Algorithmic Languages, Amsterdam, pp. 373\u2013398, North-Holland (1981)."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, Springer (1984).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"17_CR17","unstructured":"M. Maine, \u201cDemons, Chaos and Communicating Processes: A Model Theory for Milner's CCS in Terms of Smyth Powerdomains,\u201d Proceedings of the Workshop on Mathematical Foundations of Programming Semantics (1986)."},{"key":"17_CR18","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, Free University, Dissertation, Amsterdam (1985)."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"J.-J.Ch. Meyer, \u201cMerging Regular Processes by Means of Fixed Point Theory,\u201d Theoretical Computer Science, to appear.","DOI":"10.1016\/0304-3975(86)90045-9"},{"key":"17_CR20","unstructured":"J.-J.Ch. Meyer and E.-R. Olderog, \u201cHiding in Stream Semantics of Uniform Concurrency,\u201d Technical Report, Free University, Amsterdam. In preparation."},{"key":"17_CR21","series-title":"Technical Report","volume-title":"Applications of Compactness in the Smyth Powerdomain of Streams","author":"J. Meyer","year":"1986","unstructured":"J.-J.Ch. Meyer and E.P. de Vink, \u201cApplications of Compactness in the Smyth Powerdomain of Streams,\u201d Technical Report IR-110, Free University, Amsterdam (1986)."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus for Communicating Processes, Springer, LNCS 92 (1980).","DOI":"10.1007\/3-540-10235-3"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"M.A. Nait Abdallah, \u201cOn the Interpretation of Infinite Computations in Logic Programming,\u201d Proceedings of the 11th International Colloqium on Automata Languages and Programming, Antwerp, pp. 358\u2013370, Springer, LNCS 172 (1984).","DOI":"10.1007\/3-540-13345-3_32"},{"key":"17_CR24","first-page":"1","volume-title":"Foundations of Computer Science III","author":"M. Nivat","year":"1979","unstructured":"M. Nivat, \u201cInfinite Words, Infinite Trees, Infinite Computations,\u201d pp. 1\u201352 in Foundations of Computer Science III, ed. J.W. de Bakker & J. van Leeuwen, Mathematical Centre, Amsterdam (1979)."},{"key":"17_CR25","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.-R. Olderog","year":"1986","unstructured":"E.-R. Olderog and C.A.R. Hoare, \u201cSpecificaton-Oriented Semantics for Communicating Processes,\u201d Acta Informatica 23, pp. 9\u201366 (1986).","journal-title":"Acta Informatica"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G.D. Plotkin","year":"1976","unstructured":"G.D. Plotkin, \u201cA Power Domain Construction,\u201d SIAM Journal on Computing 5, pp. 452\u2013487 (1976).","journal-title":"SIAM Journal on Computing"},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M.B. Smyth","year":"1978","unstructured":"M.B. Smyth, \u201cPower Domains,\u201d Journal of Computer and System Sciences 16, pp. 23\u201336 (1978).","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"M.B. Smyth, \u201cPower Domains and Predicate Transformers: A Topological View,\u201d Proceeding of the 10th ICALP, pp. 662\u2013675, Springer, LNCS 154 (1983).","DOI":"10.1007\/BFb0036946"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"D.A. Turner, \u201cRecursion Equations as a Programming Language,\u201d pp. 1\u201328 in Functional Programming and Its Applications, ed. J. Darlington, P. Henderson & D.A. Turner, Cambridge University Press (1982).","DOI":"10.1007\/978-3-319-30936-1_24"},{"key":"17_CR30","unstructured":"E.P. de Vink, \u201cStream Semantics for Infinite Logic Programming,\u201d Technical Report, Free University, Amsterdam. In preparation."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17660-8_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:14Z","timestamp":1605643994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17660-8_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540176602","9783540477464"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-17660-8_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}