The coinductive resumption monad

DOI10.1016/j.entcs.2014.10.015zbMath1337.68189OpenAlexW1996151507WikidataQ113317839 ScholiaQ113317839MaRDI QIDQ283770

Jeremy Gibbons, Maciej Piróg

Publication date: 13 May 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2014.10.015

zbMATH Keywords

coalgebracompletely iterative monadsresumptions

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) 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)

Related Items (11)

Unnamed Item ⋮ CryptHOL: game-based proofs in higher-order logic ⋮ Unnamed Item ⋮ Unguarded recursion on coinductive resumptions ⋮ Unifying Guarded and Unguarded Iteration ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ Temporal refinements for guarded recursive types ⋮ Flag-based big-step semantics ⋮ Effect polymorphism in higher-order logic (proof pearl) ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monads for behaviour
• Notions of computation and monads
• The category-theoretic solution of recursive program schemes
• On the algebraic structure of rooted trees
• Infinite trees and completely iterative theories: A coalgebraic view
• Completely iterative algebras and completely iterative monads
• Combining effects: sum and tensor
• Trampolined style
• On Rational Monads and Free Iterative Theories
• Fibrational Induction Meets Effects
• 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
• A Powerdomain Construction
• Free iterative theories: a coalgebraic view
• Generalizing Substitution
• Coproducts of Ideal Monads
• Algebras, Coalgebras, Monads and Comonads
• A poor man's concurrency monad
• A category-theoretic account of program modules
• Inductive reasoning about effectful data types
• General Recursion via Coinductive Types
• Elgot Algebras
• Parametric corecursion
• Retracing some paths in process algebra

This page was built for publication: The coinductive resumption monad