Infinite trees and completely iterative theories: a coalgebraic view
Open Access
- 7 May 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 300 (1-3) , 1-45
- https://doi.org/10.1016/s0304-3975(02)00728-4
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- From Varieties of Algebras to Covarieties of CoalgebrasElectronic Notes in Theoretical Computer Science, 2001
- Algebras, Coalgebras, Monads and ComonadsElectronic Notes in Theoretical Computer Science, 2001
- A Coalgebraic View of Infinite Trees and IterationElectronic Notes in Theoretical Computer Science, 2001
- On the greatest fixed point of a set functorTheoretical Computer Science, 1995
- Banach's Fixed-Point Theorem as a base for data-type equationsApplied Categorical Structures, 1994
- Terminal coalgebras in well-founded set theoryTheoretical Computer Science, 1993
- Solving reflexive domain equations in a category of complete metric spacesJournal of Computer and System Sciences, 1989
- On the algebraic structure of rooted treesJournal of Computer and System Sciences, 1978
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- A fixpoint theorem for complete categoriesMathematische Zeitschrift, 1968