{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:26:28Z","timestamp":1743074788004,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030003883"},{"type":"electronic","value":"9783030003890"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00389-0_9","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T19:12:43Z","timestamp":1537384363000},"page":"144-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Algebras with Effectful Iteration"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Milius","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Ad\u00e1mek","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Urbat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"5:4","key":"9_CR1","first-page":"1","volume":"2","author":"J Ad\u00e1mek","year":"2006","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Elgot algebras. Log. Methods Comput. Sci. 2(5:4), 1\u201331 (2006)","journal-title":"Log. Methods Comput. Sci."},{"issue":"6","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1017\/S0960129506005706","volume":"16","author":"J Ad\u00e1mek","year":"2006","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Iterative algebras at work. Math. Struct. Comput. Sci. 16(6), 1085\u20131131 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"11:5","key":"9_CR3","first-page":"1","volume":"7","author":"J Ad\u00e1mek","year":"2011","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Semantics of higher-order recursion schemes. Log. Methods Comput. Sci. 7(11:5), 1\u201343 (2011)","journal-title":"Log. Methods Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579","volume-title":"Locally Presentable and Accessible Categories","author":"J Ad\u00e1mek","year":"1994","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: Locally Presentable and Accessible Categories. Cambridge University Press, Cambridge (1994)"},{"key":"9_CR5","first-page":"251","volume":"23","author":"J Ad\u00e1mek","year":"2010","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J., Vitale, E.: What are sifted colimits? Theory Appl. Categ. 23, 251\u2013260 (2010)","journal-title":"Theory Appl. Categ."},{"key":"9_CR6","volume-title":"Algebraic Theories","author":"J Ad\u00e1mek","year":"2011","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J., Vitale, E.: Algebraic Theories. Cambridge University Press, New York (2011)"},{"key":"9_CR7","unstructured":"Applegate, H.: Acyclic models and resolvent functors. Ph.D. thesis, Columbia University (1965)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01111838","volume":"116","author":"M Barr","year":"1970","unstructured":"Barr, M.: Coequalizers and free triples. Math. Z. 116, 307\u2013322 (1970)","journal-title":"Math. Z."},{"issue":"1:7","key":"9_CR9","first-page":"7:1","volume":"14","author":"MM Bonsangue","year":"2013","unstructured":"Bonsangue, M.M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans. Comput. Log. 14(1:7), 7:1\u20137:52 (2013)","journal-title":"ACM Trans. Comput. Log."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoret. Comput. Sci. 25, 95\u2013169 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR11","unstructured":"\u00c9sik, Z., Maletti, A.: Simulation vs. equivalence. In: Proceedings of 6th International Conference on Foundations of Computer Science, pp. 119\u2013122. CSREA Press (2010)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-18098-9_34","volume-title":"Implementation and Application of Automata","author":"Z \u00c9sik","year":"2011","unstructured":"\u00c9sik, Z., Maletti, A.: Simulations of weighted tree automata. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 321\u2013330. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18098-9_34"},{"key":"9_CR13","unstructured":"Fiore, M., Plotkin, G.D., Turi, D.: Abstract syntax and variable binding. In: Proceedings of LICS 1999, pp. 193\u2013202. IEEE Press (1999)"},{"issue":"4","key":"9_CR14","first-page":"1003","volume":"19","author":"P Freyd","year":"1968","unstructured":"Freyd, P.: R\u00e9dei\u2019s finiteness theorem for commutative semigroups. Proc. Amer. Math. Soc. 19(4), 1003 (1968)","journal-title":"Proc. Amer. Math. Soc."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1112\/blms\/7.3.294","volume":"7","author":"PT Johnstone","year":"1975","unstructured":"Johnstone, P.T.: Adjoint lifting theorems for categories of algebras. Bull. Lond. Math. Soc. 7, 294\u2013297 (1975)","journal-title":"Bull. Lond. Math. Soc."},{"key":"9_CR16","volume-title":"Topos Theory","author":"PT Johnstone","year":"1977","unstructured":"Johnstone, P.T.: Topos Theory. Academic Press, London (1977)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J Lambek","year":"1968","unstructured":"Lambek, J.: A fixpoint theorem for complete categories. Math. Z. 103, 151\u2013161 (1968)","journal-title":"Math. Z."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Milius, S., Ad\u00e1mek, J., Urbat, H.: On algebras with effectful iteration. https:\/\/www8.cs.fau.de\/staff\/milius\/publications\/files\/amv_ffg-elgot_2018.pdf","DOI":"10.1007\/978-3-030-00389-0_9"},{"key":"9_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. Inform. Comput. 196, 1\u201341 (2005)","journal-title":"Inform. Comput."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Milius, S.: A sound and complete calculus for finite stream circuits. In: Proceedings of LICS 2010, pp. 449\u2013458. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.11"},{"key":"9_CR21","unstructured":"Milius, S.: Proper functors and fixed points for finite behaviour (2018, submitted). arXiv:1705.09198"},{"key":"9_CR22","unstructured":"Milius, S.: Proper functors and their rational fixed point. In: Bonchi, F., K\u00f6nig, B. (eds.) Proceedings of 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), LIPIcs, vol. 72, pp. 18:1\u201318:15. Schloss Dagstuhl (2017)"},{"key":"9_CR23","unstructured":"Milius, S., Pattinson, D., Wi\u00dfmann, T.: A new foundation for finitary corecursion and iterative algebras (2018, submitted). arXiv:1802.08070"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-662-49630-5_7","volume-title":"Foundations of Software Science and Computation Structures","author":"S Milius","year":"2016","unstructured":"Milius, S., Pattinson, D., Wi\u00dfmann, T.: A new foundation for finitary corecursion. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 107\u2013125. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49630-5_7"},{"issue":"5","key":"9_CR25","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s10485-016-9457-8","volume":"24","author":"S Milius","year":"2016","unstructured":"Milius, S., Schr\u00f6der, L., Wi\u00dfmann, T.: Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets. Appl. Categ. Struct. 24(5), 663\u2013701 (2016)","journal-title":"Appl. Categ. Struct."},{"key":"9_CR26","unstructured":"Milius, S., Wi\u00dfmann, T.: Finitary corecursion for the infinitary lambda calculus. In: Proceedings of CALCO 2015, LIPIcs, vol. 35, pp. 336\u2013351 (2015)"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(83)90014-2","volume":"25","author":"E Nelson","year":"1983","unstructured":"Nelson, E.: Iterative algebras. Theoret. Comput. Sci. 25, 67\u201394 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR28","unstructured":"Plotkin, G.D., Turi, D.: Towards a mathematical operational semantics. In: Proceedings of Logic in Computer Science (LICS 1997), pp. 280\u2013291 (1997)"},{"key":"9_CR29","volume-title":"The Theory of Finitely Generated Commutative Semigroups","author":"L R\u00e9dei","year":"1965","unstructured":"R\u00e9dei, L.: The Theory of Finitely Generated Commutative Semigroups. Oxford, Pergamon, Edinburgh, New York (1965)"},{"issue":"1:9","key":"9_CR30","first-page":"1","volume":"9","author":"A Silva","year":"2013","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci 9(1:9), 1\u201327 (2013)","journal-title":"Log. Methods Comput. Sci"},{"issue":"8","key":"9_CR31","doi-asserted-by":"publisher","first-page":"3110","DOI":"10.1016\/j.jpaa.2014.10.005","volume":"219","author":"A Sokolova","year":"2015","unstructured":"Sokolova, A., Woracek, H.: Congruences of convex algebras. J. Pure Appl. Algebra 219(8), 3110\u20133148 (2015)","journal-title":"J. Pure Appl. Algebra"},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-89366-2_18","volume-title":"FoSSaCS 2018, LNCS","author":"A Sokolova","year":"2018","unstructured":"Sokolova, A., Woracek, H.: Proper semirings and proper convex functors. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018, LNCS, vol. 10803, pp. 331\u2013347. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_18"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0304-3975(80)90056-0","volume":"12","author":"J Tiuryn","year":"1980","unstructured":"Tiuryn, J.: Unique fixed points vs. least fixed points. Theoret. Comput. Sci. 12, 229\u2013254 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR34","unstructured":"Urbat, H.: Finite behaviours and finitary corecursion. In: Proceedings of CALCO 2017, LIPIcs, vol. 72, pp. 24:1\u201324:15 (2017)"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00389-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:04:19Z","timestamp":1663545859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00389-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030003883","9783030003890"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00389-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.coalg.org\/cmcs18\/","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"}]}}