hh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • 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 (engelsk)Inngår i: Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII) / [ed] Ulrich Berger & Michael Mislove, Amsterdam: Elsevier, 2012, s. 103-116Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
Amsterdam: Elsevier, 2012. s. 103-116
Serie
Electronic Notes in Theoretical Computer Science, ISSN 1571-0661 ; 286
Emneord [en]
SOS, Nominal SOS, Nominal calculi, λ-calculus, π-calculus
HSV kategori
Identifikatorer
URN: urn:nbn:se:hh:diva-20325DOI: 10.1016/j.entcs.2012.08.008Scopus ID: 2-s2.0-84879218077OAI: oai:DiVA.org:hh-20325DiVA, id: diva2:583411
Konferanse
The 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2012), Bath, United Kingdom, 6-9 June, 2012
Tilgjengelig fra: 2013-01-08 Laget: 2013-01-08 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Mousavi, Mohammad RezaReniers, Michel A.

Søk i DiVA

Av forfatter/redaktør
Mousavi, Mohammad RezaReniers, Michel A.

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 142 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf