From Iterative Algebras to Iterative Theories (Extended Abstract)

Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solutions of recursive equations. One of the main results of Elgot and his coauthors is a description of a free iterative theory as the theory of all rational trees. Their algebraic proof of this fact is extremely complicated. In our paper we show that by starting with “iterative algebras”, i. e., algebras admitting a unique solution of all systems of flat recursive equations, a free iterative theory is obtained as the theory of free iterative algebras. The (coalgebraic) proof we present is dramatically simpler than the original algebraic one. And our result is, nevertheless, much more general: we describe a free iterative theory on any finitary endofunctor of every locally presentable category A. This allows us, e. g., to consider iterative algebras over any equationally specified class A of finitary algebras.

[1]  J. Adámek,et al.  Locally Presentable and Accessible Categories: Bibliography , 1994 .

[2]  S. Lane.  Categories for the Working Mathematician , 1971 .

[3]  P. Gabriel,et al.  Lokal α-präsentierbare Kategorien , 1971 .

[4]  Jirí Adámek,et al.  Free iterative theories: a coalgebraic view , 2003, Mathematical Structures in Computer Science.

[5]  C. C. Elgot.  Monadic Computation And Iterative Algebraic Theories , 1982 .

[6]  Peter Aczel,et al.  Infinite trees and completely iterative theories: a coalgebraic view , 2003, Theor. Comput. Sci..

[7]  D. Harrison,et al.  Vicious Circles , 1995 .

[8]  Susanna Ginali,et al.  Regular Trees and the Free Iterative Theory , 1979, J. Comput. Syst. Sci..

[9]  Jirí Adámek.  On a Description of Terminal Coalgebras and Iterative Theories , 2003, CMCS.

[10]  Jerzy Tiuryn.  Unique Fixed Points Vs. Least Fixed Points , 1980, Theor. Comput. Sci..

[11]  J. Lambek.  A fixpoint theorem for complete categories , 1968 .

[12]  B. M. Fulk.  MATH , 1992 .

[13]  Jirí Adámek,et al.  On Rational Monads and Free Iterative Theories , 2002, CTCS.

[14]  Stefan Milius.  On Iteratable Endofunctors , 2002, CTCS.

[15]  Gerhard Osius,et al.  Categorical set theory: A characterization of the category of sets , 1974 .

[16]  Jirí Adámek,et al.  On tree coalgebras and coalgebra presentations , 2004, Theor. Comput. Sci..

[17]  Stephen L. Bloom,et al.  The Existence and Construction of Free Iterative Theories , 1976, J. Comput. Syst. Sci..

[18]  Bruno Courcelle,et al.  Fundamental Properties of Infinite Trees , 1983, Theor. Comput. Sci..

[19]  C. C. Elgot,et al.  On the algebraic structure of rooted trees , 1978 .