Journal article
The coinductive resumption monad
- Abstract:
-
Resumptions appear in many forms as a convenient abstraction, such as in semantics of concurrency and as a programming pattern. In this paper we introduce generalised resumptions in a category-theoretic, coalgebraic context and show their basic properties: they form a monad, they come equipped with a corecursion scheme in the sense of Adámek et al.'s notion of completely iterative monads (cims), and they enjoy a certain universal property, which specialises to the coproduct with a free cim in the category of cims.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 241.5KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.entcs.2014.10.015
Authors
- Publisher:
- Elsevier
- Journal:
- Electronic Notes in Theoretical Computer Science More from this journal
- Volume:
- 308
- Pages:
- 273-288
- Publication date:
- 2014-10-01
- Edition:
- Publisher's version
- DOI:
- ISSN:
-
1571-0661
- Language:
-
English
- Keywords:
- Subjects:
- UUID:
-
uuid:ebf47d38-a9a1-4e47-a87b-9d0a98b4f206
- Local pid:
-
ora:9794
- Deposit date:
-
2015-01-23
- ARK identifier:
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2014
- Notes:
- © 2014 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
If you are the owner of this record, you can report an update to it here: Report update to this record