Lazy Context Cloning for Non-Deterministic Graph Rewriting

Authors:
Sergio Antoy;Daniel W. Brown;Su-Hui Chiang
Affiliations:
Department of Computer Science, Portland State University, P.O. Box 751, Portland, OR 97207, USA;Department of Computer Science, Portland State University, P.O. Box 751, Portland, OR 97207, USA;Department of Computer Science, Portland State University, P.O. Box 751, Portland, OR 97207, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 17
Cited 3

Equational logic as a programming language

Equational logic as a programming language
Term graph rewriting

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Rewrite systems

Handbook of theoretical computer science (vol. B)
Nondeterministic algebraic specifications and nonconfluent term rewriting

Journal of Logic Programming
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Term rewriting and all that

Term rewriting and all that
Admissible graph rewriting and narrowing

JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Term graph rewriting

Handbook of graph grammars and computing by graph transformation
A needed narrowing strategy

Journal of the ACM (JACM)
Definitional Trees

Proceedings of the Third International Conference on Algebraic and Logic Programming
Optimal Non-deterministic Functional Logic Computations

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Implementing functional logic languages using multiple threads and stores

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Specialization of functional logic programs based on needed narrowing

Theory and Practice of Logic Programming
Evaluation strategies for functional logic programming

Journal of Symbolic Computation
Overlapping rules and logic variables in functional logic programs

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
A virtual machine for functional logic computations

IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
On the correctness of bubbling

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

On Term-Graph Rewrite Strategies

Electronic Notes in Theoretical Computer Science (ENTCS)
Inductively Sequential Term-Graph Rewrite Systems

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Rewriting and call-time choice: the HO case

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and prove its correctness. Our strategy and its extension to narrowing are intended for the implementation of non-strict non-deterministic functional logic programming languages. Our strategy is based on a graph transformation, called bubbling, that avoids the construction of large contexts of redexes with distinct replacements, an expensive and frequently wasteful operation executed by competitive complete techniques.