Infinite trees and completely iterative theories: A coalgebraic view

DOI10.1016/S0304-3975(02)00728-4zbMath1028.68077OpenAlexW1998546360MaRDI QIDQ1399957

Jiří Adámek, Jiří Velebil, Peter Aczel, Stefan Milius

Publication date: 30 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00728-4

zbMATH Keywords

coalgebramonoidal categorymonadcompletely iterative theorySolution Theorem

Mathematics Subject Classification ID

Related Items (44)

Monads for behaviour ⋮ The coinductive resumption monad ⋮ Explicit substitutions and higher-order syntax ⋮ Doctrines, modalities and comonads ⋮ Recursive Program Schemes and Context-Free Monads ⋮ Higher-order Algebras and Coalgebras from Parameterized Endofunctors ⋮ The category-theoretic solution of recursive program schemes ⋮ Unnamed Item ⋮ Equational properties of iterative monads ⋮ Base modules for parametrized iterativity ⋮ On second-order iterative monads ⋮ Unnamed Item ⋮ Unguarded recursion on coinductive resumptions ⋮ Unnamed Item ⋮ Unifying Guarded and Unguarded Iteration ⋮ Unnamed Item ⋮ On functors preserving coproducts and algebras with iterativity ⋮ On coalgebra based on classes ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ Corrigendum to: ``The category theoretic solution of recursive program schemes [Theoret. Comput. Sci. 366 (2006) 3-59] ⋮ Iteration and labelled iteration ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ Iterative reflections of monads ⋮ Infinite trace equivalence ⋮ Unnamed Item ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ Coproducts of Ideal Monads ⋮ Substitution in non-wellfounded syntax with variable binding ⋮ Completely iterative algebras and completely iterative monads ⋮ Recursive coalgebras from comonads ⋮ Distributive laws for the coinductive solution of recursive equations ⋮ Terminal coalgebras and free iterative theories ⋮ Unnamed Item ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras ⋮ Initial Algebra Semantics for Cyclic Sharing Structures ⋮ Final coalgebras in accessible categories ⋮ Solving Algebraic Equations Using Coalgebra ⋮ Generalizing Substitution ⋮ Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors ⋮ On Iteratable Endofunctors ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Algebraic presentation of semifree monads ⋮ Comonadic Notions of Computation

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
• On the algebraic structure of rooted trees
• Banach's fixed-point theorem as a base for data-type equations
• Terminal coalgebras in well-founded set theory
• A fixpoint theorem for complete categories
• On Iteratable Endofunctors
• The Category-Theoretic Solution of Recursive Domain Equations
• Accessible Categories: The Foundations of Categorical Model Theory
• Initial Algebra Semantics and Continuous Algebras
• Equational axioms for regular sets
• A Coalgebraic View of Infinite Trees and Iteration
• From Varieties of Algebras to Covarieties of Coalgebras
• Algebras, Coalgebras, Monads and Comonads
• A Perspective View of Discrete Automata and Their Design
• 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: Infinite trees and completely iterative theories: A coalgebraic view