Distributive laws for monotone specifications
- PMID: 31631892
- PMCID: PMC6790200
- DOI: 10.1007/s00236-019-00333-x
Distributive laws for monotone specifications
Abstract
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.
© The Author(s) 2019.
References
-
- Aceto L, Fokkink W, Verhoef C. Structural operational semantics. In: Bergstra JA, Ponse A, Smolka SA, editors. Handbook of Process Algebra. Amsterdam: Elsevier; 2001. pp. 197–292.
-
- Adámek J, Porst HE. On tree coalgebras and coalgebra presentations. Theor. Comput. Sci. 2004;311(1–3):257–283. doi: 10.1016/S0304-3975(03)00378-5. - DOI
-
- Adámek J, Rosický J. Locally Presentable and Accessible Categories. Cambridge: Cambridge University Press; 1994.
-
- Bartels, F.: On generalised coinduction and probabilistic specification formats. Ph.D. thesis, CWI, Amsterdam (2004)
-
- Bloom B, Istrail S, Meyer A. Bisimulation can’t be traced. J. ACM. 1995;42(1):232–268. doi: 10.1145/200836.200876. - DOI
LinkOut - more resources
Full Text Sources