Modular Bialgebraic Semantics and Algebraic Laws

The ability to independently describe operational rules is indispensable for a modular description of programming languages. This paper introduces a format for open-ended rules and proves that conservatively adding new rules results in well-behaved translations between the models of the operational semantics. Silent transitions in our operational model are truly unobservable, which enables one to prove the validity of algebraic laws between programs. We also show that algebraic laws are preserved by extensions of the language and that they are substitutive. The work presented in this paper is developed within the framework of bialgebraic semantics.

[1]  John Power,et al.  Category theory for operational semantics , 2004, Theor. Comput. Sci..

[2]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[3]  Hiroshi Watanabe,et al.  Well-behaved Translations between Structural Operational Semantics , 2002, CMCS.

[4]  Peter D. Mosses.  Component-based semantics , 2009, SAVCBS '09.

[5]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[6]  Bartek Klin,et al.  Bialgebras for structural operational semantics: An introduction , 2011, Theor. Comput. Sci..

[7]  F. Bartels,et al.  On Generalised Coinduction and Probabilistic Specification Formats , 2004 .

[8]  Peter D. Mosses,et al.  Modular structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[9]  Tarmo Uustalu,et al.  A Hoare logic for the coinductive trace-based big-step semantics of While , 2010, Log. Methods Comput. Sci..

[10]  Arend Rensink,et al.  Bisimilarity of open terms , 1999, EXPRESS.

[11]  Thomas Sudkamp.  Languages and Machines: An Introduction to the Theory of Computer Science , 2005 .

[12]  Mohammad Reza Mousavi,et al.  Robustness of Equations Under Operational Extensions , 2010, EXPRESS.

[13]  Chet Langin,et al.  Languages and Machines: An Introduction to the Theory of Computer Science , 2007 .

[14]  Jurriaan Rot,et al.  Presenting Distributive Laws , 2013, CALCO.

[15]  Graham Hutton,et al.  Modularity and Implementation of Mathematical Operational Semantics , 2011, Electron. Notes Theor. Comput. Sci..

[16]  Sjaak Smetsers,et al.  GSOS Formalized in Coq , 2013, 2013 International Symposium on Theoretical Aspects of Software Engineering.

[17]  Bartek Klin.  Adding recursive constructs to bialgebraic semantics , 2004, J. Log. Algebraic Methods Program..

[18]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[19]  Peter D. Mosses,et al.  Modular Bisimulation Theory for Computations and Values , 2013, FoSSaCS.

[20]  John Power,et al.  Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads , 2000, CMCS.

[21]  Helle Hvid Hansen,et al.  Pointwise extensions of GSOS-defined operations , 2011, Math. Struct. Comput. Sci..