{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:12:41Z","timestamp":1725995561714},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037405"},{"type":"electronic","value":"9783642037412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03741-2_3","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:20:01Z","timestamp":1252923601000},"page":"18-33","source":"Crossref","is-referenced-by-count":6,"title":["Kleene Monads: Handling Iteration in a Framework of Generic Effects"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Goncharov","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"given":"Till","family":"Mossakowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1017\/S0956796898002998","volume":"8","author":"P.N. Benton","year":"1998","unstructured":"Benton, P.N., Bierman, G.M., de Paiva, V.: Computational types from a logical perspective. J. Funct. Prog.\u00a08(2), 177\u2013193 (1998)","journal-title":"J. Funct. Prog."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0956796800001696","volume":"6","author":"P.-L. Curien","year":"1996","unstructured":"Curien, P.-L., di Cosmo, R.: A confluent reduction for the lambda-calculus with surjective pairing and terminal object. J. Funct. Program.\u00a06(2), 299\u2013327 (1996)","journal-title":"J. Funct. Program."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/11693024_2","volume-title":"Programming Languages and Systems","author":"M. Fluet","year":"2006","unstructured":"Fluet, M., Morrisett, G., Ahmed, A.J.: Linear regions are all you need. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol.\u00a03924, pp. 7\u201321. Springer, Heidelberg (2006)"},{"issue":"9","key":"3_CR4","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1145\/357766.351258","volume":"35","author":"R. Hinze","year":"2000","unstructured":"Hinze, R.: Deriving backtracking monad transformers. ACM SIGPLAN Notices\u00a035(9), 186\u2013197 (2000)","journal-title":"ACM SIGPLAN Notices"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2006.03.013","volume":"357","author":"M. Hyland","year":"2006","unstructured":"Hyland, M., Plotkin, G.D., Power, J.: Combining effects: Sum and tensor. Theoret. Comput. Sci.\u00a0357, 70\u201399 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR6","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":"3_CR7","series-title":"Lecture Notes in Computer Science","first-page":"175","volume-title":"7th International Conference on Automated Deduction","author":"J.-P. Jouannaud","year":"1984","unstructured":"Jouannaud, J.-P., Munoz, M.: Termination of a set of rules modulo a set of equations. In: Shostak, R.E. (ed.) CADE 1984. LNCS, vol.\u00a0170, pp. 175\u2013193. Springer, Heidelberg (1984)"},{"key":"3_CR8","first-page":"192","volume-title":"Functional Programming, ICFP 2005","author":"O. Kiselyov","year":"2005","unstructured":"Kiselyov, O., Shan, C., Friedman, D., Sabry, A.: Backtracking, interleaving, and terminating monad transformers. In: Functional Programming, ICFP 2005, pp. 192\u2013203. ACM Press, New York (2005)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput.\u00a0110, 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-61042-1_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Kozen","year":"1996","unstructured":"Kozen, D.: Kleene algebra with tests and commutativity conditions. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 14\u201333. Springer, Heidelberg (1996)"},{"key":"3_CR11","first-page":"105","volume-title":"Logic in Computer Science, LICS 2008","author":"D. Kozen","year":"2008","unstructured":"Kozen, D.: Nonlocal flow of control and Kleene algebra with tests. In: Logic in Computer Science, LICS 2008, pp. 105\u2013117. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"3_CR12","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":"3_CR13","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1017\/S0956796801004154","volume":"11","author":"E. Moggi","year":"2001","unstructured":"Moggi, E., Sabry, A.: Monadic encapsulation of effects: A revised approach (extended version). J. Funct. Prog.\u00a011, 591\u2013627 (2001)","journal-title":"J. Funct. Prog."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-78743-3_15","volume-title":"Fundamental Approaches to Software Engineering","author":"T. Mossakowski","year":"2008","unstructured":"Mossakowski, T., Schr\u00f6der, L., Goncharov, S.: A generic complete dynamic logic for reasoning about purity and effects (Extended version to appear in Formal Aspects of Computing). In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol.\u00a04961, pp. 199\u2013214. Springer, Heidelberg (2008)"},{"volume-title":"Haskell 98 Language and Libraries \u2014 The Revised Report","year":"2003","key":"3_CR15","unstructured":"Peyton Jones, S. (ed.): Haskell 98 Language and Libraries \u2014 The Revised Report. Cambridge University Press (2003); J. Funct. Prog. 13 (2003)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-27815-3_34","volume-title":"Algebraic Methodology and Software Technology","author":"L. Schr\u00f6der","year":"2004","unstructured":"Schr\u00f6der, L., Mossakowski, T.: Generic exception handling and the Java monad. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol.\u00a03116, pp. 443\u2013459. Springer, Heidelberg (2004)"},{"key":"3_CR17","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."},{"key":"3_CR18","first-page":"1","volume-title":"Symposium on Theory of Computing, STOC 1973","author":"L.J. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: Preliminary report. In: Symposium on Theory of Computing, STOC 1973, pp. 1\u20139. ACM Press, New York (1973)"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03741-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:24:01Z","timestamp":1552141441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03741-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037405","9783642037412"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03741-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}