Jiri Adamek ; Stefan Milius ; Jiri Velebil - Elgot Algebras

lmcs:2235 - Logical Methods in Computer Science, November 8, 2006, Volume 2, Issue 5 - https://doi.org/10.2168/LMCS-2(5:4)2006
Elgot Algebras

Authors: Jiri Adamek ; Stefan Milius ; Jiri Velebil

Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories instead, i.e., theories in which abstract recursive specifications are required to have unique solutions. Later Bloom and Esik studied iteration theories and iteration algebras in which a specified solution has to obey certain axioms. We propose so-called Elgot algebras as a convenient structure for semantics in the present paper. An Elgot algebra is an algebra with a specified solution for every system of flat recursive equations. That specification satisfies two simple and well motivated axioms: functoriality (stating that solutions are stable under renaming of recursion variables) and compositionality (stating how to perform simultaneous recursion). These two axioms stem canonically from Elgot's iterative theories: We prove that the category of Elgot algebras is the Eilenberg-Moore category of the monad given by a free iterative theory.

Volume: Volume 2, Issue 5
Published on: November 8, 2006
Submitted on: November 7, 2006
Keywords: Computer Science - Logic in Computer Science,Mathematics - Category Theory,F.3.2


Consultation statistics

This page has been seen 318 times.
This article's PDF has been downloaded 141 times.