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 language | English |
|---|---|
| Pages (from-to) | 169-189 |
| Number of pages | 21 |
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 156 |
| Issue number | 1 SPEC. ISS. |
| DOIs | |
| Publication status | Published - 15 May 2006 |
| Externally published | Yes |
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver