Nominal SOS

  • Authors:

  • Matteo Cimini;Mohamamdreza Mousavi;Michel A. Reniers;Murdoch J. Gabbay

  • Affiliations:

  • Department of Computer Science, Reykjavík University, Reykjavík, Icelan;Department of Computer Science, TU/e, Eindhoven, The Netherlands;Department of Mechanical Engineering, TU/e, Eindhoven, The Netherlands;Computer Science Department, Heriot-Watt University, Edinburgh, United Kingdom

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Plotkin@?s style of Structural Operational Semantics (SOS) has become a de facto standard in giving operational semantics to formalisms and process calculi. In many such formalisms and calculi, the concepts of names, variables and binders are essential ingredients. In this paper, we propose a formal framework for dealing with names in SOS. The framework is based on the Nominal Logic of Gabbay and Pitts and hence is called Nominal SOS. We define nominal bisimilarity, an adaptation of the notion of bisimilarity that is aware of binding. We provide evidence of the expressiveness of the framework by formulating the early @p-calculus and Abramsky@?s lazy @l-calculus within Nominal SOS. For both calculi we establish the operational correspondence with the original calculi. Moreover, in the context of the @p-calculus, we prove that nominal bisimilarity coincides with Sangiorgi@?s open bisimilarity and in the context of the @l-calculus we prove that nominal bisimilarity coincides with Abramsky@?s applicative bisimilarity.