Distributive Laws for Monotone Specifications
Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical generalisation of the classical GSOS rule format, as well as its categor...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2017-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1709.00830v1 |
id |
doaj-6e464080b970403ca2de538c9715af2d |
---|---|
record_format |
Article |
spelling |
doaj-6e464080b970403ca2de538c9715af2d2020-11-25T02:11:02ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802017-08-01255Proc. EXPRESS/SOS 2017839710.4204/EPTCS.255.6:1Distributive Laws for Monotone SpecificationsJurriaan Rot0 Radboud University Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical generalisation of the classical GSOS rule format, as well as its categorical dual, coGSOS. Both formats are well behaved, in the sense that each specification has a unique model on which behavioural equivalence is a congruence. Unfortunately, the combination of the two formats does not feature these desirable properties. We show that monotone specifications - that disallow negative premises - do induce a canonical distributive law of a monad over a comonad, and therefore a unique, compositional interpretation.http://arxiv.org/pdf/1709.00830v1 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jurriaan Rot |
spellingShingle |
Jurriaan Rot Distributive Laws for Monotone Specifications Electronic Proceedings in Theoretical Computer Science |
author_facet |
Jurriaan Rot |
author_sort |
Jurriaan Rot |
title |
Distributive Laws for Monotone Specifications |
title_short |
Distributive Laws for Monotone Specifications |
title_full |
Distributive Laws for Monotone Specifications |
title_fullStr |
Distributive Laws for Monotone Specifications |
title_full_unstemmed |
Distributive Laws for Monotone Specifications |
title_sort |
distributive laws for monotone specifications |
publisher |
Open Publishing Association |
series |
Electronic Proceedings in Theoretical Computer Science |
issn |
2075-2180 |
publishDate |
2017-08-01 |
description |
Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical generalisation of the classical GSOS rule format, as well as its categorical dual, coGSOS. Both formats are well behaved, in the sense that each specification has a unique model on which behavioural equivalence is a congruence. Unfortunately, the combination of the two formats does not feature these desirable properties. We show that monotone specifications - that disallow negative premises - do induce a canonical distributive law of a monad over a comonad, and therefore a unique, compositional interpretation. |
url |
http://arxiv.org/pdf/1709.00830v1 |
work_keys_str_mv |
AT jurriaanrot distributivelawsformonotonespecifications |
_version_ |
1724916756413153280 |