by Daniele Turi, Gordon Plotkin
In Proc. 12 th LICS Conf
http://www.dcs.ed.ac.uk/home/gdp/publications/Math_Op_Sem.ps.gz
Add To MetaCart
Abstract:
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.
Citations
|
1064
|
A Structural Approach to Operational Semantics
– Plotkin
- 1981
|
|
565
|
Notions of computation and monads
– Moggi
- 1991
|
|
241
|
An initial algebra approach to the specification, correctness, and implementation of abstract data types
– Goguen, Thatcher, et al.
- 1979
|
|
232
|
Models for concurrency
– Winskel, Nielsen
- 1994
|
|
194
|
Process Algebra
– Baeten, Weijland
- 1990
|
|
185
|
Structured operational semantics and bisimulation as a congruence
– Groote, Vaandrager
- 1992
|
|
156
|
Outline of a mathematical theory of computation
– Scott
- 1970
|
|
151
|
Bisimulation can't be traced
– Bloom, Istrail, et al.
- 1995
|
|
146
|
A final coalgebra theorem
– Aczel, Mendler
- 1988
|
|
102
|
A domain equation for bisimulation
– Abramsky
- 1991
|
|
102
|
Terminal coalgebras in well-founded set theory
– Barr
- 1993
|
|
87
|
Full abstraction for a simple parallel programming language
– Hennessy, Plotkin
- 1979
|
|
76
|
Categorical Logic
– Pitts
- 1997
|
|
58
|
The formal theory of monads
– Street
- 1972
|
|
53
|
Ntyft/ntyxt rules reduce to ntree rules
– Fokkink, Glabbeek
- 1996
|
|
50
|
Initial algebra and final co-algebra semantics for concurrency
– Rutten, Turi
- 1994
|
|
49
|
A Calculus of Communicating Systems, volume 92 of LNCS
– Milner
- 1980
|
|
40
|
Non-well-founded sets. Number 14
– Aczel
- 1988
|
|
40
|
Functorial Operational Semantics and its Denotational Dual
– Turi
- 1996
|
|
35
|
Distributive laws
– Beck
- 1969
|
|
34
|
Bisimulation and open maps
– Joyal, Nielsen, et al.
- 1993
|
|
26
|
A category-theoretic account of program modules
– Moggi
- 1991
|
|
21
|
Processes as terms: non-well-founded models for bisimulation
– Rutten
- 1992
|
|
16
|
The tyft/tyxt format reduces to tree rules
– Fokkink
- 1994
|
|
14
|
Compositionality via cut-elimination: Hennessy-milner logic for an arbitrary GSOS
– Simpson
- 1995
|
|
13
|
Adjoint lifting theorems for categories of algebras
– Johnstone
- 1975
|
|
13
|
Atype-theoretic account of Standard ML
– Harper, Stone
- 1996
|
|
12
|
Final universes of processes
– Aczel
- 1994
|
|
7
|
Categorical modelling of structural operational rules: case studies
– Turi
- 1997
|
|
6
|
Categories for synchrony and asynchrony
– Cockett, Spooner
- 1995
|
