{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:49Z","timestamp":1760202709765},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496299"},{"type":"electronic","value":"9783662496305"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_7","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T05:04:32Z","timestamp":1458536672000},"page":"107-125","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A New Foundation for Finitary Corecursion"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Milius","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]},{"given":"Thorsten","family":"Wi\u00dfmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_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\u201345 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"1:15","key":"7_CR2","first-page":"43","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(1:15), 43 (2011)","journal-title":"Log. Methods Comput. Sci."},{"key":"7_CR3","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."},{"issue":"2","key":"7_CR4","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(2), 417\u2013480 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"4","key":"7_CR5","first-page":"589","volume":"015","author":"J Ad\u00e1mek","year":"1974","unstructured":"Ad\u00e1mek, J.: Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carolin. 015(4), 589\u2013602 (1974)","journal-title":"Comment. Math. Univ. Carolin."},{"issue":"6","key":"7_CR6","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":"38","key":"7_CR7","doi-asserted-by":"publisher","first-page":"4969","DOI":"10.1016\/j.tcs.2011.04.027","volume":"412","author":"J Ad\u00e1mek","year":"2011","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: On second-order iterative monads. Theoret. Comput. Sci. 412(38), 4969\u20134988 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR8","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, New York (1994)"},{"key":"7_CR9","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."},{"key":"7_CR10","unstructured":"Bartels, F.: On generalized coinduction and probabilistic specification formats: Distributive laws in coalgebraic modelling. Ph.D. thesis, Vrije Universiteit Amsterdam.(2004)"},{"key":"7_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories: The Equational Logic of Iterative Processes","author":"SL Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)"},{"issue":"1","key":"7_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2422085.2422092","volume":"14","author":"Marcello M. Bonsangue","year":"2013","unstructured":"Bonsangue, M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans. Comput. Log. 14((1: 7)), 52.(2013)","journal-title":"ACM Transactions on Computational Logic"},{"key":"7_CR13","unstructured":"Bonsangue, M.M., Milius, S., Rot, J.: On the specification of operations on the rational behaviour of systems. In: Luttik, B., Reniers, M.A. (eds.) Proceedings of Combined Workshop on Expressiveness in Concurrency and Structural Operational Semantics (EXPRESS\/SOS\u201912), Electronic Proceedings of Theoretical Computer Science, vol. 89, pp. 3\u201318.(2012)"},{"key":"7_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525858","volume-title":"Handbook of Categorical Algebra: Volume 1, Basic Category Theory. Encyclopedia of Mathematics and its Applications","author":"F Borceux","year":"1994","unstructured":"Borceux, F.: Handbook of Categorical Algebra: Volume 1, Basic Category Theory. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1994)"},{"key":"7_CR15","unstructured":"Cenciarelli, P., Moggi, E.: A syntactic approach to modularity in denotational semantic. In: Proceedings of 5th CTCS. CWI Technical report.(1993)"},{"key":"7_CR16","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":"7_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer Publishing Company, Berlin (2009)","edition":"1"},{"key":"7_CR18","first-page":"175","volume-title":"Logic Colloquium 1973","author":"C Elgot","year":"1975","unstructured":"Elgot, C.: Monadic computation and iterative algebraic theories. In: Rose, H.E., Sheperdson, J.C. (eds.) Logic Colloquium 1973, vol. 80, pp. 175\u2013230. North-Holland Publishers, Amsterdam (1975)"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.24033\/bsmf.1777","volume":"102","author":"M Fliess","year":"1974","unstructured":"Fliess, M.: Sur divers produits de s\u00e9ries formelles. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France 102, 181\u2013191 (1974)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France"},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BFb0059404","volume-title":"Lokal pr\u00e4sentierbare Kategorien","author":"Peter Gabriel","year":"1971","unstructured":"Gabriel, P., Ulmer, F.: Lokal pr\u00e4sentierbare Kategorien. Lecture Notes in Mathematics, vol. 221. Springer, Heidelberg (1971)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S0960129505004743","volume":"15","author":"N Ghani","year":"2005","unstructured":"Ghani, N., L\u00fcth, C., Marchi, F.D.: Monads of coalgebras: rational terms and term graphs. Math. Struct. Comput. Sci. 15, 433\u2013451 (2005)","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-40206-7_13","volume-title":"Algebra and Coalgebra in Computer Science","author":"Sergey Goncharov","year":"2013","unstructured":"Goncharov, Sergey: Trace Semantics via Generic Observations. In: Heckel, Reiko, Milius, Stefan (eds.) CALCO 2013. LNCS, vol. 8089, pp. 158\u2013174. Springer, Heidelberg (2013)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-662-44602-7_21","volume-title":"Theoretical Computer Science","author":"Sergey Goncharov","year":"2014","unstructured":"Goncharov, Sergey, Milius, Stefan, Silva, Alexandra: Towards a Coalgebraic Chomsky Hierarchy. In: Diaz, Josep, Lanese, Ivan, Sangiorgi, Davide (eds.) TCS 2014. LNCS, vol. 8705, pp. 265\u2013280. Springer, Heidelberg (2014)"},{"issue":"4","key":"7_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/0201024","volume":"1","author":"MA Harrison","year":"1972","unstructured":"Harrison, M.A., Havel, I.M.: Real-time strict deterministic languages. SIAM J. Comput. 1(4), 333\u2013349 (1972)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"7_CR25","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., Power, J.: Combining effects: sum and tensor. Theoret. Comput. Sci. 357(1\u20133), 70\u201399 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11780274_20","volume-title":"Algebra, Meaning, and Computation","author":"Bart Jacobs","year":"2006","unstructured":"Jacobs, Bart: A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages. In: Futatsugi, Kokichi, Jouannaud, Jean-Pierre, Meseguer, Jos\u00e9 (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 375\u2013404. Springer, Heidelberg (2006)"},{"issue":"38","key":"7_CR27","doi-asserted-by":"publisher","first-page":"5043","DOI":"10.1016\/j.tcs.2011.03.023","volume":"412","author":"B Klin","year":"2011","unstructured":"Klin, B.: Bialgebras for structural operational semantics: an introduction. Theoret. Comput. Sci. 412(38), 5043\u20135069 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR28","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":"7_CR29","unstructured":"MacLane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, 2nd edn. Springer, New York.(1998)"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Milius, S.: A sound and complete calculus for finite stream circuits. In: Proceedings of 25th Annual Symposium on Logic in Computer Science (LICS 2010), pp. 449\u2013458.(2010)","DOI":"10.1109\/LICS.2010.11"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Milius, S., Bonsangue, M.M., Myers, R.S., Rot, J.: Rational operation models. Electron. Notes Theoret. Comput. Sci. 298, 257\u2013282. In: Mislove, M. (ed.) Proceedings of 29th conference on Mathematical Foundations of Programming Science (MFPS XXIX).(2013)","DOI":"10.1016\/j.entcs.2013.09.017"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2006.07.002","volume":"366","author":"S Milius","year":"2006","unstructured":"Milius, S., Moss, L.S.: The category theoretic solution of recursive program schemes. Theoret. Comput. Sci. 366, 3\u201359 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR33","unstructured":"Milius, S., Pattinson, D., Wi\u00dfmann, T.: A new foundation for finitary corecursion: the locally finite fixpoint and its properties (2015).. \n                      http:\/\/arxiv.org\/abs\/1601.01532"},{"key":"7_CR34","unstructured":"Milius, S., Wi\u00dfmann, T.: Finitary corecursion for the infinitary lambda calculus. In: Proceedings of 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015. Leibniz International Proceedings in Informatics.(2015)"},{"key":"7_CR35","unstructured":"Myers, R.: Rational coalgebraic machines in varieties: Languages, completeness and automatic proofs. Ph.D. thesis, Imperial College London, Department of Computing.(2011)"},{"key":"7_CR36","first-page":"257","volume-title":"Monographs in Theoretical Computer Science","author":"Ion Petre","year":"2009","unstructured":"Petre, I., Salomaa, A.: Algebraic systems and pushdown automata. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series, pp. 257\u2013289.. Springer, Heidelberg (2009)"},{"key":"7_CR37","unstructured":"Plotkin, G., Turi, D.: Towards a mathematical operational semantics. In: Proceedings of 12th LICS Conference, pp. 280\u2013291. IEEE Computer Society Press.(1997)"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR \u201998 Concurrency Theory","author":"JJMM Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Automata and Coinduction. In: Sangiorgi, Davide, de Simone, Robert (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 194\u2013218. Springer, Heidelberg (1998)"},{"issue":"1","key":"7_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"7_CR40","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1016\/j.ic.2010.09.007","volume":"209","author":"A Silva","year":"2011","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Quantitative kleene coalgebras. Inf. Comput. 209(5), 822\u2013849 (2011)","journal-title":"Inf. Comput."},{"issue":"1","key":"7_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(1:9)2013","volume":"9","author":"A Silva","year":"2013","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.: Generalizing determinization from automata to coalgebras. Log. Meth. Comput. Sci. 9(1), 1\u201327 (2013)","journal-title":"Log. Meth. Comput. Sci."},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Silva, A., Bonsangue, M.M., Rutten, J.: Non-deterministic Kleene coalgebras. Log. Meth. Comput. Sci. 6(3: 23), 39.(2010)","DOI":"10.2168\/LMCS-6(3:23)2010"},{"issue":"3","key":"7_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(3:14)2013","volume":"9","author":"J Winter","year":"2013","unstructured":"Winter, J., Bonsangue, M., Rutten, J.: Coalgebraic characterizations of context-free languages. Log. Meth. Comput. Sci. 9(3), 1\u201339 (2013)","journal-title":"Log. Meth. Comput. Sci."},{"issue":"5","key":"7_CR44","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.jcss.2014.12.004","volume":"81","author":"J Winter","year":"2015","unstructured":"Winter, J., Bonsangue, M.M., Rutten, J.J.: Context-free coalgebras. J. Comput. Syst. Sci. 81(5), 911\u2013939 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR45","unstructured":"Wi\u00dfmann, T.: The locally finite fixpoint and its properties. Master\u2019s thesis, Friedrich-Alexander Universit\u00e4t Erlangen-N\u00fcrnberg (April 2015). \n                      http:\/\/thorsten-wissmann.de\/theses\/ma-wissmann.pdf"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T21:06:31Z","timestamp":1584997591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_7"}},"subtitle":["The Locally Finite Fixpoint and Its Properties"],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}