Iteration theories: the equational logic of iterative processes
Iteration theories: the equational logic of iterative processes
On the greatest fixed point of a set functor
Theoretical Computer Science
Theoretical Computer Science
Automata and Algebras in Categories
Automata and Algebras in Categories
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Infinite trees and completely iterative theories: a coalgebraic view
Theoretical Computer Science
A categorical generalization of Scott domains
Mathematical Structures in Computer Science
Explicit substitutions and higher-order syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Nordic Journal of Computing
Completely iterative algebras and completely iterative monads
Information and Computation
Monads of coalgebras: rational terms and term graphs
Mathematical Structures in Computer Science
Recursive coalgebras from comonads
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Explicit substitutions and higher-order syntax
Higher-Order and Symbolic Computation
Terminal coalgebras and free iterative theories
Information and Computation
Mathematical Structures in Computer Science
The category-theoretic solution of recursive program schemes
Theoretical Computer Science - Algebra and coalgebra in computer science
Algebras with parametrized iterativity
Theoretical Computer Science
A Mezei-Wright theorem for categorical algebras
Theoretical Computer Science
From Iterative Algebras to Iterative Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Recursive Coalgebras from Comonads
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Completely iterative algebras and completely iterative monads
Information and Computation
Recursive coalgebras from comonads
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
The category theoretic solution of recursive program schemes
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Every finitary endofunctor of $\Set$ is proved to generate a free iterative theory in the sense of Elgot. This work is based on coalgebras, specifically on parametric corecursion, and the proof is presented for categories more general than just $\Set$.