English

Shades of Iteration: from Elgot to Kleene

Logic in Computer Science 2023-06-05 v2 Computation and Language

Abstract

Notions of iteration range from the arguably most general Elgot iteration to a very specific Kleene iteration. The fundamental nature of Elgot iteration has been extensively explored by Bloom and Esik in the form of iteration theories, while Kleene iteration became extremely popular as an integral part of (untyped) formalisms, such as automata theory, regular expressions and Kleene algebra. Here, we establish a formal connection between Elgot iteration and Kleene iteration in the form of Elgot monads and Kleene monads, respectively. We also introduce a novel class of while-monads, which like Kleene monads admit a relatively simple description in algebraic terms. Like Elgot monads, while-monads cover a large variety of models that meaningfully support while-loops, but may fail the Kleene algebra laws, or even fail to support a Kleen iteration operator altogether.

Keywords

Cite

@article{arxiv.2301.06202,
  title  = {Shades of Iteration: from Elgot to Kleene},
  author = {Sergey Goncharov},
  journal= {arXiv preprint arXiv:2301.06202},
  year   = {2023}
}

Comments

Extended version of the accepted one for "Recent Trends in Algebraic Development Techniques - 26th IFIP WG 1.3 International Workshop, WADT 2022"