Unguarded recursion on coinductive resumptions

DOI10.1016/j.entcs.2015.12.012zbMath1351.68074OpenAlexW2209316887WikidataQ113317729 ScholiaQ113317729MaRDI QIDQ5971399

Christoph Rauch, Lutz Schröder, Sergei S. Goncharov

Publication date: 16 December 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

coalgebrarecursionresumptionscoinductioncomplete Elgot monad

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (6)

Quotienting the delay monad by weak bisimilarity ⋮ Unnamed Item ⋮ Unifying Guarded and Unguarded Iteration ⋮ Iteration and labelled iteration ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ Unnamed Item

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monads for behaviour
• The coinductive resumption monad
• A coinductive calculus for asynchronous side-effecting processes
• Equational properties of iterative monads
• Notions of computation and monads
• Discrete Lawvere theories and computational effects
• Fixed-point constructions in order-enriched categories
• Infinite trees and completely iterative theories: A coalgebraic view
• Combining effects: sum and tensor
• Strong functors and monoidal monads
• Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
• Elgot theories: a new perspective on the equational properties of iteration
• Handlers of Algebraic Effects
• Introduction to distributive categories
• Generalised coinduction
• Generalizing Substitution
• Semantics for Algebraic Operations
• A note on Coinduction and Weak Bisimilarity for While Programs

This page was built for publication: Unguarded recursion on coinductive resumptions