hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Nominal SOS
Department of Computer Science, Reykjavík University, Reykjavík, Iceland.
Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.ORCID iD: 0000-0002-4869-6794
Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands.ORCID iD: 0000-0002-9283-4074
Computer Science Department, Heriot-Watt University, Edinburgh, United Kingdom.
2012 (English)In: Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII) / [ed] Ulrich Berger & Michael Mislove, Amsterdam: Elsevier, 2012, 103-116 p.Conference paper, Published paper (Refereed)
Abstract [en]

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 π-calculus and Abramsky’s lazy λ-calculus within Nominal SOS. For both calculi we establish the operational correspondence with the original calculi. Moreover, in the context of the π-calculus, we prove that nominal bisimilarity coincides with Sangiorgi’s open bisimilarity and in the context of the λ-calculus we prove that nominal bisimilarity coincides with Abramsky’s applicative bisimilarity. © 2012 Elsevier B.V.

Place, publisher, year, edition, pages
Amsterdam: Elsevier, 2012. 103-116 p.
Series
Electronic Notes in Theoretical Computer Science, ISSN 1571-0661 ; 286
Keyword [en]
SOS, Nominal SOS, Nominal calculi, λ-calculus, π-calculus
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:hh:diva-20325DOI: 10.1016/j.entcs.2012.08.008Scopus ID: 2-s2.0-84879218077OAI: oai:DiVA.org:hh-20325DiVA: diva2:583411
Conference
The 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2012), Bath, United Kingdom, 6-9 June, 2012
Available from: 2013-01-08 Created: 2013-01-08 Last updated: 2015-04-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Mousavi, Mohammad RezaReniers, Michel A.
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 78 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf