Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-28T21:50:37.634Z Has data issue: false hasContentIssue false

Iterative algebras at work

Published online by Cambridge University Press:  01 November 2006

JIŘÍ ADÁMEK
Affiliation:
Institute of Theoretical Computer Science, Technical University, P.O. Box 3329, D-38023 Braunschweig, Germany Email: [email protected], [email protected]
STEFAN MILIUS
Affiliation:
Institute of Theoretical Computer Science, Technical University, P.O. Box 3329, D-38023 Braunschweig, Germany Email: [email protected], [email protected]
JIŘÍ VELEBIL
Affiliation:
Faculty of Electrical Engineering, Technical University, Technická 2, 16627 Prague 6, Czech Republic Email: [email protected]

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!’.

Type
Paper
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)