{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T15:32:40Z","timestamp":1785598360437,"version":"3.56.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030452308","type":"print"},{"value":"9783030452315","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We provide graded extensions of algebraic theories and Lawvere theories that correspond to graded monads. We prove that graded algebraic theories, graded Lawvere theories, and finitary graded monads are equivalent via equivalence of categories, which extends the equivalence for monads. We also give sums and tensor products of graded algebraic theories to combine computational effects as an example of importing techniques based on algebraic theories to graded monads.<\/jats:p>","DOI":"10.1007\/978-3-030-45231-5_21","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"401-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Graded Algebraic Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3954-8255","authenticated-orcid":false,"given":"Satoshi","family":"Kura","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Berger, C., Melli\u00e8s, P.A., Weber, M.: Monads with arities and their associatedtheories. Journal of Pure and Applied Algebra 216(8), 2029 \u2013 2048(2012). https:\/\/doi.org\/10.1016\/j.jpaa.2012.02.039, special Issue devoted to the International Conference in Category Theory \u2018CT2010\u2019","DOI":"10.1016\/j.jpaa.2012.02.039"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Curien, P., Fiore, M.P., Munch-Maccagnoni, G.: A theory of effects and resources: adjunction models and polarised calculi. In: Bod\u00edk, R., Majumdar, R. (eds.) Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20-22, 2016. pp. 44\u201356. ACM (2016). https:\/\/doi.org\/10.1145\/2837614.2837652","DOI":"10.1145\/2837614.2837652"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Day, B.: On closed categories of functors. In: Reports of the Midwest Category Seminar IV. Lecture Notes in Mathematics, vol.\u00a0137, pp. 1\u201338. Springer, Berlin, Heidelberg (1970)","DOI":"10.1007\/BFb0060438"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Dorsch, U., Milius, S., Schr\u00f6der, L.: Graded monads and graded logics for the linear time - branching time spectrum. In: Fokkink, W., van Glabbeek, R. (eds.) 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands. LIPIcs, vol. 140, pp. 36:1\u201336:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.36","DOI":"10.4230\/LIPIcs.CONCUR.2019.36"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"E. J. Linton, F.: Some aspects of equational categories. In: Proceedings of the Conference on Categorical Algebra. pp. 84\u201394 (01 1966). https:\/\/doi.org\/10.1007\/978-3-642-99902-4_3","DOI":"10.1007\/978-3-642-99902-4_3"},{"key":"21_CR6","unstructured":"Fujii, S.: A unified framework for notions of algebraic theory (2019), https:\/\/arxiv.org\/abs\/1904.08541."},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Fujii, S., Katsumata, S., Melli\u00e8s, P.: Towards a formal theory of graded monads. In: Jacobs, B., L\u00f6ding, C. (eds.) Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9634, pp. 513\u2013530. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49630-5_30","DOI":"10.1007\/978-3-662-49630-5_30"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Hasuo, I.: Generic weakest precondition semantics from monads enriched with order. Theor. Comput. Sci. 604, 2\u201329 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.03.047","DOI":"10.1016\/j.tcs.2015.03.047"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Hyland, M., Plotkin, G.D., Power, J.: Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1\u20133), 70\u201399 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.03.013","DOI":"10.1016\/j.tcs.2006.03.013"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Hyland, M., Power, J.: Discrete Lawvere theories and computational effects. Theoretical Computer Science 366(1), 144 \u2013 162 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.07.007, algebra and Coalgebra in Computer Science","DOI":"10.1016\/j.tcs.2006.07.007"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Hyland, M., Power, J.: The category theoretic understanding of universal algebra: Lawvere theories and monads. Electronic Notes in Theoretical Computer Science 172, 437\u2013458 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.019, computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin","DOI":"10.1016\/j.entcs.2007.02.019"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Katsumata, S.: Parametric effect monads and semantics of effect systems. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201914, San Diego, CA, USA, January 20-21, 2014. pp. 633\u2013646. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535846","DOI":"10.1145\/2535838.2535846"},{"key":"21_CR13","unstructured":"Kelly, M.: Basic Concepts of Enriched Category Theory. Lecture note series \/ London mathematical society, Cambridge University Press (1982)"},{"key":"21_CR14","unstructured":"Kura, S.: Graded algebraic theories (2020), https:\/\/arxiv.org\/abs\/2002.06784."},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Lack, S., Power, J.: Gabriel-Ulmer duality and Lawvere theories enriched over a general base. Journal of Functional Programming 19(3\u20134), 265\u2013286 (2009). https:\/\/doi.org\/10.1017\/S0956796809007254","DOI":"10.1017\/S0956796809007254"},{"key":"21_CR16","unstructured":"Lucyshyn-Wright, R.B.B.: Enriched algebraic theories and monads for a system of arities. Theory and Applications of Categories 31(5), 101\u2013137 (2016)"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Milius, S., Pattinson, D., Schr\u00f6der, L.: Generic trace semantics and graded monads. In: Moss, L.S., Sobocinski, P. (eds.) 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, June 24-26, 2015, Nijmegen, The Netherlands. LIPIcs, vol. 35, pp. 253\u2013269. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.253","DOI":"10.4230\/LIPIcs.CALCO.2015.253"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS \u201989), Pacific Grove, California, USA, June 5-8, 1989. pp. 14\u201323. IEEE Computer Society (1989). https:\/\/doi.org\/10.1109\/LICS.1989.39155","DOI":"10.1109\/LICS.1989.39155"},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Nishizawa, K., Power, J.: Lawvere theories enriched over a general base. Journal of Pure and Applied Algebra 213(3), 377 \u2013 386 (2009). https:\/\/doi.org\/10.1016\/j.jpaa.2008.07.009","DOI":"10.1016\/j.jpaa.2008.07.009"},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"Plotkin, G.D., Power, J.: Adequacy for algebraic effects. In: Honsell, F., Miculan, M. (eds.) Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings. Lecture Notes in Computer Science, vol. 2030, pp. 1\u201324. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-45315-6_1","DOI":"10.1007\/3-540-45315-6_1"},{"key":"21_CR21","doi-asserted-by":"publisher","unstructured":"Plotkin, G.D., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings. Lecture Notes in Computer Science, vol. 2303, pp. 342\u2013356. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_24","DOI":"10.1007\/3-540-45931-6_24"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Plotkin, G.D., Pretnar, M.: A logic for algebraic effects. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA. pp. 118\u2013129. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/LICS.2008.45","DOI":"10.1109\/LICS.2008.45"},{"key":"21_CR23","doi-asserted-by":"publisher","unstructured":"Plotkin, G.D., Pretnar, M.: Handling algebraic effects. Logical Methods in Computer Science 9(4) (2013). https:\/\/doi.org\/10.2168\/LMCS-9(4:23)2013","DOI":"10.2168\/LMCS-9(4:23)2013"},{"key":"21_CR24","unstructured":"Power, J.: Enriched Lawvere theories. Theory and Applications of Categories 6(7), 83\u201393 (1999)"},{"key":"21_CR25","doi-asserted-by":"publisher","unstructured":"Power, J.: Countable Lawvere theories and computational effects. Electr. Notes Theor. Comput. Sci. 161, 59\u201371 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2006.04.025","DOI":"10.1016\/j.entcs.2006.04.025"},{"key":"21_CR26","unstructured":"Sankappanavar, H.P., Burris, S.: A course in universal algebra. Springer-Verlag(1981)"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Smirnov, A.: Graded monads and rings of polynomials. Journal of Mathematical Sciences 151(3), 3032\u20133051 (2008)","DOI":"10.1007\/s10958-008-9013-7"},{"key":"21_CR28","doi-asserted-by":"publisher","unstructured":"Staton, S.: Freyd categories are enriched Lawvere theories. Electronic Notes in Theoretical Computer Science 303, 197 \u2013 206 (2014). https:\/\/doi.org\/10.1016\/j.entcs.2014.02.010, proceedings of the Workshop on Algebra, Coalgebra and Topology (WACT 2013)","DOI":"10.1016\/j.entcs.2014.02.010"},{"key":"21_CR29","doi-asserted-by":"publisher","unstructured":"Street, R.: The formal theory of monads. Journal of Pure and Applied Algebra 2(2), 149\u2013168 (1972). https:\/\/doi.org\/10.1016\/0022-4049(72)90019-9","DOI":"10.1016\/0022-4049(72)90019-9"}],"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-030-45231-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T13:48:30Z","timestamp":1610027310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45231-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452308","9783030452315"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45231-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}