{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:20:58Z","timestamp":1776316858529,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030025076","type":"print"},{"value":"9783030025083","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-02508-3_9","type":"book-chapter","created":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T14:22:47Z","timestamp":1539440567000},"page":"153-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Layer by Layer \u2013 Combining Monads"],"prefix":"10.1007","author":[{"given":"Fredrik","family":"Dahlqvist","sequence":"first","affiliation":[]},{"given":"Louis","family":"Parlant","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"9_CR1","series-title":"Oxford Logic Guides","volume-title":"Category Theory","author":"S Awodey","year":"2010","unstructured":"Awodey, S.: Category Theory. Oxford Logic Guides, vol. 49, 2nd edn. Oxford University Press, Oxford (2010)","edition":"2"},{"issue":"38","key":"9_CR2","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 412(38), 4989\u20135005 (2011). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2011.03.021","journal-title":"Theor. Comput. Sci."},{"key":"9_CR3","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: ETH 1966\/67","author":"J Beck","year":"1969","unstructured":"Beck, J.: Distributive laws. In: Eckmann, B. (ed.) Seminar on Triples and Categorical Homology Theory: ETH 1966\/67. LNM, vol. 80, pp. 119\u2013140. Springer, Heidelberg (1969). \n                      https:\/\/doi.org\/10.1007\/BFb0083084"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45699-6_2","volume-title":"Applied Semantics","author":"N Benton","year":"2002","unstructured":"Benton, N., Hughes, J., Moggi, E.: Monads and effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 42\u2013122. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45699-6_2"},{"key":"9_CR5","unstructured":"Bonchi, F., Silva, A., Sokolova, A.: The power of convex algebras. arXiv preprint 1707.02344 (2017). \n                      https:\/\/arxiv.org\/abs\/1707.02344"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bonsangue, M.M., Hansen, H.H., Kurz, A., Rot, J.: Presenting distributive laws. Log. Methods. Comput. Sci. 11(3), Article no. 2 (2015). \n                      https:\/\/doi.org\/10.2168\/lmcs-11(3:2)2015","DOI":"10.2168\/lmcs-11(3:2)2015"},{"key":"9_CR7","unstructured":"Cheng, E.: Distributive laws for Lawvere theories. arXiv preprint 1112.3076 (2011). \n                      https:\/\/arxiv.org\/abs\/1112.3076"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-662-49498-1_12","volume-title":"Programming Languages and Systems","author":"N Foster","year":"2016","unstructured":"Foster, N., Kozen, D., Mamouras, K., Reitblatt, M., Silva, A.: Probabilistic NetKAT. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 282\u2013309. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49498-1_12"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Foster, N., Kozen, D., Milano, M., Silva, A., Thompson, L.: A coalgebraic decision procedure for NetKAT. In: Proceedings of 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, January 2015, pp. 343\u2013355. ACM Press, New York (2015). \n                      https:\/\/doi.org\/10.1145\/2676726.2677011","DOI":"10.1145\/2676726.2677011"},{"issue":"3\u20134","key":"9_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/bf01988052","volume":"3","author":"N Gautam","year":"1957","unstructured":"Gautam, N.: The validity of equations of complex algebras. Arch. Math. Log. Grundl. 3(3\u20134), 117\u2013124 (1957). \n                      https:\/\/doi.org\/10.1007\/bf01988052","journal-title":"Arch. Math. Log. Grundl."},{"issue":"1\u20133","key":"9_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2006.12.026","volume":"375","author":"M Hyland","year":"2007","unstructured":"Hyland, M., Levy, P., Plotkin, G., Power, J.: Combining algebraic effects with continuations. Theor. Comput. Sci. 375(1\u20133), 20\u201340 (2007). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2006.12.026","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"9_CR12","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. Theor. Comput. Sci. 357(1\u20133), 70\u201399 (2006). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2006.03.013","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0168-0072(94)90020-5","volume":"69","author":"B Jacobs","year":"1994","unstructured":"Jacobs, B.: Semantics of weakening and contraction. Ann. Pure Appl. Log. 69(1), 73\u2013106 (1994). \n                      https:\/\/doi.org\/10.1016\/0168-0072(94)90020-5","journal-title":"Ann. Pure Appl. Log."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-32784-1_7","volume-title":"Coalgebraic Methods in Computer Science","author":"B Jacobs","year":"2012","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. In: Pattinson, D., Schr\u00f6der, L. (eds.) CMCS 2012. LNCS, vol. 7399, pp. 109\u2013129. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32784-1_7"},{"key":"9_CR15","series-title":"Workshops in Computing","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-1-4471-3215-8_12","volume-title":"Functional Programming, Glasgow 1992","author":"DJ King","year":"1993","unstructured":"King, D.J., Wadler, P.: Combining monads. In: Launchbury, J., Sansom, P.M. (eds.) Functional Programming, Glasgow 1992. Workshops in Computing, pp. 134\u2013143. Springer, London (1993). \n                      https:\/\/doi.org\/10.1007\/978-1-4471-3215-8_12"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-662-46678-0_10","volume-title":"Foundations of Software Science and Computation Structures","author":"B Klin","year":"2015","unstructured":"Klin, B., Rot, J.: Coalgebraic trace semantics via forgetful logics. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 151\u2013166. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-46678-0_10"},{"key":"9_CR17","unstructured":"Klin, B., Salamanca, J.: Iterated covariant powerset is not a monad. Electron. Notes Theor. Comput. Sci. (to appear)"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.7146\/math.scand.a-11042","volume":"29","author":"A Kock","year":"1972","unstructured":"Kock, A.: Bilinearity and Cartesian closed monads. Math. Scand. 29(2), 161\u2013174 (1972). \n                      https:\/\/doi.org\/10.7146\/math.scand.a-11042","journal-title":"Math. Scand."},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In: Proceedings of the 6th Annual Symposium on Logic in Computer Science, LICS 1991, Amsterdam, July 1991, pp. 214\u2013225. IEEE CS Press, Washington, DC (1991). \n                      https:\/\/doi.org\/10.1109\/lics.1991.151646","DOI":"10.1109\/lics.1991.151646"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-61055-3_39","volume-title":"Programming Languages and Systems \u2014 ESOP 1996","author":"S Liang","year":"1996","unstructured":"Liang, S., Hudak, P.: Modular denotational semantics for compiler construction. In: Nielson, H.R. (ed.) ESOP 1996. LNCS, vol. 1058, pp. 219\u2013234. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/3-540-61055-3_39"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Liang, S., Hudak, P., Jones, M.: Monad transformers and modular interpreters. In: Proceedings of 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1995, San Francisco, CA, USA, January 1995, pp. 333\u2013343. ACM Press, New York (1995). \n                      https:\/\/doi.org\/10.1145\/199448.199528","DOI":"10.1145\/199448.199528"},{"key":"9_CR22","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 Mac Lane","year":"1978","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5, 2nd edn. Springer, Heidelberg (1978). \n                      https:\/\/doi.org\/10.1007\/978-1-4757-4721-8","edition":"2"},{"key":"9_CR23","first-page":"172","volume":"18","author":"E Manes","year":"2007","unstructured":"Manes, E., Mulry, P.: Monad compositions I: general constructions and recursive distributive laws. Theor. Appl. Categ. 18, 172\u2013208 (2007). \n                      http:\/\/www.tac.mta.ca\/tac\/volumes\/18\/7\/18-07abs.html","journal-title":"Theor. Appl. Categ."},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-03741-2_4"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991). \n                      https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4","journal-title":"Inf. Comput."},{"key":"9_CR26","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). \n                      https:\/\/doi.org\/10.1007\/3-540-45931-6_24"},{"issue":"10","key":"9_CR27","doi-asserted-by":"publisher","first-page":"2888","DOI":"10.1016\/j.jpaa.2017.11.004","volume":"222","author":"T Sato","year":"2017","unstructured":"Sato, T.: The Giry monad is not strong for the canonical symmetric monoidal closed structure on \n                      \n                        \n                      \n                      $$\\mathbf{Meas}$$\n                      \n                        \n                          Meas\n                        \n                      \n                    . J. Pure Appl. Alg. 222(10), 2888\u20132896 (2017). \n                      https:\/\/doi.org\/10.1016\/j.jpaa.2017.11.004","journal-title":"J. Pure Appl. Alg."},{"key":"9_CR28","unstructured":"Smolka, S., Kumar, P., Foster, N., Kozen, D., Silva, A.: Cantor meets scott: semantic foundations for probabilistic networks. arXiv preprint 1607.05830 (2016). \n                      https:\/\/arxiv.org\/1607.05830"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Sokolova, A., Jacobs, B., Hasuo, I.: Generic trace semantics via coinduction. Log. Methods Comput. Sci. 3(4), Article no. 11 (2007). \n                      https:\/\/doi.org\/10.2168\/lmcs-3(4:11)2007","DOI":"10.2168\/lmcs-3(4:11)2007"},{"key":"9_CR30","unstructured":"Varacca, D.: Probability, nondeterminism and concurrency: two denotational models for probabilistic computation. BRICS Dissertation Series, vol. DS-03-14. Ph.D. thesis, Aarhus University (2003). \n                      http:\/\/www.brics.dk\/DS\/03\/14\/"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02508-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T02:48:45Z","timestamp":1583203725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02508-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030025076","9783030025083"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02508-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"15 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stellenbosch","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"South Africa","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":"16 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ictac.org.za\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}