{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:16:34Z","timestamp":1761920194468},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,9,17]],"date-time":"2016-09-17T00:00:00Z","timestamp":1474070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1016\/j.entcs.2016.09.036","type":"journal-article","created":{"date-parts":[[2016,10,7]],"date-time":"2016-10-07T16:34:10Z","timestamp":1475858050000},"page":"147-168","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Complete Elgot Monads and Coalgebraic Resumptions"],"prefix":"10.1016","volume":"325","author":[{"given":"Sergey","family":"Goncharov","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Rauch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2016.09.036_boref0010","unstructured":"Haskell 98 Language and Libraries \u2013 The Revised Report, Cambridge University Press, 2003."},{"key":"10.1016\/j.entcs.2016.09.036_bib31s2","volume":"13","year":"2003","journal-title":"J. Funct. Prog."},{"key":"10.1016\/j.entcs.2016.09.036_br0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","article-title":"Infinite trees and completely iterative theories: a coalgebraic view","volume":"300","author":"Aczel","year":"2003","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2016.09.036_br0030","first-page":"61","article-title":"Iterative algebras: How iterative are they?","volume":"19","author":"Ad\u00e1mek","year":"2008","journal-title":"Theory Appl. Cat."},{"key":"10.1016\/j.entcs.2016.09.036_br0040","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.entcs.2004.06.056","article-title":"Iterative algebras for a base","volume":"122","author":"Ad\u00e1mek","year":"2005","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.entcs.2016.09.036_br0050","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-2(5:4)2006","article-title":"Elgot algebras","volume":"2","author":"Ad\u00e1mek","year":"2006","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.entcs.2016.09.036_br0060","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1016\/j.ic.2008.05.002","article-title":"Bases for parametrized iterativity","volume":"206","author":"Ad\u00e1mek","year":"2008","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.entcs.2016.09.036_br0070","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1016\/j.ic.2009.10.006","article-title":"Equational properties of iterative monads","volume":"208","author":"Ad\u00e1mek","year":"2010","journal-title":"Information and Computation"},{"key":"10.1016\/j.entcs.2016.09.036_br0080","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S0960129510000496","article-title":"Elgot theories: a new perspective of the equational properties of iteration","volume":"21","author":"Ad\u00e1mek","year":"2011","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/j.entcs.2016.09.036_br0090","first-page":"273","article-title":"Traced premonoidal categories","volume":"37","author":"Benton","year":"2003","journal-title":"ITA"},{"key":"10.1016\/j.entcs.2016.09.036_br0100","series-title":"Iteration theories: the equational logic of iterative processes","author":"Bloom","year":"1993"},{"key":"10.1016\/j.entcs.2016.09.036_br0110","doi-asserted-by":"crossref","DOI":"10.2168\/LMCS-1(2:1)2005","article-title":"General recursion via coinductive types","volume":"1","author":"Capretta","year":"2005","journal-title":"Logical Methods in Computer Science"},{"key":"10.1016\/j.entcs.2016.09.036_br0120","series-title":"Logic Colloquium '73Proceedings of the Logic Colloquium","first-page":"175","article-title":"Monadic computation and iterative algebraic theories*","volume":"vol. 80","author":"Elgot","year":"1975"},{"key":"10.1016\/j.entcs.2016.09.036_br0130","author":"\u00c9sik"},{"key":"10.1016\/j.entcs.2016.09.036_br0140","series-title":"Proc. Mathematical Foundations of Programming Semantics XXXI, MFPS 2015","article-title":"Unguarded recursion on coinductive resumptions","author":"Goncharov","year":"2015"},{"key":"10.1016\/j.entcs.2016.09.036_br0150","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.ic.2013.08.012","article-title":"A coinductive calculus for asynchronous side-effecting processes","volume":"231","author":"Goncharov","year":"2013","journal-title":"Information and Computation"},{"key":"10.1016\/j.entcs.2016.09.036_br0160","series-title":"Proc. 3rd International Conference on Typed Lambda Calculi and Applications","first-page":"196","article-title":"Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi","volume":"vol. 1210","author":"Hasegawa","year":"1997"},{"key":"10.1016\/j.entcs.2016.09.036_br0170","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.tcs.2006.03.013","article-title":"Combining effects: Sum and tensor","volume":"357","author":"Hyland","year":"2006","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.entcs.2016.09.036_br0180","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S0305004100074338","article-title":"Traced monoidal categories","volume":"119","author":"Joyal","year":"1996","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"10.1016\/j.entcs.2016.09.036_br0190","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0004972700006353","article-title":"A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on","volume":"22","author":"Kelly","year":"1980","journal-title":"Bulletin of the Australian Mathematical Society"},{"key":"10.1016\/j.entcs.2016.09.036_br0200","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1073\/pnas.50.5.869","article-title":"Functorial semantics of algebraic theories","volume":"50","author":"Lawvere","year":"1963","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.entcs.2016.09.036_br0210","series-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1971"},{"key":"10.1016\/j.entcs.2016.09.036_br0220","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Inf. Comput."},{"key":"10.1016\/j.entcs.2016.09.036_br0230","series-title":"FoSSaCS'01","first-page":"1","article-title":"Adequacy for algebraic effects","volume":"vol. 2030","author":"Plotkin","year":"2001"},{"key":"10.1016\/j.entcs.2016.09.036_br0240","series-title":"FoSSaCS'02","first-page":"342","article-title":"Notions of computation determine monads","volume":"vol. 2303","author":"Plotkin","year":"2002"},{"key":"10.1016\/j.entcs.2016.09.036_br0250","unstructured":"J. Rutten, Universal coalgebra: a theory of systems, Technical report, Amsterdam, The Netherlands, The Netherlands, 1996."},{"key":"10.1016\/j.entcs.2016.09.036_br0260","series-title":"Initial algebra and final coalgebra semantics for concurrency","first-page":"530","author":"Rutten","year":"1994"},{"key":"10.1016\/j.entcs.2016.09.036_br0270","series-title":"Proceedings of 15th Annual Symposium on Logic in Computer Science","first-page":"30","article-title":"Complete axioms for categorical fixed-point operators","author":"Simpson","year":"2000"},{"key":"10.1016\/j.entcs.2016.09.036_br0280","first-page":"315","article-title":"Generalizing substitution","volume":"37","author":"Uustalu","year":"2003","journal-title":"ITA"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571066116300858?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571066116300858?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T17:24:57Z","timestamp":1536341097000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066116300858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":29,"alternative-id":["S1571066116300858"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.entcs.2016.09.036","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}