; y; Department of Computer Science; Laboratory for Foundations of Computer Science
SVM HeaderParse 0.2
; University of Edinburgh, The King's Buildings; Edinburgh EH9 3JZ, Scotland
SVM HeaderParse 0.1
To appear in Proc. LICS'97. 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 both an operational model and a canonical, internally fully abstract denotational model for free; moreover, both models satisfy 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.