Towards a mathematical operational semantics

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 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.

[1]  Jan J. M. M. Rutten.  Processes as Terms: Non-Well-Founded Models for Bisimulation , 1992, Math. Struct. Comput. Sci..

[2]  Alex K. Simpson,et al.  Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[4]  Jan J. M. M. Rutten,et al.  Initial Algebra and Final Coalgebra Semantics for Concurrency , 1993, REX School/Symposium.

[5]  J. Robin B. Cockett,et al.  Categories for synchrony and asynchrony , 1995, MFPS.

[6]  M. Sherman,et al.  A Preliminary Report , 1953 .

[7]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[8]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[9]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[10]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[11]  Wan Fokkink,et al.  Ntyft/Ntyxt Rules Reduce to Ntree Rules , 1996, Inf. Comput..

[12]  D. Turi,et al.  Functional Operational Semantics and its Denotational Dual , 1996 .

[13]  P. T. Johnstone,et al.  Adjoint Lifting Theorems for Categories of Algebras , 1975 .

[14]  Eugenio Moggi,et al.  A category-theoretic account of program modules , 1989, Mathematical Structures in Computer Science.

[15]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[16]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[17]  Wan Fokkink.  The Tyft/Tyxt Format Reduces to Tree Rules , 1994, TACS.

[18]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[19]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[20]  Peter Aczel,et al.  Final Universes of Processes , 1993, MFPS.

[21]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[22]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[23]  Daniele Turi,et al.  Categorical Modelling of Structural Operational Rules: Case Studies , 1997, Category Theory and Computer Science.

[24]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[25]  Robert Harper,et al.  A Type-Theoretic Account of Standard ML 1996 (Version 1). , 1996 .