A Category Theoretic View of Nondeterministic Recursive Program Schemes

Daniel Schwencke
Deterministic recursive program schemes (RPS's) have a clear category theoretic semantics presented by Ghani et al. and by Milius and Moss. Here we extend it to nondeterministic RPS's. We provide a category theoretic notion of guardedness and of solutions. Our main result is a description of the canonical greatest solution for every guarded nondeterministic RPS, thereby giving a category theoretic semantics for nondeterministic RPS's. We show how our notions and results are connected to classical...