A Coalgebraic View of Infinite Trees and Iteration
From MaRDI portal
Publication:4917030
DOI10.1016/S1571-0661(04)80900-9zbMath1260.68235OpenAlexW2080757272MaRDI QIDQ4917030
Jiří Velebil, Peter Aczel, Jiří Adámek
Publication date: 26 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80900-9
Abstract data types; algebraic specification (68Q65) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)
Related Items (17)
Adding recursive constructs to bialgebraic semantics ⋮ μ-Bicomplete Categories and Parity Games ⋮ Recursive Program Schemes and Context-Free Monads ⋮ The category-theoretic solution of recursive program schemes ⋮ Equational properties of iterative monads ⋮ Infinite trees and completely iterative theories: A coalgebraic view ⋮ On second-order iterative monads ⋮ From Grammars and Automata to Algebras and Coalgebras ⋮ Unnamed Item ⋮ Algebras, Coalgebras, Monads and Comonads ⋮ Distributive laws for the coinductive solution of recursive equations ⋮ Solving Algebraic Equations Using Coalgebra ⋮ Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors ⋮ Coalgebraic Monads ⋮ From Parity Games to Circular Proofs ⋮ On Rational Monads and Free Iterative Theories ⋮ On Iteratable Endofunctors
Cites Work
- On the greatest fixed point of a set functor
- Solving reflexive domain equations in a category of complete metric spaces
- Unique fixed points vs. least fixed points
- A completeness theorem for Kleene algebras and the algebra of regular events
- Terminal coalgebras in well-founded set theory
- A fixpoint theorem for complete categories
- The Category-Theoretic Solution of Recursive Domain Equations
- Initial Algebra Semantics and Continuous Algebras
- Parametric corecursion
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Coalgebraic View of Infinite Trees and Iteration