Free iterative theories: a coalgebraic view

@article{Admek2003FreeIT,
  title={Free iterative theories: a coalgebraic view},
  author={Jir{\'i} Ad{\'a}mek and Stefan Milius and Jiri Velebil},
  journal={Mathematical Structures in Computer Science},
  year={2003},
  volume={13},
  pages={259 - 320}
}
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$. 
Some Remarks on Finitary and Iterative Monads
TLDR
For every locally finitely presentable category A, finitary Kleisli triples are introduced and it is shown that they bijectively correspond to finitary monads on A.
Terminal coalgebras and free iterative theories
On Iteratable Endofunctors
Coalgebraic Monads
Recursive Coalgebras from Comonads
The category-theoretic solution of recursive program schemes
Kleene Coalgebra – an overview
TLDR
An overview of the motivation and results of the generic framework developed – Kleene Coalgebra – to uniformly derive expression calculi, as well as an historical overview of work on regular expressions and axiomatizations are presented.
Fixed points of functors
...
...

References

SHOWING 1-10 OF 24 REFERENCES
A Coalgebraic View of Infinite Trees and Iteration
Some Remarks on Finitary and Iterative Monads
TLDR
For every locally finitely presentable category A, finitary Kleisli triples are introduced and it is shown that they bijectively correspond to finitary monads on A.
A Categorical Generalization of Scott Domains
  • J. Adámek
  • Mathematics
    Math. Struct. Comput. Sci.
  • 1997
TLDR
It is proved that the category SCC of all Scott-complete categories and all continuous functors is cartesian closed and provides fixed points for a large collection of endofunctors, which can serve as a basis for semantics of computer languages.
Infinite trees and completely iterative theories: a coalgebraic view
On the Greatest Fixed Point of a Set Functor
Automata and Algebras in Categories
Monograph( based very largely upon results original to the Czechoslovakian authors) presents an abstract account of the theory of automata for sophisticated readers presumed to be already conversant
Parametric corecursion
  • L. Moss
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2001
Algebraic theories
We presents the algebraic theories over an arbitrary monoid, main properties and calculus rules. Ordered, rationaly closed and ω-continuous theories on one hand and matrix and complete matrix
Complete axioms for categorical fixed-point operators
  • A. Simpson, G. Plotkin
  • Mathematics
    Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
  • 2000
TLDR
A general completeness theorem for iteration operators is proved, relying on a new, purely syntactic characterisation of the free iteration theory, and it is shown how iteration operators arise in axiomatic domain theory.
...
...