Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Towards an intermediate language based on graph rewriting
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Conventional and Uniqueness Typing in Graph Rewrite Systems
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Computation with classical sequents
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
This paper presents a term graph rewriting system as an implementation for the X-calculus, a substitution-free language that can be used to describe the behaviour of functional programming languages at a very low level of granularity, and has first been defined in [Stephane Lengrand. Call-by-value, call-by-name, and strong normalization for the classical sequent calculus. In Bernhard Gramlich and Salvador Lucas, editors, Electronic Notes in Theoretical Computer Science, volume 86. Elsevier, 2003; S. van Bakel, S. Lengrand, and P. Lescanne. The language X: circuits, computations and classical logic. Submitted, 2004]. Since the calculus has a notion of binding, in the context of sharing a notion of rebinding is introduced that helps avoid double binding of names.