Skip to main navigation Skip to search Skip to main content

A Congruence Format for Name-passing Calculi

  • INRIA-Futurs and Xyleme

Research output: Contribution to journalArticlepeer-review

Abstract

We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of the difficulties specific to name-binding and make them easier to handle in proofs. The contribution of this paper is the presentation of a format that ensures that open bisimilarity is a congruence for calculi specified within this framework, extending the well-known tyft/tyxt format to the case of name-binding and name-passing. We apply this result to the π-calculus in both its late and early semantics.

Original languageEnglish
Pages (from-to)169-189
Number of pages21
JournalElectronic Notes in Theoretical Computer Science
Volume156
Issue number1 SPEC. ISS.
DOIs
Publication statusPublished - 15 May 2006
Externally publishedYes

Keywords

  • Structural operational semantics
  • name-binding
  • name-mobility
  • open bisimulation
  • rule formats

Fingerprint

Dive into the research topics of 'A Congruence Format for Name-passing Calculi'. Together they form a unique fingerprint.

Cite this