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 work.
@InProceedings{schwencke:LIPIcs.CSL.2011.496, author = {Schwencke, Daniel}, title = {{A Category Theoretic View of Nondeterministic Recursive Program Schemes}}, booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL}, pages = {496--511}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-32-3}, ISSN = {1868-8969}, year = {2011}, volume = {12}, editor = {Bezem, Marc}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.496}, URN = {urn:nbn:de:0030-drops-32529}, doi = {10.4230/LIPIcs.CSL.2011.496}, annote = {Keywords: recursive program scheme, nondeterminism, powerset monad, distributive law, final coalgebra} }
Feedback for Dagstuhl Publishing