The coinductive resumption monad
<p>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 equip...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2014
|
| Subjects: |
| _version_ | 1826303282351439872 |
|---|---|
| author | Piróg, M Gibbons, J |
| author_facet | Piróg, M Gibbons, J |
| author_sort | Piróg, M |
| collection | OXFORD |
| description | <p>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 <em>et al</em>.'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.</p> |
| first_indexed | 2024-03-07T06:00:17Z |
| format | Journal article |
| id | oxford-uuid:ebf47d38-a9a1-4e47-a87b-9d0a98b4f206 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T06:00:17Z |
| publishDate | 2014 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:ebf47d38-a9a1-4e47-a87b-9d0a98b4f2062022-03-27T11:13:45ZThe coinductive resumption monadJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:ebf47d38-a9a1-4e47-a87b-9d0a98b4f206Computer science (mathematics)EnglishOxford University Research Archive - ValetElsevier2014Piróg, MGibbons, J<p>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 <em>et al</em>.'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.</p> |
| spellingShingle | Computer science (mathematics) Piróg, M Gibbons, J The coinductive resumption monad |
| title | The coinductive resumption monad |
| title_full | The coinductive resumption monad |
| title_fullStr | The coinductive resumption monad |
| title_full_unstemmed | The coinductive resumption monad |
| title_short | The coinductive resumption monad |
| title_sort | coinductive resumption monad |
| topic | Computer science (mathematics) |
| work_keys_str_mv | AT pirogm thecoinductiveresumptionmonad AT gibbonsj thecoinductiveresumptionmonad AT pirogm coinductiveresumptionmonad AT gibbonsj coinductiveresumptionmonad |