Abstract
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra in a common framework. Our approach is based on cartesian categories endowed with commutative strong monads to handle nondeterminism.
BibTeX - Entry
@InProceedings{kozen_et_al:LIPIcs:2013:4211,
author = {Dexter Kozen and Konstantinos Mamouras},
title = {{Kleene Algebra with Products and Iteration Theories}},
booktitle = {Computer Science Logic 2013 (CSL 2013)},
pages = {415--431},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-60-6},
ISSN = {1868-8969},
year = {2013},
volume = {23},
editor = {Simona Ronchi Della Rocca},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4211},
URN = {urn:nbn:de:0030-drops-42111},
doi = {10.4230/LIPIcs.CSL.2013.415},
annote = {Keywords: Kleene algebra, typed Kleene algebra, iteration theories}
}
Keywords: |
|
Kleene algebra, typed Kleene algebra, iteration theories |
Collection: |
|
Computer Science Logic 2013 (CSL 2013) |
Issue Date: |
|
2013 |
Date of publication: |
|
02.09.2013 |