Towards a Mathematical Operational Semantics
dc.contributor.author
Plotkin, Gordon
en
dc.contributor.author
Turi, Daniele
en
dc.coverage.spatial
12
en
dc.date.accessioned
2003-11-05T17:48:47Z
dc.date.available
2003-11-05T17:48:47Z
dc.date.issued
2003-11-05T17:48:47Z
dc.description.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.
en
dc.format.extent
265150 bytes
en
dc.format.mimetype
application/pdf
en
dc.identifier.uri
http://hdl.handle.net/1842/215
dc.language.iso
en
dc.subject
Laboratory for Foundations of Computer Science
en
dc.title
Towards a Mathematical Operational Semantics
en
dc.type
Preprint
en
Files
Original bundle
1 - 1 of 1
- Name:
- Math_Op_Sem.pdf
- Size:
- 258.94 KB
- Format:
- Adobe Portable Document Format
This item appears in the following Collection(s)