Modularity of Behaviours for Mathematical Operational Semantics
Kick, M. and Power, J., 2004. Modularity of Behaviours for Mathematical Operational Semantics. Electronic Notes in Theoretical Computer Science, 106, pp. 185-200.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
Some years ago, Turi and Plotkin gave a precise mathematical formulation of a notion of previous termstructuralnext term operational semantics: their formulation is equivalent to a distributive law of the free monad on a signature over the cofree copointed endofunctor on a previous termbehaviournext term endofunctor. From such a distributive law, one can readily induce a distributive law of the monad over the cofree comonad on the previous termbehaviournext term endofunctor, and much of their analysis can be carried out in the latter terms, adding a little more generality that proves to be vital here. Here, largely at the latter level of generality, we investigate the situation in which one has two sorts of previous termbehavioursnext term, with operational semantics possibly interacting with each other. Our leading examples are given by combining action and timing, with a modular account of the operational semantics for the combination induced by that of each of the two components. Our study necessitates investigation and new results about products of comonads and liftings of monads to categories of coalgebras for the product of comonads, providing constructions with which one can readily calculate.
|Creators||Kick, M.and Power, J.|
|Departments||Faculty of Science > Computer Science|
Actions (login required)