Towards a mathematical operational semantics (1997)
Cached
Download Links
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. 12 th LICS Conf |
| Citations: | 122 - 9 self |
BibTeX
@INPROCEEDINGS{Turi97towardsa,
author = {Daniele Turi},
title = {Towards a mathematical operational semantics},
booktitle = {In Proc. 12 th LICS Conf},
year = {1997},
pages = {280--291},
publisher = {IEEE, Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transformation of a suitable general form, depending on functorial notions of syntax and behaviour, then one gets the following for free: an operational model satisfying the rules and a canonical, internally fully abstract denotational model which satisfies the operational rules. The theory is based on distributive laws and bialgebras; it specialises to the known classes of well-behaved rules for structural operational semantics, such as GSOS.
