The coinductive resumption monad
From MaRDI portal
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 1670486 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 3495581 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 910713 (Why is no real title available?)
- scientific article; zbMATH DE number 3296291 (Why is no real title available?)
- A Powerdomain Construction
- A category-theoretic account of program modules
- A coinductive calculus for asynchronous side-effecting processes
- A poor man's concurrency monad
- Algebras, coalgebras, monads and comonads
- Combining effects: sum and tensor
- Completely iterative algebras and completely iterative monads
- Coproducts of Ideal Monads
- Elgot Algebras
- Fibrational induction meets effects
- Free iterative theories: a coalgebraic view
- General Recursion via Coinductive Types
- Generalizing Substitution
- Inductive reasoning about effectful data types
- Infinite trees and completely iterative theories: A coalgebraic view
- Monads for behaviour
- Monads need not be endofunctors
- Notions of computation and monads
- On rational monads and free iterative theories
- On the algebraic structure of rooted trees
- Parametric corecursion
- Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: an exercise in mixed induction-coinduction
- Retracing some paths in process algebra
- Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell
- The Essence of Multitasking
- The category-theoretic solution of recursive program schemes
- Traces for coalgebraic components
- Tracing monadic computations and representing effects
- Trampolined style
- Update monads: cointerpreting directed containers
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
- scientific article; zbMATH DE number 6864542 (Why is no real title available?)
- scientific article; zbMATH DE number 7080198 (Why is no real title available?)
- Effect polymorphism in higher-order logic (proof pearl)
- Flag-based big-step semantics
- The Essence of Multitasking
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)
