On the correctness of bubbling

Authors:
Sergio Antoy;Daniel W. Brown;Su-Hui Chiang
Affiliations:
Department of Computer Science, Portland State University, Portland, OR;Department of Computer Science, Portland State University, Portland, OR;Department of Computer Science, Portland State University, Portland, OR
Venue:
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Year:
2006

Citing 16
Cited 6

Equational logic as a programming language

Equational logic as a programming language
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
Term Rewriting Systems

Term Rewriting Systems
TOY: A Multiparadigm Declarative System

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Optimal Non-deterministic Functional Logic Computations

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Constructor-based conditional narrowing

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative 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

Lazy Context Cloning for Non-Deterministic Graph Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Computing with subspaces

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
The Kiel Curry System KiCS

Applications of Declarative Programming and Knowledge Management
A Technique to Build Debugging Tools for Lazy Functional Logic Languages

Electronic Notes in Theoretical Computer Science (ENTCS)
On a tighter integration of functional and logic programming

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
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

Bubbling, a recently introduced graph transformation for functional logic computations, is well-suited for the reduction of redexes with distinct replacements. Unlike backtracking, bubbling preserves operational completeness; unlike copying, it avoids the up-front construction of large contexts of redexes, an expensive and frequently wasteful operation. We recall the notion of bubbling and offer the first proof of its completeness and soundness with respect to rewriting.