{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:12:32Z","timestamp":1725732752787},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44124-4_4","type":"book-chapter","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T15:20:39Z","timestamp":1408461639000},"page":"53-74","source":"Crossref","is-referenced-by-count":0,"title":["How to Kill Epsilons with a Dagger"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,20]]},"reference":[{"key":"4_CR1","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. Inform. Comput. 208, 1306\u20131348 (2010). doi: 10.1016\/j.ic.2009.10.006","journal-title":"Inform. Comput."},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","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. Structures Comput. Sci. 21(2), 417\u2013480 (2011)","journal-title":"Math. Structures Comput. Sci."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Asada, K., Hidaka, S., Kato, H., Hu, Z., Nakano, K.: A parameterized graph transformation calculus for finite graphs with monadic branches. In: Pe\u00f1a, R., Schrijvers, T. (eds.) PPDP, pp. 73\u201384. ACM (2013)","DOI":"10.1145\/2505879.2505903"},{"issue":"38","key":"4_CR4","doi-asserted-by":"crossref","first-page":"4989","DOI":"10.1016\/j.tcs.2011.03.021","volume":"412","author":"A Balan","year":"2011","unstructured":"Balan, A., Kurz, A.: On coalgebras over algebras. Theoret. Comput. Sci. 412(38), 4989\u20135005 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR5","doi-asserted-by":"crossref","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":"4_CR6","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories: The Equational Logic of Iterative","author":"SL Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories: The Equational Logic of Iterative. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bonsangue, M.M., Hansen, H.H., Kurz, A., Rot, J.: Presenting distributive laws. In: Heckel and Milius [15], pp. 95\u2013109","DOI":"10.1007\/978-3-642-40206-7_9"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Programming Semantics","year":"1994","unstructured":"Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.): MFPS 1993. LNCS, vol. 802. Springer, Heidelberg (1994)"},{"key":"4_CR9","series-title":"London Mathematical Society Lecture Notes Series","volume-title":"Remarks on Algebraically Compact Categories","author":"PJ Freyd","year":"1992","unstructured":"Freyd, P.J.: Remarks on Algebraically Compact Categories. London Mathematical Society Lecture Notes Series, vol. 177. Cambridge University Press, London (1992)"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7551\/mitpress\/5641.003.0010","volume-title":"Proof, Language, and Interaction","author":"F Gadducci","year":"2000","unstructured":"Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, pp. 133\u2013166. MIT Press, Boston (2000)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic forward and backward simulations. In: (Partly in Japanese) Proceedings of JSSST Annual Meeting (2006)","DOI":"10.1007\/11817949_27"},{"issue":"4:11","key":"4_CR12","first-page":"1","volume":"3","author":"I Hasuo","year":"2007","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Methods Comput. Sci. 3(4:11), 1\u201336 (2007)","journal-title":"Log. Methods Comput. Sci."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Algebra and Coalgebra in Computer Science","year":"2013","unstructured":"Heckel, R., Milius, S. (eds.): Algebra and Coalgebra in Computer Science. Lecture Notes in Computer Science, vol. 8089. Springer, Heidelberg (2013)"},{"key":"4_CR14","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"2006","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Wesley, Lebanon (2006)","edition":"3"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1112\/blms\/7.3.294","volume":"7","author":"P Johnstone","year":"1975","unstructured":"Johnstone, P.: Adjoint lifting theorems for categories of algebras. Bull. London Math. Soc. 7, 294\u2013297 (1975)","journal-title":"Bull. London Math. Soc."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0004972700006353","volume":"22","author":"GM Kelly","year":"1980","unstructured":"Kelly, G.M.: A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on. Bull. Austral. Math. Soc. 22, 1\u201383 (1980)","journal-title":"Bull. Austral. Math. Soc."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. DAIMI PB-78, Computer Science Department, Aarhus University (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"4_CR18","doi-asserted-by":"crossref","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, Berlin (1971)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-642-03741-2_4","volume-title":"Algebra and Coalgebra in Computer Science","author":"S Milius","year":"2009","unstructured":"Milius, S., Palm, T., Schwencke, D.: Complete iterativity for algebras with effects. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 34\u201348. Springer, Heidelberg (2009)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Mulry, P.S.: Lifting theorems for Kleisli categories. In: Brookes et al. [10], pp. 304\u2013319","DOI":"10.1007\/3-540-58027-1_15"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Rabinovich, A.M.: A complete axiomatisation for trace congruence of finite state behaviors. In: Brookes et al. [10], pp. 530\u2013543","DOI":"10.1007\/3-540-58027-1_25"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Silva, A., Westerbaan, B.: A coalgebraic view of $$\\varepsilon $$ -transitions. In: Heckel and Milius [15], pp. 267\u2013281","DOI":"10.1007\/978-3-642-40206-7_20"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-642-32784-1_3","volume-title":"Coalgebraic Methods in Computer Science","author":"P Soboci\u0144ski","year":"2012","unstructured":"Soboci\u0144ski, P.: Relational presheaves as labelled transition systems. In: Pattinson, D., Schr\u00f6der, L. (eds.) CMCS 2012. LNCS, vol. 7399, pp. 40\u201350. Springer, Heidelberg (2012)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proceedings of Logic in Computer Science (LICS\u201997). IEEE Computer Society (1997)","DOI":"10.1109\/LICS.1997.614955"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44124-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T17:07:48Z","timestamp":1717261668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44124-4_4"}},"subtitle":["A Coalgebraic Take on Systems with Algebraic Label Structure"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44124-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}