Complete Elgot monads and coalgebraic resumptions

DOI10.1016/J.ENTCS.2016.09.036MaRDI QIDQ1744384zbMATH OpenOpenAlexWikidataFDO

Authors Stefan Milius, Christoph Rauch, S. S. Goncharov

Publication date 23 April 2018

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1603.02148

zbMATH Keywords

complete Elgot algebracomplete Elgot monadresumption monaduniform iteration

Mathematics Subject Classification ID

Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Abstract: Monads are extensively used nowadays to abstractly model a wide range of computational effects such as nondeterminism, statefulness, and exceptions. It turns out that equipping a monad with a (uniform) iteration operator satisfying a set of natural axioms allows for modelling iterative computations just as abstractly. The emerging monads are called complete Elgot monads. It has been shown recently that extending complete Elgot monads with free effects (e.g. operations of sending/receiving messages over channels) canonically leads to generalized coalgebraic resumption monads, previously used as semantic domains for non-wellfounded guarded processes. In this paper, we continue the study of the relationship between abstract complete Elgot monads and those that capture coalgebraic resumptions, by comparing the corresponding categories of (Eilenberg-Moore) algebras. To this end we first provide a characterization of the latter category; even more generally, we formulate this characterization in terms of Uustalu's parametrized monads. This is further used for establishing a characterization of complete Elgot monads as precisely those monads whose algebras are coherently equipped with the structure of algebras of coalgebraic resumption monads.

Recommendations

• Unguarded recursion on coinductive resumptions
• On algebras with effectful iteration
• On the behaviour of coalgebras with side effects and algebras with effectful iteration
• The coinductive resumption monad
• Complete iterativity for algebras with effects

Cites work

• A coinductive calculus for asynchronous side-effecting processes
• A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
• Bases for parametrized iterativity
• Combining effects: sum and tensor
• Elgot Algebras
• Elgot theories: a new perspective on the equational properties of iteration
• Equational properties of iterative monads
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• General Recursion via Coinductive Types
• Generalizing Substitution
• scientific article; zbMATH DE number 1705158 (Why is no real title available?)
• scientific article; zbMATH DE number 2185716 (Why is no real title available?)
• scientific article; zbMATH DE number 3512082 (Why is no real title available?)
• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• scientific article; zbMATH DE number 2087441 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Infinite trees and completely iterative theories: A coalgebraic view
• Iterative algebras for a base
• Iterative algebras: how iterative are they?
• Notions of computation and monads
• Traced monoidal categories
• Traced Premonoidal Categories
• Unguarded recursion on coinductive resumptions

Cited in

(9)

• Monads for behaviour
• The coinductive resumption monad
• Kleene monads: handling iteration in a framework of generic effects
• Unifying guarded and unguarded iteration
• Unguarded recursion on coinductive resumptions
• scientific article; zbMATH DE number 7080198 (Why is no real title available?)
• On the behaviour of coalgebras with side effects and algebras with effectful iteration
• Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
• A metalanguage for guarded iteration

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Complete Elgot monads and coalgebraic resumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744384)