Guarded and Unguarded Iteration for Generalized Processes

• Published in: Logical methods in computer science Vol. 15, Issue 3
• Main Authors: Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg
• Format: Journal Article
• Language: English
• Published: Logical Methods in Computer Science e.V 01-01-2019
• Subjects: 03d75, 68q55; computer science - logic in computer science; f.4.1
• ISSN: 1860-5974
• DOI: 10.23638/LMCS-15(3:1)2019

Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding operations. On the other hand, many models of iteration do admit unguarded iteration. Solutions are then no longer unique, and in general not even determined as least or greatest fixpoints, being instead governed by quasi-equational axioms. Monads that support unguarded iteration in this sense are called (complete) Elgot monads. Here, we propose to equip (Kleisli categories of) monads with an abstract notion of guardedness and then require solvability of abstractly guarded recursive equations; examples of such abstractly guarded pre-iterative monads include both iterative monads and Elgot monads, the latter by deeming any recursive definition to be abstractly guarded. Our main result is then that Elgot monads are precisely the iteration-congruent retracts of abstractly guarded iterative monads, the latter being defined as admitting unique solutions of abstractly guarded recursive equations; in other words, models of unguarded iteration come about by quotienting models of guarded iteration.