Adding recursive constructs to bialgebraic semantics

Abstract This paper aims at fitting a general class of recursive equations into the framework of `well-behaved' structural operational semantics, formalized as bialgebraic semantics by Turi and Plotkin. Rather than interpreting recursive constructs by means of operational rules, separate recursive equations are added to semantic descriptions of languages. The equations, together with the remaining rules, are then interpreted in a suitable category and merged by means of certain fixpoint constructions. For a class of recursive equations called regular unfolding rules , this construction yields distributive laws as analyzed by Turi and Plotkin. This means that regular unfolding rules can be merged seamlessly with abstract operational rules.

[1]  Jan A. Bergstra,et al.  Process Algebra with Recursive Operations , 2001, Handbook of Process Algebra.

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

[3]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[4]  Gordon D. Plotkin,et al.  Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

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

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

[7]  Jan J. M. M. Rutten,et al.  A note on coinduction and weak bisimilarity for while programs , 1998, RAIRO Theor. Informatics Appl..

[8]  Bartek Klin,et al.  Syntactic formats for free: An abstract approach to process equivalence , 2003 .

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

[10]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[11]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[12]  Dragan Masulovic,et al.  Towards Weak Bisimulation For Coalgebras , 2002, Electron. Notes Theor. Comput. Sci..

[13]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[14]  Peter Aczel,et al.  A Coalgebraic View of Infinite Trees and Iteration , 2001, CMCS.

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

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

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

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

[19]  S. Lane.  Categories for the Working Mathematician , 1971 .