{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:45:56Z","timestamp":1740105956568,"version":"3.37.3"},"reference-count":59,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1016\/j.ic.2019.104456","type":"journal-article","created":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T15:34:14Z","timestamp":1566920054000},"page":"104456","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["A new foundation for finitary corecursion and iterative algebras"],"prefix":"10.1016","volume":"271","author":[{"given":"Stefan","family":"Milius","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]},{"given":"Thorsten","family":"Wi\u00dfmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2019.104456_br0010","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":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.ic.2019.104456_br0020","first-page":"589","article-title":"Free algebras and automata realizations in the language of categories","volume":"015","author":"Ad\u00e1mek","year":"1974","journal-title":"Comment. Math. Univ. Carol."},{"year":"2009","series-title":"Abstract and Concrete Categories: the Joy of Cats","author":"Ad\u00e1mek","key":"10.1016\/j.ic.2019.104456_br0030"},{"key":"10.1016\/j.ic.2019.104456_br0590","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.jlamp.2017.11.003","article-title":"Fixed points of functors","volume":"95","author":"Ad\u00e1mek","year":"2018","journal-title":"J. Log. Algebr. Methods Program."},{"author":"Ad\u00e1mek","key":"10.1016\/j.ic.2019.104456_br0600"},{"author":"Ad\u00e1mek","key":"10.1016\/j.ic.2019.104456_br0050"},{"issue":"6","key":"10.1016\/j.ic.2019.104456_br0060","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1017\/S0960129506005706","article-title":"Iterative algebras at work","volume":"16","author":"Ad\u00e1mek","year":"2006","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_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":"Inf. Comput."},{"issue":"2","key":"10.1016\/j.ic.2019.104456_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. Struct. Comput. Sci."},{"issue":"38","key":"10.1016\/j.ic.2019.104456_br0090","doi-asserted-by":"crossref","first-page":"4969","DOI":"10.1016\/j.tcs.2011.04.027","article-title":"On second-order iterative monads","volume":"412","author":"Ad\u00e1mek","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ic.2019.104456_br0100","article-title":"Semantics of higher-order recursion schemes","volume":"7","author":"Ad\u00e1mek","year":"2011","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0110","first-page":"15","article-title":"Semantics of higher-order recursion schemes","volume":"1","author":"Ad\u00e1mek","year":"2011","journal-title":"Log. Methods Comput. Sci."},{"year":"1994","series-title":"Locally Presentable and Accessible Categories","author":"Ad\u00e1mek","key":"10.1016\/j.ic.2019.104456_br0120"},{"article-title":"Category Theory","year":"2010","author":"Awodey","key":"10.1016\/j.ic.2019.104456_br0130"},{"key":"10.1016\/j.ic.2019.104456_br0140","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01111838","article-title":"Coequalizers and free triples","volume":"116","author":"Barr","year":"1970","journal-title":"Math. Z."},{"year":"2004","series-title":"On Generalized Coinduction and Probabilistic Specification Formats: Distributive Laws in Coalgebraic Modelling","author":"Bartels","key":"10.1016\/j.ic.2019.104456_br0150"},{"article-title":"Iteration Theories: The Equational Logic of Iterative Processes","year":"1993","author":"Bloom","key":"10.1016\/j.ic.2019.104456_br0160"},{"key":"10.1016\/j.ic.2019.104456_br0170","series-title":"Proc. Combined Workshop on Expressiveness in Concurrency and Structural Operational Semantics","first-page":"3","article-title":"On the specification of operations on the rational behaviour of systems","volume":"vol. 89","author":"Bonsangue","year":"2012"},{"key":"10.1016\/j.ic.2019.104456_br0180","first-page":"7","article-title":"Sound and complete axiomatizations of coalgebraic language equivalence","volume":"1","author":"Bonsangue","year":"2013","journal-title":"ACM Trans. Comput. Log."},{"article-title":"Handbook of Categorical Algebra: Volume 1, Basic Category Theory","year":"1994","author":"Borceux","key":"10.1016\/j.ic.2019.104456_br0190"},{"key":"10.1016\/j.ic.2019.104456_br0200","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0022-4049(93)90035-R","article-title":"Introduction to extensive and distributive categories","volume":"84","author":"Carboni","year":"1993","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.ic.2019.104456_br0210","series-title":"Proc. 5th CTCS","article-title":"A syntactic approach to modularity in denotational semantic","author":"Cenciarelli","year":"1993"},{"key":"10.1016\/j.ic.2019.104456_br0220","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of infinite trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theor. Comput. Sci."},{"year":"2009","series-title":"Handbook of Weighted Automata","author":"Droste","key":"10.1016\/j.ic.2019.104456_br0230"},{"key":"10.1016\/j.ic.2019.104456_br0240","series-title":"Logic Colloquium '73, vol. 80","first-page":"175","article-title":"Monadic computation and iterative algebraic theories","author":"Elgot","year":"1975"},{"key":"10.1016\/j.ic.2019.104456_br0250","doi-asserted-by":"crossref","first-page":"181","DOI":"10.24033\/bsmf.1777","article-title":"Sur divers produits de s\u00e9ries formelles","volume":"102","author":"Fliess","year":"1974","journal-title":"Bull. Soc. Math. Fr."},{"key":"10.1016\/j.ic.2019.104456_br0260","article-title":"Lokal pr\u00e4sentierbare Kategorien","volume":"vol. 221","author":"Gabriel","year":"1971"},{"key":"10.1016\/j.ic.2019.104456_br0270","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S0960129505004743","article-title":"Monads of coalgebras: rational terms and term graphs","volume":"15","author":"Ghani","year":"2005","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0280","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0022-0000(79)90032-1","article-title":"Regular trees and the free iterative theory","volume":"18","author":"Ginali","year":"1979","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0290","series-title":"Algebra and Coalgebra in Computer Science (CALCO 2013)","first-page":"158","article-title":"Trace semantics via generic observations","volume":"vol. 8089","author":"Goncharov","year":"2013"},{"key":"10.1016\/j.ic.2019.104456_br0300","series-title":"Proc. 8th IFIP TC 1\/WG 2.2 International Conference on Theoretical Computer Science","first-page":"265","article-title":"Towards a coalgebraic Chomsky hierarchy","volume":"vol. 8705","author":"Goncharov","year":"2014"},{"issue":"4","key":"10.1016\/j.ic.2019.104456_br0310","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/0201024","article-title":"Real-time strict deterministic languages","volume":"1","author":"Harrison","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"10.1016\/j.ic.2019.104456_br0320","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":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0330","series-title":"Goguen Festschrift","first-page":"375","article-title":"A bialgebraic review of regular expressions, deterministic automata and languages","volume":"vol. 4060","author":"Jacobs","year":"2006"},{"key":"10.1016\/j.ic.2019.104456_br0340","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":"Bull. Aust. Math. Soc."},{"issue":"38","key":"10.1016\/j.ic.2019.104456_br0350","doi-asserted-by":"crossref","first-page":"5043","DOI":"10.1016\/j.tcs.2011.03.023","article-title":"Bialgebras for structural operational semantics: an introduction","volume":"412","author":"Klin","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0360","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01110627","article-title":"A fixpoint theorem for complete categories","volume":"103","author":"Lambek","year":"1968","journal-title":"Math. Z."},{"article-title":"Categories for the Working Mathematician","year":"1998","author":"MacLane","key":"10.1016\/j.ic.2019.104456_br0370"},{"key":"10.1016\/j.ic.2019.104456_br0380","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","article-title":"Completely iterative algebras and completely iterative monads","volume":"196","author":"Milius","year":"2005","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ic.2019.104456_br0390","series-title":"Proc. 25th Annual Symposium on Logic in Computer Science","first-page":"449","article-title":"A sound and complete calculus for finite stream circuits","author":"Milius","year":"2010"},{"key":"10.1016\/j.ic.2019.104456_br0400","series-title":"Proc. 7th Conference on Algebra and Coalgebra in Computer Science","article-title":"Proper functors and their rational fixed point","volume":"vol. 72","author":"Milius","year":"2017"},{"key":"10.1016\/j.ic.2019.104456_br0410","first-page":"22","article-title":"Proper functors and fixed points for finite behaviour","volume":"3","author":"Milius","year":"2018","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0420","series-title":"Proc. 29th conference on Mathematical Foundations of Programming Science","first-page":"257","article-title":"Rational operation models","volume":"vol. 298","author":"Milius","year":"2013"},{"key":"10.1016\/j.ic.2019.104456_br0430","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2006.07.002","article-title":"The category theoretic solution of recursive program schemes","volume":"366","author":"Milius","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0440","series-title":"Proc. 19th International Conference on Foundations of Software Science and Computation Structures","first-page":"107","article-title":"A new foundation for finitary corecursion: The locally finite fixpoint and its properties","volume":"vol. 19","author":"Milius","year":"2016"},{"key":"10.1016\/j.ic.2019.104456_br0450","series-title":"Proc. Coalgebraic and Algebraic Methods in Computer Science","first-page":"336","article-title":"Finitary corecursion for the infinitary lambda calculus","volume":"vol. 35","author":"Milius","year":"2015"},{"year":"2011","series-title":"Rational Coalgebraic Machines in Varieties: Languages, Completeness and Automatic Proofs","author":"Myers","key":"10.1016\/j.ic.2019.104456_br0460"},{"key":"10.1016\/j.ic.2019.104456_br0470","series-title":"Handbook of Weighted Automata","first-page":"257","article-title":"Algebraic systems and pushdown automata","author":"Petre","year":"2009"},{"key":"10.1016\/j.ic.2019.104456_br0480","series-title":"Proc. 12th LICS Conf.","first-page":"280","article-title":"Towards a mathematical operational semantics","author":"Plotkin","year":"1997"},{"key":"10.1016\/j.ic.2019.104456_br0490","series-title":"Proc. SOFSEM 2013","first-page":"369","article-title":"Coalgebraic bisimulation-up-to","volume":"vol. 7741","author":"Rot","year":"2013"},{"key":"10.1016\/j.ic.2019.104456_br0500","series-title":"Proc. CONCUR 1998","first-page":"194","article-title":"Automata and coinduction (an exercise in coalgebra)","volume":"vol. 1466","author":"Rutten","year":"1998"},{"issue":"1","key":"10.1016\/j.ic.2019.104456_br0510","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","article-title":"Universal coalgebra: a theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.ic.2019.104456_br0520","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1016\/j.ic.2010.09.007","article-title":"Quantitative Kleene coalgebras","volume":"209","author":"Silva","year":"2011","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ic.2019.104456_br0530","first-page":"9","article-title":"Generalizing determinization from automata to coalgebras","volume":"1","author":"Silva","year":"2013","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0540","first-page":"23","article-title":"Non-deterministic Kleene coalgebras","volume":"3","author":"Silva","year":"2010","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.ic.2019.104456_br0550","series-title":"Proc. CALCO'17","article-title":"Finite behaviours and finitary corecursion","volume":"vol. 72","author":"Urbat","year":"2017"},{"issue":"3","key":"10.1016\/j.ic.2019.104456_br0560","article-title":"Coalgebraic characterizations of context-free languages","volume":"9","author":"Winter","year":"2013","journal-title":"Log. Methods Comput. Sci."},{"issue":"5","key":"10.1016\/j.ic.2019.104456_br0570","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.jcss.2014.12.004","article-title":"Context-free coalgebras","volume":"81","author":"Winter","year":"2015","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.ic.2019.104456_br0580","article-title":"Coalgebraic characterizations of context-free languages","volume":"9","author":"Winter","year":"2013","journal-title":"Log. Methods Comput. Sci."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540119300720?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540119300720?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T02:18:10Z","timestamp":1712456290000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540119300720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":59,"alternative-id":["S0890540119300720"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2019.104456","relation":{},"ISSN":["0890-5401"],"issn-type":[{"type":"print","value":"0890-5401"}],"subject":[],"published":{"date-parts":[[2020,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new foundation for finitary corecursion and iterative algebras","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2019.104456","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"104456"}}