{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:12Z","timestamp":1759638192287,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544570"},{"type":"electronic","value":"9783662544587"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54458-7_30","type":"book-chapter","created":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T09:22:57Z","timestamp":1489569777000},"page":"517-533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Unifying Guarded and Unguarded Iteration"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Goncharov","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Rauch","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Pir\u00f3g","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"issue":"1\u20133","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","volume":"300","author":"P Aczel","year":"2003","unstructured":"Aczel, P., Ad\u00e1mek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: a coalgebraic view. Theoret. Comput. Sci. 300(1\u20133), 1\u201345 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1016\/j.ic.2009.10.006","volume":"208","author":"J Ad\u00e1mek","year":"2010","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Equational properties of iterative monads. Inf. Comput. 208, 1306\u20131348 (2010)","journal-title":"Inf. Comput."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S0960129510000496","volume":"21","author":"J Ad\u00e1mek","year":"2011","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Elgot theories: a new perspective of the equational properties of iteration. Math. Struct. Comput. Sci. 21, 417\u2013480 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"key":"30_CR4","unstructured":"Altenkirch, T., Danielsson, N.: Partiality, revisited. In: Types for Proofs and Programs, TYPES 2016 (2016)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1017\/S095679680900728X","volume":"19","author":"R Atkey","year":"2009","unstructured":"Atkey, R.: Parameterised notions of computation. J. Funct. Prog. 19, 335 (2009)","journal-title":"J. Funct. Prog."},{"volume-title":"Handbook of Process Algebra","year":"2001","key":"30_CR6","unstructured":"Bergstra, J., Ponse, A., Smolka, S. (eds.): Handbook of Process Algebra. Elsevier, Amsterdam (2001)"},{"key":"30_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories: The Equational Logic of Iterative Processes","author":"S Bloom","year":"1993","unstructured":"Bloom, S., \u00c9sik, Z.: Iteration Theories: The Equational Logic of Iterative Processes. Springer, Heidelberg (1993)"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-1(2:1)2005","volume":"1","author":"V Capretta","year":"2005","unstructured":"Capretta, V.: General recursion via coinductive types. Log. Meth. Comput. Sci. 1(2), 1\u201328 (2005)","journal-title":"Log. Meth. Comput. Sci."},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-25150-9_8","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2015","author":"J Chapman","year":"2015","unstructured":"Chapman, J., Uustalu, T., Veltri, N.: Quotienting the delay monad by weak bisimilarity. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 110\u2013125. Springer, Cham (2015). doi:10.1007\/978-3-319-25150-9_8"},{"key":"30_CR10","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0049-237X(08)71949-9","volume-title":"Logic Colloquium 1973","author":"C Elgot","year":"1975","unstructured":"Elgot, C.: Monadic computation and iterative algebraic theories. In: Rose, H.E., Shepherdson, J.C. (eds.) Logic Colloquium 1973. Studies in Logic and the Foundations of Mathematics, vol. 80, pp. 175\u2013230. Elsevier, Amsterdam (1975)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"C Elgot","year":"1978","unstructured":"Elgot, C., Bloom, S., Tindell, R.: On the algebraic atructure of rooted trees. J. Comput. Syst. Sci. 16, 362\u2013399 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR12","unstructured":"Escard\u00f3, M.H.: A metric model of PCF. In: Realizability Semantics and Applications (1999)"},{"key":"30_CR13","unstructured":"\u00c9sik, Z., Goncharov, S.: Some remarks on Conway and iteration theories. CoRR, abs\/1603.00838 (2016)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Goncharov, S., Milius, S., Rauch, C.: Complete Elgot monads and coalgebraic resumptions. In: Mathematical Foundations of Programming Semantics, MFPS 2016. ENTCS (2016)","DOI":"10.1016\/j.entcs.2016.09.036"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Goncharov, S., Rauch, C., Schr\u00f6der, L.: Unguarded recursion on coinductive resumptions. In: Mathematical Foundations of Programming Semantics, MFPS 2015. ENTCS (2015)","DOI":"10.1016\/j.entcs.2015.12.012"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ic.2013.08.012","volume":"231","author":"S Goncharov","year":"2013","unstructured":"Goncharov, S., Schr\u00f6der, L.: A coinductive calculus for asynchronous side-effecting processes. Inf. Comput. 231, 204\u2013232 (2013)","journal-title":"Inf. Comput."},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"W Lawvere","year":"1963","unstructured":"Lawvere, W.: Functorial semantics of algebraic theories. Proc. Natl. Acad. Sci. USA 50, 869\u2013872 (1963)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"30_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S Mac Lane","year":"1971","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","volume":"196","author":"S Milius","year":"2005","unstructured":"Milius, S.: Completely iterative algebras and completely iterative monads. Inf. Comput. 196, 1\u201341 (2005)","journal-title":"Inf. Comput."},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"407","DOI":"10.3233\/FI-2017-1475","volume":"150","author":"S Milius","year":"2017","unstructured":"Milius, S., Litak, T.: Guard your daggers and traces: properties of guarded (co-)recursion. Fund. Inform. 150, 407\u2013449 (2017)","journal-title":"Fund. Inform."},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BFb0013462","volume-title":"Category Theory and Computer Science","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: A modular approach to denotational semantics. In: Pitt, D.H., Curien, P.-L., Abramsky, S., Pitts, A.M., Poign\u00e9, A., Rydeheard, D.E. (eds.) CTCS 1991. LNCS, vol. 530, pp. 138\u2013139. Springer, Heidelberg (1991). doi:10.1007\/BFb0013462"},{"key":"30_CR22","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. 93, 55\u201392 (1991)","journal-title":"Inf. Comput."},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Nakano, H.: A modality for recursion. In: Logic in Computer Science, LICS 2000, pp. 255\u2013266. IEEE Computer Society (2000)","DOI":"10.1109\/LICS.2000.855774"},{"issue":"1","key":"30_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-11(1:1)2015","volume":"11","author":"K Nakata","year":"2015","unstructured":"Nakata, K., Uustalu, T.: A Hoare logic for the coinductive trace-based big-step semantics of while. Log. Meth. Comput. Sci. 11(1), 1\u201332 (2015)","journal-title":"Log. Meth. Comput. Sci."},{"key":"30_CR25","unstructured":"Pir\u00f3g, M., Gibbons, J.: The coinductive resumption monad. In: Mathematical Foundations of Programming Semantics, MFPS 2014. ENTCS, vol. 308, pp. 273\u2013288 (2014)"},{"key":"30_CR26","unstructured":"Pir\u00f3g, M., Gibbons, J.: Monads for behaviour. In: Mathematical Foundations of Programming Semantics, MFPS 2013. ENTCS, vol. 298, pp. 309\u2013324 (2015)"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Simpson, A., Plotkin, G.: Complete axioms for categorical fixed-point operators. In: Logic in Computer Science, LICS 2000, pp. 30\u201341 (2000)","DOI":"10.1109\/LICS.2000.855753"},{"key":"30_CR28","first-page":"315","volume":"37","author":"T Uustalu","year":"2003","unstructured":"Uustalu, T.: Generalizing substitution. ITA 37, 315\u2013336 (2003)","journal-title":"ITA"},{"issue":"1","key":"30_CR29","first-page":"5","volume":"10","author":"T Uustalu","year":"1999","unstructured":"Uustalu, T., Vene, V.: Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica 10(1), 5\u201326 (1999). Lithuanian Academy of Sciences","journal-title":"Informatica"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54458-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T21:23:21Z","timestamp":1750109001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54458-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544570","9783662544587"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54458-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}