The coinductive resumption monad
DOI10.1016/J.ENTCS.2014.10.015zbMATH Open1337.68189OpenAlexW1996151507WikidataQ113317839 ScholiaQ113317839MaRDI QIDQ283770FDOQ283770
Authors: Maciej Piróg, Jeremy Gibbons 
Publication date: 13 May 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2014.10.015
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Infinite trees and completely iterative theories: A coalgebraic view
- Completely iterative algebras and completely iterative monads
- Combining effects: sum and tensor
- Monads for behaviour
- Title not available (Why is that?)
- On rational monads and free iterative theories
- Fibrational induction meets effects
- Free iterative theories: a coalgebraic view
- Coproducts of Ideal Monads
- Inductive reasoning about effectful data types
- General Recursion via Coinductive Types
- Elgot Algebras
- Notions of computation and monads
- The category-theoretic solution of recursive program schemes
- On the algebraic structure of rooted trees
- Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell
- Trampolined style
- Update monads: cointerpreting directed containers
- Traces for coalgebraic components
- A coinductive calculus for asynchronous side-effecting processes
- Monads need not be endofunctors
- The Essence of Multitasking
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Powerdomain Construction
- Generalizing Substitution
- Title not available (Why is that?)
- Algebras, coalgebras, monads and comonads
- A poor man's concurrency monad
- Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: an exercise in mixed induction-coinduction
- A category-theoretic account of program modules
- Title not available (Why is that?)
- Tracing monadic computations and representing effects
- Parametric corecursion
- Retracing some paths in process algebra
Cited In (15)
- A coinductive calculus for asynchronous side-effecting processes
- Unguarded recursion on coinductive resumptions
- Unguarded recursion on coinductive resumptions
- Complete Elgot monads and coalgebraic resumptions
- Temporal refinements for guarded recursive types
- A coinductive calculus for asynchronous side-effecting processes
- Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
- Unifying guarded and unguarded iteration
- CryptHOL: game-based proofs in higher-order logic
- Eilenberg-Moore monoids and backtracking monad transformers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effect polymorphism in higher-order logic (proof pearl)
- The Essence of Multitasking
- Flag-based big-step semantics
This page was built for publication: The coinductive resumption monad
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283770)
