A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Category Theoretic View of Nondeterministic Recursive Program Schemes
2011
Annual Conference for Computer Science Logic
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
doi:10.4230/lipics.csl.2011.496
dblp:conf/csl/Schwencke11
fatcat:eemeg2qyybahzj5p2cx2uebusu