License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2011.496
URN: urn:nbn:de:0030-drops-32529
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3252/
Schwencke, Daniel
A Category Theoretic View of Nondeterministic Recursive Program Schemes
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.
BibTeX - Entry
@InProceedings{schwencke:LIPIcs:2011:3252,
author = {Daniel Schwencke},
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 = {Marc Bezem},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3252},
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}
}
Keywords: |
|
recursive program scheme, nondeterminism, powerset monad, distributive law, final coalgebra |
Collection: |
|
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL |
Issue Date: |
|
2011 |
Date of publication: |
|
31.08.2011 |