{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:55Z","timestamp":1763468035981,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229527"},{"type":"electronic","value":"9783642229534"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22953-4_24","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:28:08Z","timestamp":1313569688000},"page":"276-287","source":"Crossref","is-referenced-by-count":5,"title":["A Coinductive Calculus for Asynchronous Side-Effecting Processes"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Goncharov","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0960129502003900","volume":"13","author":"F. Bartels","year":"2003","unstructured":"Bartels, F.: Generalised coinduction. Math.\u00a0Structures in Comp.\u00a0Sci.\u00a013(2), 321\u2013348 (2003)","journal-title":"Math.\u00a0Structures in Comp.\u00a0Sci."},{"issue":"4","key":"24_CR2","first-page":"273","volume":"37","author":"N. Benton","year":"2003","unstructured":"Benton, N., Hyland, M.: Traced premonoidal categories. ITA\u00a037(4), 273\u2013299 (2003)","journal-title":"ITA"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-13345-3_7","volume-title":"Automata, Languages, and Programming","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: The algebra of recursively defined processes and the algebra of regular processes. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 82\u201394. Springer, Heidelberg (1984)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Capretta, V.: General recursion via coinductive types. Logical Methods in Computer Science\u00a01(2) (2005)","DOI":"10.2168\/LMCS-1(2:1)2005"},{"key":"24_CR5","unstructured":"Cenciarelli, P., Moggi, E.: A syntactic approach to modularity in denotational semantics. Technical report, Category Theory and Computer Science (1993)"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0960129500000232","volume":"3","author":"J.R.B. Cockett","year":"1993","unstructured":"Cockett, J.R.B.: Introduction to distributive categories. Mathematical Structures in Computer Science\u00a03(3), 277\u2013307 (1993)","journal-title":"Mathematical Structures in Computer Science"},{"key":"24_CR7","first-page":"489","volume-title":"Logic in Computer Science, LICS 1990","author":"R.L. Crole","year":"1990","unstructured":"Crole, R.L., Pitts, A.M.: New foundations for fixpoint computations. In: Logic in Computer Science, LICS 1990, pp. 489\u2013497. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"24_CR8","volume-title":"Concurrency Verification: Introduction to Compositional and Noncompositional Methods","author":"W.P. Roever de","year":"2001","unstructured":"de Roever, W.P., de Boer, F.S., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge University Press, Cambridge (2001)"},{"key":"24_CR9","first-page":"174","volume-title":"ICFP 2000","author":"L. Erk\u00f6k","year":"2000","unstructured":"Erk\u00f6k, L., Launchbury, J.: Recursive monadic bindings. In: ICFP 2000, pp. 174\u2013185. ACM, New York (2000)"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2006.12.027","volume":"375","author":"A. Filinski","year":"2007","unstructured":"Filinski, A.: On the relations between monadic semantics. Theor. Comp. Sci.\u00a0375, 41\u201375 (2007)","journal-title":"Theor. Comp. Sci."},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1006\/inco.2002.2968","volume":"179","author":"M.P. Fiore","year":"2002","unstructured":"Fiore, M.P., Moggi, E., Sangiorgi, D.: A fully abstract model for the \u03c0-calculus. Inf. Comput.\u00a0179(1), 76\u2013117 (2002)","journal-title":"Inf. Comput."},{"key":"24_CR12","unstructured":"Goncharov, S.: Kleene monads. PhD thesis, Universit\u00e4t Bremen (2010)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11784180_14","volume-title":"Algebraic Methodology and Software Technology","author":"W.L. Harrison","year":"2006","unstructured":"Harrison, W.L.: The essence of multitasking. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 158\u2013172. Springer, Heidelberg (2006)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"599","DOI":"10.3233\/JCS-2009-0356","volume":"17","author":"W.L. Harrison","year":"2009","unstructured":"Harrison, W.L., Hook, J.: Achieving information flow security through monadic control of effects. J. Computer Security\u00a017, 599\u2013653 (2009)","journal-title":"J. Computer Security"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-09526-8_8","volume-title":"Mathematical Foundations of Computer Science 1979","author":"M. Hennessy","year":"1979","unstructured":"Hennessy, M., Plotkin, G.D.: Full abstraction for a simple parallel programming language. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol.\u00a074, pp. 108\u2013120. Springer, Heidelberg (1979)"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.entcs.2010.07.017","volume":"264","author":"B. Jacobs","year":"2010","unstructured":"Jacobs, B.: From coalgebraic to monoidal traces. Electron. Notes Theor. Comput. Sci.\u00a0264(2), 125\u2013140 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(02)00366-3","volume":"291","author":"B. Jacobs","year":"2003","unstructured":"Jacobs, B., Poll, E.: Coalgebras and Monads in the Semantics of Java. Theoret. Comput. Sci.\u00a0291, 329\u2013349 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-45315-6_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Krsti\u0107","year":"2001","unstructured":"Krsti\u0107, S., Launchbury, J., Pavlovi, D.P.: Categories of processes enriched in final coalgebras. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 303\u2013317. Springer, Heidelberg (2001)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-03741-2_4","volume-title":"Algebra and Coalgebra in Computer Science","author":"S. Milius","year":"2009","unstructured":"Milius, S., Palm, T., Schwencke, D.: Complete iterativity for algebras with effects. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 34\u201348. Springer, Heidelberg (2009)"},{"key":"24_CR20","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Inc, Englewood Cliffs (1989)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput.\u00a093, 55\u201392 (1991)","journal-title":"Inf. Comput."},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/BFb0036936","volume-title":"Automata, Languages and Programming","author":"R.D. Nicola","year":"1983","unstructured":"Nicola, R.D., Hennessy, M.: Testing equivalence for processes. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 548\u2013560. Springer, Heidelberg (1983)"},{"issue":"3","key":"24_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S095679680000366X","volume":"10","author":"N. Papaspyrou","year":"2000","unstructured":"Papaspyrou, N., Macos, D.: A study of evaluation order semantics in expressions with side effects. J. Funct. Program.\u00a010(3), 227\u2013244 (2000)","journal-title":"J. Funct. Program."},{"key":"24_CR24","unstructured":"Peyton Jones, S. (ed.): Haskell 98 Language and Libraries \u2014 The Revised Report. Cambridge (2003); also: J. Funct. Programming\u00a0 13, 2003."},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Plotkin, G., Power, J.: Semantics for algebraic operations. In: Mathematical Foundations of Programming Semantics, MFPS 2001. ENTCS, vol.\u00a045 (2001)","DOI":"10.1016\/S1571-0661(04)80970-8"},{"key":"24_CR26","unstructured":"Rosenthal, K.I.: Quantales and their applications. Pitman Research Notes in Mathematics Series, vol.\u00a0234. Longman Scientific & Technical (1990)"},{"key":"24_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: A theory of systems. Theoret. Comput. Sci.\u00a0249, 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR28","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1093\/logcom\/14.4.571","volume":"14","author":"L. Schr\u00f6der","year":"2004","unstructured":"Schr\u00f6der, L., Mossakowski, T.: Monad-independent dynamic logic in HasCASL. J. Logic Comput.\u00a014, 571\u2013619 (2004)","journal-title":"J. Logic Comput."},{"issue":"12-13","key":"24_CR29","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.tcs.2008.11.020","volume":"410","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Mossakowski, T.: HasCASL: Integrated higher-order specification and program development. Theor. Comput. Sci.\u00a0410(12-13), 1217\u20131260 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"Syme, D., Granicz, A., Cisternino, A.: Expert F#. Apress (2007)","DOI":"10.1007\/978-1-4302-0285-1"},{"key":"24_CR31","doi-asserted-by":"crossref","unstructured":"Tolmach, A.P., Antoy, S.: A monadic semantics for core Curry. In: WFLP 2003. ENTCS, vol.\u00a086(3), pp. 16\u201334 (2003)","DOI":"10.1016\/S1571-0661(04)80691-1"},{"issue":"4","key":"24_CR32","first-page":"315","volume":"37","author":"T. Uustalu","year":"2003","unstructured":"Uustalu, T.: Generalizing substitution. ITA\u00a037(4), 315\u2013336 (2003)","journal-title":"ITA"},{"key":"24_CR33","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1145\/262009.262011","volume":"29","author":"P. Wadler","year":"1997","unstructured":"Wadler, P.: How to declare an imperative. ACM Computing Surveys\u00a029, 240\u2013263 (1997)","journal-title":"ACM Computing Surveys"},{"key":"24_CR34","doi-asserted-by":"crossref","unstructured":"Worrell, J.: Terminal sequences for accessible endofunctors. In: Coalgebraic Methods in Computer Science, CMCS 1999. ENTCS, vol.\u00a019 (1999)","DOI":"10.1016\/S1571-0661(05)80267-1"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22953-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:10:44Z","timestamp":1558296644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22953-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229527","9783642229534"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22953-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}