{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T10:37:58Z","timestamp":1791283078589,"version":"4.1.0"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T00:00:00Z","timestamp":1387238400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Algebraic effects are computational effects that can be represented by an\nequational theory whose operations produce the effects at hand. The free model\nof this theory induces the expected computational monad for the corresponding\neffect. Algebraic effects include exceptions, state, nondeterminism,\ninteractive input\/output, and time, and their combinations. Exception handling,\nhowever, has so far received no algebraic treatment. We present such a\ntreatment, in which each handler yields a model of the theory for exceptions,\nand each handling construct yields the homomorphism induced by the universal\nproperty of the free model. We further generalise exception handlers to\narbitrary algebraic effects. The resulting programming construct includes many\npreviously unrelated examples from both theory and practice, including\nrelabelling and restriction in Milner's CCS, timeout, rollback, and stream\nredirection.<\/jats:p>","DOI":"10.2168\/lmcs-9(4:23)2013","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T05:37:51Z","timestamp":1405402671000},"source":"Crossref","is-referenced-by-count":114,"title":["Handling Algebraic Effects"],"prefix":"10.46298","volume":"Volume 9, Issue 4","author":[{"given":"Gordon D","family":"Plotkin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7755-2303","authenticated-orcid":false,"given":"Matija","family":"Pretnar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2013,12,17]]},"reference":[{"key":"690:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/705\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/705\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T15:54:12Z","timestamp":1681228452000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,17]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(4:23)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1312.1399","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1312.1399","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,17]]},"article-number":"705"}}