Equational properties of iterative monads
From MaRDI portal
Publication:618163
DOI10.1016/j.ic.2009.10.006zbMath1234.68271OpenAlexW2094845618MaRDI QIDQ618163
Jiří Velebil, Jiří Adámek, Stefan Milius
Publication date: 14 January 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.10.006
Abstract data types; algebraic specification (68Q65) Categorical semantics of formal languages (18C50)
Related Items (10)
Unnamed Item ⋮ Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure ⋮ Unguarded recursion on coinductive resumptions ⋮ Unifying Guarded and Unguarded Iteration ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) ⋮ Unnamed Item ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the final sequence of a finitary set functor
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- Iterative algebras
- Unique fixed points vs. least fixed points
- Regular trees and the free iterative theory
- Introduction to extensive and distributive categories
- On the algebraic structure of rooted trees
- Recursion and corecursion have the same equational logic
- Infinite trees and completely iterative theories: A coalgebraic view
- Completely iterative algebras and completely iterative monads
- Coequalizers and free triples
- Lokal präsentierbare Kategorien. (Locally presentable categories)
- Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract)
- Iterative algebras at work
- What Are Iteration Theories?
- Iterative reflections of monads
- Equational axioms for regular sets
- A Coalgebraic View of Infinite Trees and Iteration
- Algebras, Coalgebras, Monads and Comonads
- A Perspective View of Discrete Automata and Their Design
- Parametric corecursion
This page was built for publication: Equational properties of iterative monads