Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
From MaRDI portal
Publication:5875354
DOI10.4230/LIPIcs.CALCO.2019.13OpenAlexW2981978939MaRDI QIDQ5875354
Paul Blain Levy, Sergei S. Goncharov
Publication date: 3 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11441/pdf/LIPIcs-CALCO-2019-13.pdf/
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monads for behaviour
- The coinductive resumption monad
- Notions of computation and monads
- Combining algebraic effects with continuations
- Guarded traced categories
- Complete Elgot monads and coalgebraic resumptions
- Completely iterative algebras and completely iterative monads
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
- Combining effects: sum and tensor
- Unifying Guarded and Unguarded Iteration
- Unbounded Non-determinism in CSP
- Generalizing Substitution
- General Recursion via Coinductive Types
This page was built for publication: Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
