Abstract
We propose a conservative extension of interaction nets which offers enriched pattern-matching facilities. The extension is conservative in the sense that it can be implemented inside standard interaction nets, and thus can be seen as a system of macros. Consequently, we are guaranteed to keep all the good properties of interaction nets, in particular strong confluence. We see this extension as a crucial step towards using interaction nets as a programming language, which remains a relatively unexplored area. One significant feature of the extension presented here is that, in contrast to other extensions presented previously, we essentially follow the syntax and spirit of interaction nets, and moreover the extension lives at the same level.
| Original language | English |
|---|---|
| Pages (from-to) | 153-169 |
| Number of pages | 17 |
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 127 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 27 May 2005 |
| Externally published | Yes |
| Event | Proceedings of the 2nd International Workshop on Term Graph Rewriting - Duration: 2 Oct 2004 → 2 Oct 2004 |
Keywords
- Interaction nets
- Macro systems
- Programming languages
Fingerprint
Dive into the research topics of 'Macros for interaction nets: A conservative extension of interaction nets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver