{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:19:37Z","timestamp":1743038377906,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031664373"},{"type":"electronic","value":"9783031664380"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-66438-0_10","type":"book-chapter","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:03:08Z","timestamp":1721890988000},"page":"194-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Correspondence Between Composite Theories and Distributive Laws"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7841-2318","authenticated-orcid":false,"given":"Alo\u00efs","family":"Rosset","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0257-1574","authenticated-orcid":false,"given":"Maaike","family":"Zwart","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7061-1219","authenticated-orcid":false,"given":"Helle Hvid","family":"Hansen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2554-8270","authenticated-orcid":false,"given":"J\u00f6rg","family":"Endrullis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"issue":"1\u20133","key":"10_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\u20133), 1\u201345 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00728-4","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Ara, D., Burroni, A., Guiraud, Y., Malbos, P., M\u00e9tayer, F., Mimram, S.: Polygraphs: from rewriting to higher categories. CoRR abs\/2312.00429 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2312.00429","DOI":"10.48550\/ARXIV.2312.00429"},{"key":"10_CR3","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198568612.001.0001","volume-title":"Category Theory. Oxford Logic Guides","author":"S Awodey","year":"2006","unstructured":"Awodey, S.: Category Theory. Oxford Logic Guides. Ebsco Publishing, Ipswich (2006)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Barr, M., Wells, C.: Toposes, Triples and Theories. Comprehensive Studies in Mathematics, Springer, New York (1985)","DOI":"10.1007\/978-1-4899-0021-0"},{"key":"10_CR5","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0083084","volume-title":"Seminar on Triples and Categorical Homology Theory","author":"J Beck","year":"1969","unstructured":"Beck, J.: Distributive laws. In: Eckmann, B. (ed.) Seminar on Triples and Categorical Homology Theory. LNM, vol. 80, pp. 119\u2013140. Springer, Heidelberg (1969). https:\/\/doi.org\/10.1007\/BFb0083084"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Sokolova, A., Vignudelli, V.: The theory of traces for systems with nondeterminism and probability. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science. LICS 2019, pp. 1\u201314. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785673","DOI":"10.1109\/LICS.2019.8785673"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Borceux, F.: Handbook of Categorical Algebra. 2, Encyclopedia of Mathematics and its Applications, vol.\u00a051. Cambridge University Press, Cambridge (1994), categories and structures","DOI":"10.1017\/CBO9780511525858"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Cheng, E.: Distributive laws for Lawvere theories. Compositionality (2020). https:\/\/doi.org\/10.32408\/compositionality-2-1","DOI":"10.32408\/compositionality-2-1"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-030-02508-3_9","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2018","author":"F Dahlqvist","year":"2018","unstructured":"Dahlqvist, F., Parlant, L., Silva, A.: Layer by layer \u2013 combining monads. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 153\u2013172. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02508-3_9"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Dahlqvist, F., Neves, R.: Compositional semantics for new paradigms: probabilistic, hybrid and beyond (2018). https:\/\/doi.org\/10.48550\/ARXIV.1804.04145","DOI":"10.48550\/ARXIV.1804.04145"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Dash, S., Staton, S.: A monad for probabilistic point processes. In: Spivak, D.I., Vicary, J. (eds.) Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, Cambridge, USA, 6\u201310 July 2020. Electronic Proceedings in Theoretical Computer Science, vol.\u00a0333, pp. 19\u201332. Open Publishing Association (2021). https:\/\/doi.org\/10.4204\/EPTCS.333.2","DOI":"10.4204\/EPTCS.333.2"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10485-019-09582-w","volume":"28","author":"R Garner","year":"2020","unstructured":"Garner, R.: The Vietoris monad and weak distributive laws. Appl. Categ. Struct. 28(2), 339\u2013354 (2020). https:\/\/doi.org\/10.1007\/s10485-019-09582-w","journal-title":"Appl. Categ. Struct."},{"key":"10_CR13","unstructured":"Goy, A.: On the compositionality of monads via weak distributive laws. (Compositionnalit\u00e9 des monades par lois de distributivit\u00e9 faibles). Ph.D. thesis, University of Paris-Saclay, France (2021). https:\/\/tel.archives-ouvertes.fr\/tel-03426949"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Goy, A., Petrisan, D.: Combining probabilistic and non-deterministic choice via weak distributive laws. In: Hermanns, H., Zhang, L., Kobayashi, N., Miller, D. (eds.) LICS \u201920: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 454\u2013464. ACM (2020). https:\/\/doi.org\/10.1145\/3373718.3394795","DOI":"10.1145\/3373718.3394795"},{"key":"10_CR15","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15240-5_1","volume-title":"Theoretical Computer Science","author":"B Jacobs","year":"2010","unstructured":"Jacobs, B.: Convexity, duality and effects. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IAICT, vol. 323, pp. 1\u201319. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15240-5_1"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: From multisets over distributions to distributions over multisets. In: Proceedings of the 36th Annual ACM\/IEEE Symposium on Logic in Computer Science. LICS \u201921. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470678","DOI":"10.1109\/LICS52264.2021.9470678"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.jcss.2014.12.005","volume":"81","author":"B Jacobs","year":"2015","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comput. Syst. Sci. 81(5), 859\u2013879 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2014.12.005","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Klin, B., Salamanca, J.: Iterated covariant powerset is not a monad. In: Staton, S. (ed.) Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics. MFPS 2018. Electronic Notes in Theoretical Computer Science, vol.\u00a0341, pp. 261\u2013276. Elsevier (2018). https:\/\/doi.org\/10.1016\/j.entcs.2018.11.013","DOI":"10.1016\/j.entcs.2018.11.013"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Natural transformations as rewrite rules and monad composition. Log. Methods Comput. Sci. 15(1) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(1:1)2019","DOI":"10.23638\/LMCS-15(1:1)2019"},{"key":"10_CR20","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4721-8","volume-title":"Categories for the Working Mathematician","author":"S MacLane","year":"1971","unstructured":"MacLane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer, New York (1971). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Manes, E.: Algebraic Theories. Graduate Texts in Mathematics, vol.\u00a026. Springer, New York (1976). https:\/\/doi.org\/10.1007\/978-1-4612-9860-1","DOI":"10.1007\/978-1-4612-9860-1"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Manes, E., Mulry, P.: Monad compositions. i: general constructions and recursive distributive laws. Theory Appl. Categ. 18, 172\u2013208 (2007)","DOI":"10.1017\/S0960129508006695"},{"key":"10_CR23","unstructured":"McCune, W.: Release of prover9. In: Mile High Conference on Quasigroups, Loops and Nonassociative Systems, Denver, Colorado (2005)"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4, selections from 1989 IEEE Symposium on Logic in Computer Science","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"10_CR25","unstructured":"Parlant, L.: Monad composition via preservation of algebras. Ph.D. thesis, University College London, UK (2020). https:\/\/ethos.bl.uk\/OrderDetails.do?uin=uk.bl.ethos.819930"},{"key":"10_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796817000077","volume":"27","author":"M Pir\u00f3g","year":"2017","unstructured":"Pir\u00f3g, M., Staton, S.: Backtracking with cut via a distributive law and left-zero monoids. J. Funct. Program. 27, e17 (2017). https:\/\/doi.org\/10.1017\/S0956796817000077","journal-title":"J. Funct. Program."},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45931-6_24","volume-title":"Foundations of Software Science and Computation Structures","author":"G Plotkin","year":"2002","unstructured":"Plotkin, G., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) FoSSaCS 2002. LNCS, vol. 2303, pp. 342\u2013356. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_24"},{"key":"10_CR28","volume-title":"Category Theory in Context","author":"E Riehl","year":"2017","unstructured":"Riehl, E.: Category Theory in Context. Dover Modern Math Originals, Dover Publications, Aurora (2017)"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-031-10736-8_6","volume-title":"Coalgebraic Methods in Computer Science","author":"A Rosset","year":"2022","unstructured":"Rosset, A., Hansen, H.H., Endrullis, J.: Algebraic presentation of semifree monads. In: Hansen, H.H., Zanasi, F. (eds.) CMCS 2022. LNCS, vol. 13225, pp. 110\u2013132. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10736-8_6"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Rosset, A., Zwart, M., Hansen, H.H., Endrullis, J.: Correspondence between composite theories and distributive laws (2024). https:\/\/doi.org\/10.48550\/ARXIV.2404.00581","DOI":"10.48550\/ARXIV.2404.00581"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-74621-8_18","volume-title":"Frontiers of Combining Systems","author":"P Schneider-Kamp","year":"2007","unstructured":"Schneider-Kamp, P., Thiemann, R., Annov, E., Codish, M., Giesl, J.: Proving termination using recursive path orders and SAT solving. In: Konev, B., Wolter, F. (eds.) FroCoS 2007. LNCS (LNAI), vol. 4720, pp. 267\u2013282. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74621-8_18"},{"key":"10_CR32","unstructured":"Terese: Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"10_CR33","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1017\/S0960129505005074","volume":"16","author":"D Varacca","year":"2006","unstructured":"Varacca, D., Winskel, G.: Distributing probabililty over nondeterminism. Math. Struct. Comput. Sci. 16, 87\u2013113 (2006). https:\/\/doi.org\/10.1017\/S0960129505005074","journal-title":"Math. Struct. Comput. Sci."},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Zantema, H., Geser, A.: A complete characterization of termination of $$0^{\\text{p}} 1^{\\text{ q }} -> 1^{\\text{ r }} 0^{\\text{ s }}$$. Appl. Algebra Eng. Commun. Comput. 11(1), 1\u201325 (2000). https:\/\/doi.org\/10.1007\/S002009900019","DOI":"10.1007\/S002009900019"},{"key":"10_CR35","unstructured":"Zwart, M.: On the non-compositionality of monads via distributive laws. Ph.D. thesis, Department of Computer Science, University of Oxford (2020)"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Zwart, M., Marsden, D.: No-go theorems for distributive laws. Log. Methods Comput. Sci. 18 (2022). https:\/\/doi.org\/10.46298\/lmcs-18(1:13)2022","DOI":"10.46298\/lmcs-18(1:13)2022"}],"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-031-66438-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:10:12Z","timestamp":1721891412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66438-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031664373","9783031664380"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66438-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 July 2024","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":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}