Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Lambda calculus with explicit recursion
Information and Computation
Term rewriting and all that
Handbook of graph grammars and computing by graph transformation
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
(Cyclic) Term Graph Rewriting is adequate for Rational Parallel Term Rewriting
(Cyclic) Term Graph Rewriting is adequate for Rational Parallel Term Rewriting
A rewriting calculus for cyclic higher-order term graphs
Mathematical Structures in Computer Science
Towards a Sharing Strategy for the Graph Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
The rewriting calculus as a combinatory reduction system
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
| Hi-index | 0.00 |
The graph rewriting calculus is an extension of the ρ-calculus, handling graph like structures, with explicit sharing and cycles, rather than simple terms. We study a reduction strategy for the graph rewriting calculus which is intended to maintain the sharing in the terms as long as possible. We show that the corresponding reduction relation is adequate w.r.t. the original semantics of the graph rewriting calculus, formalising the intuition that the strategy avoids useless unsharing.