ITERATION ALGEBRAS

DOI10.1142/S0129054192000164zbMath0790.08004OpenAlexW4238533884MaRDI QIDQ5286027

Zoltán Ésik, Stephen L. Bloom

Publication date: 29 June 1993

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054192000164

zbMATH Keywords

coproductfree algebrasfunctorsretractiteration theory\(\omega\)-continuous algebrapreiteration theorysemantics of flowchart algorithmsstrong iteration algebrastheories of partial functionstheories of sequacious functionstheory congruencesvarieties of iteration algebras

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Theories (e.g., algebraic theories), structure, and semantics (18C10) Free algebras (08B20)

Related Items

Non-associative Kleene Algebra and Temporal Logics ⋮ Axiomatizing the equational theory of regular tree languages ⋮ Solving polynomial fixed point equations ⋮ Completeness of Park induction ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?