Abstract
The notion of contextual (or operational) equivalence is fundamental in the theory of programming languages. By setting up a notion of bisimilarity, and showing that it coincides with contextual equivalence, one obtains a simple coinductive proof technique for showing that two programs are equivalent in all contexts. In this paper we apply these (now standard) techniques to interactions nets, a graphical programming language characterized by local reduction. This work generalizes previous studies of operational equivalence in typed interaction nets since it can be applied to untyped systems, thus all systems of interaction nets are captured.
| Original language | English |
|---|---|
| Pages (from-to) | 157-181 |
| Number of pages | 25 |
| Journal | Theoretical Computer Science |
| Volume | 297 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 1 Jan 2003 |
| Event | Latin American Theoretical Informatics - Punta del Este, Uruguay Duration: 10 Apr 2000 → 14 Apr 2000 |
Keywords
- Bisimulation equivalence
- Interaction nets
- Operational semantics
Fingerprint
Dive into the research topics of 'Operational equivalence for interaction nets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver