A refinement of strong sequentiality for term rewriting with constructors
Information and Computation
Implementing term rewrite languages in DACTL
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From Term Rewriting to Generalised Interaction Nets
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
in2: A Graphical Interpreter for Interaction Nets
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Non-deterministic interaction nets
Non-deterministic interaction nets
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Interaction Nets With Nested Pattern Matching
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
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.