{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:53:38Z","timestamp":1776891218260,"version":"3.51.2"},"reference-count":33,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T00:00:00Z","timestamp":1727913600000},"content-version":"unspecified","delay-in-days":276,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We present an arrow calculus with operations and handlers and its operational and denotational semantics. The calculus is an extension of Lindley, Wadler and Yallop\u2019s arrow calculus.<\/jats:p>\n                  <jats:p>\n                    The denotational semantics is given using a strong (pro)monad\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0956796824000066_inline1.png\"\/>\n                        <jats:tex-math>$\\mathcal{A}$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    in the bicategory of categories and profunctors. The construction of this strong monad\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0956796824000066_inline2.png\"\/>\n                        <jats:tex-math>$\\mathcal{A}$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is not trivial because of a size problem. To build denotational semantics, we investigate what\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0956796824000066_inline3.png\"\/>\n                        <jats:tex-math>$\\mathcal{A}$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -algebras are, and a handler is interpreted as an\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0956796824000066_inline4.png\"\/>\n                        <jats:tex-math>$\\mathcal{A}$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -homomorphisms between\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0956796824000066_inline5.png\"\/>\n                        <jats:tex-math>$\\mathcal{A}$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -algebras.\n                  <\/jats:p>\n                  <jats:p>\n                    The syntax and operational semantics are derived from the observations on\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0956796824000066_inline6.png\"\/>\n                        <jats:tex-math>$\\mathcal{A}$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -algebras. We prove the soundness and adequacy theorem of the operational semantics for the denotational semantics.\n                  <\/jats:p>","DOI":"10.1017\/s0956796824000066","type":"journal-article","created":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T03:47:08Z","timestamp":1727927228000},"update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":2,"title":["Algebraic effects and handlers for arrows"],"prefix":"10.46298","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3409-6963","authenticated-orcid":false,"given":"TAKAHIRO","family":"SANADA","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2024,10,3]]},"reference":[{"key":"S0956796824000066_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680999027X"},{"key":"S0956796824000066_ref19","volume-title":"London Mathematical Society Lecture Note Series","author":"Loregian","year":"2021"},{"key":"S0956796824000066_ref8","volume-title":"Encyclopedia of Mathematics and its Applications","author":"Borceux","year":"1994"},{"key":"S0956796824000066_ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(72)90019-9"},{"key":"S0956796824000066_ref23","unstructured":"nLab. (2021) Algebra for a profunctor. nLab, Retrieved on November 7, 2023, from https:\/\/ncatlab.org\/nlab\/show\/algebra+for+a+profunctor."},{"key":"S0956796824000066_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.07.012"},{"key":"S0956796824000066_ref7","unstructured":"B\u00e9nabou, J. (2000) Distributors at work. Lecture notes by Thomas Streicher, https:\/\/www2.mathematik.tu-darmstadt.de\/~streicher\/FIBR\/DiWo.pdf."},{"key":"S0956796824000066_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.04.012"},{"key":"S0956796824000066_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2633628.2633636"},{"key":"S0956796824000066_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"S0956796824000066_ref15","volume-title":"Cambridge Studies in Advanced Mathematics","author":"Leinster","year":"2014"},{"key":"S0956796824000066_ref26","article-title":"Handling algebraic effects","volume":"9","author":"Plotkin","year":"2013","journal-title":"Logical Methods Comput. Sci."},{"key":"S0956796824000066_ref29","doi-asserted-by":"publisher","DOI":"10.46298\/entics.10491"},{"key":"S0956796824000066_ref6","first-page":"1","volume-title":"Algebra and Coalgebra in Computer Science","author":"Bauer","year":"2013"},{"key":"S0956796824000066_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/11546382_2"},{"key":"S0956796824000066_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.02.018"},{"key":"S0956796824000066_ref1","volume-title":"London Mathematical Society Lecture Note Series","author":"Adamek","year":"1994"},{"key":"S0956796824000066_ref24","doi-asserted-by":"publisher","DOI":"10.1145\/507635.507664"},{"key":"S0956796824000066_ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796820000106"},{"key":"S0956796824000066_ref31","unstructured":"Uustalu, T. (2010) Strong relative monads. In Short Contribution in International Workshop on Coalgebraic Methods in Computer Science 2010."},{"key":"S0956796824000066_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.02.014"},{"key":"S0956796824000066_ref32","first-page":"135","article-title":"Proarrows II","volume":"26","author":"Wood","year":"1985","journal-title":"Cahiers de Topologie et G\u00e9om\u00e9trie Diff\u00e9rentielle Cat\u00e9goriques"},{"key":"S0956796824000066_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1863597.1863607"},{"key":"S0956796824000066_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00023-4"},{"key":"S0956796824000066_ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1989.39155"},{"key":"S0956796824000066_ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007308"},{"key":"S0956796824000066_ref33","unstructured":"Yallop, J. (2010) Abstraction for Web Programming. PhD thesis. University of Edinburgh."},{"key":"S0956796824000066_ref9","unstructured":"Fujii, S. (2021) Introduction to profunctors. Available on YouTube, https:\/\/www.youtube.com\/playlist?list=PLOtyxrAiMd3BvBc0XSU6JB6rKmrmhgDNG."},{"key":"S0956796824000066_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80970-8"},{"key":"S0956796824000066_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12032-9_21"},{"key":"S0956796824000066_ref20","volume-title":"Graduate Texts in Mathematics","volume":"5","author":"Mac Lane","year":"1971"},{"key":"S0956796824000066_ref27","first-page":"1","volume-title":"Foundations of Software Science and Computation Structures","author":"Plotkin","year":"2001"},{"key":"S0956796824000066_ref14","volume-title":"Cambridge","author":"Kelly","year":"1982"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796824000066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:17:56Z","timestamp":1776889076000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796824000066\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":33,"alternative-id":["S0956796824000066"],"URL":"https:\/\/doi.org\/10.1017\/s0956796824000066","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"e8"}}