{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:47:56Z","timestamp":1764557276654},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402050"},{"type":"electronic","value":"9783642402067"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-40206-7_9","type":"book-chapter","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T03:29:41Z","timestamp":1377574181000},"page":"95-109","source":"Crossref","is-referenced-by-count":10,"title":["Presenting Distributive Laws"],"prefix":"10.1007","author":[{"given":"Marcello M.","family":"Bonsangue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helle Hvid","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Kurz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 197\u2013292. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50021-7"},{"key":"9_CR2","unstructured":"Bartels, F.: On Generalised Coinduction and Probabilistic Specification Formats. Ph.D. thesis, Vrije Universiteit Amsterdam (2004)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S096012951000054X","volume":"21","author":"H. Hansen","year":"2011","unstructured":"Hansen, H., Klin, B.: Pointwise extensions of GSOS-defined operations. Math. Struct. in Comp. Sci.\u00a021, 321\u2013361 (2011)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"9_CR4","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":"B. Jacobs","year":"2006","unstructured":"Jacobs, B.: A bialgebraic review of deterministic automata, regular expressions and languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol.\u00a04060, pp. 375\u2013404. Springer, Heidelberg (2006)"},{"key":"9_CR5","unstructured":"Jacobs, B.: Introduction to coalgebra. towards mathematics of states and observations. version 2.0 (2012) (unpublished book draft)"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.ic.2005.03.006","volume":"204","author":"B. Jacobs","year":"2006","unstructured":"Jacobs, B.: Distributive laws for the coinductive solution of recursive equations. Inf. Comput.\u00a0204(4), 561\u2013587 (2006)","journal-title":"Inf. Comput."},{"key":"9_CR7","doi-asserted-by":"publisher","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. Society\u00a07, 294\u2013297 (1975)","journal-title":"Bull. London Math. Society"},{"key":"9_CR8","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. Theor. Comp. Sci.\u00a0412, 5043\u20135069 (2011)","journal-title":"Theor. Comp. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.jlap.2004.03.005","volume":"60-61","author":"B. Klin","year":"2004","unstructured":"Klin, B.: Adding recursive constructs to bialgebraic semantics. J. Logic and Algebraic Programming\u00a060-61, 259\u2013286 (2004)","journal-title":"J. Logic and Algebraic Programming"},{"issue":"1-2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2004.07.024","volume":"327","author":"M. Lenisa","year":"2004","unstructured":"Lenisa, M., Power, J., Watanabe, H.: Category theory for operational semantics. Theor. Comp. Sci.\u00a0327(1-2), 135\u2013154 (2004)","journal-title":"Theor. Comp. Sci."},{"issue":"7","key":"9_CR11","first-page":"172","volume":"18","author":"E. Manes","year":"2007","unstructured":"Manes, E., Mulry, P.: Monad compositions I: General constructions and recursive distributive laws. Theory and Applications of Categories\u00a018(7), 172\u2013208 (2007)","journal-title":"Theory and Applications of Categories"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Milius, S.: A sound and complete calculus for finite stream circuits. In: Proceedings of LICS 2012, pp. 421\u2013430. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.11"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-31982-5_3","volume-title":"Foundations of Software Science and Computational Structures","author":"M.R. Mousavi","year":"2005","unstructured":"Mousavi, M.R., Reniers, M.A.: Congruence for structural congruences. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 47\u201362. Springer, Heidelberg (2005)"},{"key":"9_CR14","unstructured":"Rot, J., Bonchi, F., Bonsangue, M., Pous, D., Rutten, J., Silva, A.: Enhanced coalgebraic bisimulation, http:\/\/www.liacs.nl\/~jrot\/papers\/up-to.pdf"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-35843-2_32","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"J. Rot","year":"2013","unstructured":"Rot, J., Bonsangue, M., Rutten, J.: Coalgebraic bisimulation-up-to. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 369\u2013381. Springer, Heidelberg (2013)"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00895-2","volume":"308","author":"J. Rutten","year":"2003","unstructured":"Rutten, J.: Behavioural differential equations: a coinductive calculus of streams, automata and power series. Theor. Comp. Sci.\u00a0308(1), 1\u201353 (2003)","journal-title":"Theor. Comp. Sci."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1017\/S0960129504004517","volume":"15","author":"J. Rutten","year":"2005","unstructured":"Rutten, J.: A coinductive calculus of streams. Math. Struct. in Comp. Sci.\u00a015, 93\u2013147 (2005)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"9_CR18","unstructured":"Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing the powerset construction, coalgebraically. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS. LIPIcs, vol.\u00a08, pp. 272\u2013283. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"9_CR19","unstructured":"Turi, D., Plotkin, G.: Towards a mathemathical operational semantics. In: Proceedings of LICS 1997, pp. 280\u2013291. IEEE Computer Society (1997)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Watanabe, H.: Well-behaved translations between structural operational semantics. In: Moss, L. (ed.) Proceedings of CMCS 2002. ENTCS, vol.\u00a065, pp. 337\u2013357. Elsevier (2002)","DOI":"10.1016\/S1571-0661(04)80372-4"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Winskel, G.: The formal semantics of programming languages - an introduction. Foundation of computing series. MIT Press (1993)","DOI":"10.7551\/mitpress\/3054.001.0001"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-22944-2_25","volume-title":"Algebra and Coalgebra in Computer Science","author":"J. Winter","year":"2011","unstructured":"Winter, J., Bonsangue, M.M., Rutten, J.: Context-free languages, coalgebraically. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 359\u2013376. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40206-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T16:19:31Z","timestamp":1596385171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40206-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402050","9783642402067"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40206-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}