Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.contributor.authorTuri, Daniele
dc.coverage.spatial12en
dc.date.accessioned2003-11-05T17:48:47Z
dc.date.available2003-11-05T17:48:47Z
dc.date.issued2003-11-05T17:48:47Z
dc.identifier.urihttp://hdl.handle.net/1842/215
dc.description.abstractWe 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.extent265150 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleTowards a Mathematical Operational Semanticsen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record