# Distributive Laws for Monotone Specifications

@article{Rot2017DistributiveLF, title={Distributive Laws for Monotone Specifications}, author={J. Rot}, journal={Acta Informatica}, year={2017}, volume={56}, pages={585-617} }

Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical generalisation of the classical GSOS rule format, as well as its categorical dual, coGSOS. Both formats are well behaved, in the sense that each specification has a unique model on which behavioural equivalence is a congruence. Unfortunately, the combination of the two… Expand

#### Topics from this paper

#### 2 Citations

Up-to Techniques for Branching Bisimilarity

- Computer Science
- SOFSEM
- 2020

It is shown that a powerful proof technique is sound for branching bisimilarity by combining the three techniques of up to union, up to expansion and up to context for Bloom’s BB cool format. Expand

Distributive laws for monotone specifications

- Mathematics, Medicine
- Acta Informatica
- 2019

It is shown that monotone specifications—that disallow negative premises—do induce a canonical distributive law of a monad over a comonad, and therefore a unique, compositional interpretation of coGSOS. Expand

#### References

SHOWING 1-10 OF 36 REFERENCES

Structural congruence for bialgebraic semantics

- Computer Science, Mathematics
- J. Log. Algebraic Methods Program.
- 2016

The operational model of the non-structural assignment rules of an extended specification of structural operational semantics is well-behaved, in the sense that bisimilarity is a congruence and that bisimulation-up-to techniques are sound. Expand

Distributive Laws and Decidable Properties of SOS Specifications

- Mathematics, Computer Science
- EXPRESS/SOS
- 2014

It is proved that this elegant theoretical generalization of distributive laws of monads over comonads has limited practical benefits: it does not translate to any concrete rule format that would be complete for specifications that contain both GSOS and coGSOS rules. Expand

Towards a mathematical operational semantics

- Computer Science
- Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
- 1997

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… Expand

General Structural Operational Semantics through Categorical Logic

- Mathematics, Computer Science
- 2008 23rd Annual IEEE Symposium on Logic in Computer Science
- 2008

This work develops a tyft/tyxt-like rule format for open bisimulation in the pi-calculus and formulate these principles in the general context of categorical logic, which recovers precise results for particular language idioms by interpreting the logic in particular categories. Expand

Combining a monad and a comonad

- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2002

This work gives a systematic treatment of distributivity in terms of a monad and a comonad in a 2-category, giving accounts of the Eilenberg-Moore and Kleisli constructions. Expand

Behavioural differential equations: a coinductive calculus of streams, automata, and power series

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2003

We present a theory of streams (infinite sequences), automata and languages, and formal power series, in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the… Expand

Structural Operational Semantics for Weighted Transition Systems

- Mathematics, Computer Science
- Semantics and Algebraic Specification
- 2009

A general rule format for the SOS specification of weighted systems is obtained via the coalgebraic approach of Turi and Plotkin. Expand

Simulations in coalgebra

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2004

A new approach to simulations is proposed within the theory of coalgebras by taking a notion of order on a functor as primitive, and suitable conditions are identified which ensures that similarity on a final coalgebra forms an (algebraic) dcpo structure. Expand

Universal coalgebra: a theory of systems

- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2000

The three basic notions of universal algebra: algebra, homomorphism of algebras, and congruence, turn out to correspond to: coalgebra, homomorphicism of coalgebrAs, and bisimulation, respectively, which are taken as the basic ingredients of a theory called universal coalgebra. Expand

Bisimulation can't be traced

- Computer Science
- POPL '88
- 1988

This work forms a general notion of Structured Operational Semantics for processes with Guarded recursion (GSOS), and demonstrates that bisimulation does not agree with trace congruence with respect to any set of GSOS-definable contexts. Expand