Arrow Research search
Back to I&C

I&C 2008

Bases for parametrized iterativity

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

Parametrized iterativity of an algebra means the existence of unique solutions of all finitary recursive systems of equations where recursion is allowed to use only some variables (chosen as a parameter). We show how such algebras can be introduced in an arbitrary category A by employing a base, i. e. , an operation interpreting objects of A as monads on A. For every base we prove that free base algebras and free iterative base algebras exist. The main result is a coalgebraic construction of the latter: all equation morphisms form a diagram whose colimit is proved to be a free iterative base algebra.

Authors

Keywords

  • Iterative algebra
  • Monad
  • Iterative theory
  • Parametrized signature
  • Locally presentable category

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
202727516031685336
v2026.09.13