An algebraic approach to the theory of recursive coroutines

Abstract

A mathematical model for recursive coroutines in introduced. Relationships between Mazurkiewicz algorithms and this model are considered. Some linguistic and computational properties of coroutines are proved. The set of all functions computed by programs with recursive coroutines is proved to contain the set of all functions computed by commonly used recursive programs.