Iterative algebras at work

  • Authors:

  • Jiří Adámek;Stefan Milius;Jiří Velebil

  • Affiliations:

  • Institute of Theoretical Computer Science, Technical University, P.O. Box 3329, D-38023 Braunschweig, Germany Email: adamek@iti.cs.tu-bs.de, milius@iti.cs.tu-bs.de;Institute of Theoretical Computer Science, Technical University, P.O. Box 3329, D-38023 Braunschweig, Germany Email: adamek@iti.cs.tu-bs.de, milius@iti.cs.tu-bs.de;Faculty of Electrical Engineering, Technical University, Technická 2, 16627 Prague 6, Czech Republic Email: velebil@math.feld.cvut.cz

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computations as unique 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’, that is, 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. Despite this, our result is much more general: we describe a free iterative theory on any finitary endofunctor of every locally presentable category $\cal{A}$.Reportedly, a blow from the welterweight boxer Norman Selby, also known as Kid McCoy, left one victim proclaiming,‘It's the real McCoy!’.