Unifying Guarded and Unguarded Iteration

DOI10.1007/978-3-662-54458-7_30zbMath1486.68040OpenAlexW2612449809MaRDI QIDQ2988389

Lutz Schröder, Christoph Rauch, Maciej Piróg, Sergei S. Goncharov

Publication date: 19 May 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-662-54458-7_30

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 (5)

Unnamed Item ⋮ Unnamed Item ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ A metalanguage for guarded iteration ⋮ Unnamed Item

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
• On the algebraic structure of rooted trees
• Infinite trees and completely iterative theories: A coalgebraic view
• Complete Elgot monads and coalgebraic resumptions
• Completely iterative algebras and completely iterative monads
• Quotienting the Delay Monad by Weak Bisimilarity
• Elgot theories: a new perspective on the equational properties of iteration
• Parameterised notions of computation
• Generalizing Substitution
• Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion
• A Hoare logic for the coinductive trace-based big-step semantics of While
• General Recursion via Coinductive Types
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Unguarded recursion on coinductive resumptions

This page was built for publication: Unifying Guarded and Unguarded Iteration