Abstract
We prove the following completeness theorem: If the fixed point operation over a category is defined by initiality, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation.
| Original language | English |
|---|---|
| Pages (from-to) | 61-89 |
| Number of pages | 29 |
| Journal | Theoretical Computer Science |
| Volume | 195 |
| Issue number | 1 |
| Publication status | Published - Mar 20 1998 |
Fingerprint
Keywords
- Algebraically complete categories
- Fixed points
- Iteration theories
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Ésik, Z., & Labella, A. (1998). Equational properties of iteration in algebraically complete categories. Theoretical Computer Science, 195(1), 61-89.