LIPIcs.CSL.2011.496.pdf
- Filesize: 0.52 MB
- 16 pages
Document
A Category Theoretic View of Nondeterministic Recursive Program Schemes
Author
-
Part of:
Volume:
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (CSL 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-08-31
Cite AsGet BibTex
Daniel Schwencke. A Category Theoretic View of Nondeterministic Recursive Program Schemes. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 496-511, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.496
https://doi.org/10.4230/LIPIcs.CSL.2011.496
Abstract
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.
Keywords
- recursive program scheme
- nondeterminism
- powerset monad
- distributive law
- final coalgebra
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads