Equational properties of iteration in algebraically complete categories

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The main result is 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.

Cite

CITATION STYLE

APA

Ésik, Z., & Labella, A. (1996). Equational properties of iteration in algebraically complete categories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1113, pp. 336–347). Springer Verlag. https://doi.org/10.1007/3-540-61550-4_160

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free