Infinite trees and completely iterative theories: a coalgebraic view

  • Authors:

  • Peter Aczel;Jirí Adámek;Stefan Milius;Jirí Velebil

  • Affiliations:

  • Department of Mathematics and Computer Science, Manchester University, UK;Institute of Theoretical Computer Science, Technical University, Braunschweig, Germany;Institute of Theoretical Computer Science, Technical University, Braunschweig, Germany;Institute of Theoretical Computer Science, Technical University, Braunschweig, Germany

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 5.23

Visualization

Abstract

Infinite trees form a free completely iterative theory over any given signature--this fact, proved by Elgot, Bloom and Tindell, turns out to be a special case of a much more general categorical result exhibited in the present paper. We prove that whenever an endofunctor H of a category has final coalgebras for all functors H(-) + X, then those coalgebras, TX, form a monad. This monad is completely iterative, i.e., every guarded system of recursive equations has a unique solution. And it is a free completely iterative monad on H. The special case of polynomial endofunctors of the category Set is the above mentioned theory, or monad, of infinite trees.This procedure can be generalized to monoidal categories satisfying a mild side condition: if, for an object H, the endofunctor H ⊗ _ + I has a final coalgebra, T, then T is a monoid. This specializes to the above case for the monoidal category of all endofunctors.