| | |
Summary: On the Correctness of Bubbling
Sergio Antoy Daniel W. Brown Su-Hui Chiang
Department of Computer Science
Portland State University
P.O. Box 751
Portland, OR 97207
17th International Conference on Rewriting Techniques and Applications (RTA'06)
Seattle, WA, USA, August 1214, 2006
c Springer-Verlag LNCS Vol. 4098, pages 3549
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 op-
erational completeness; unlike copying, it avoids the up-front construc-
tion 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.
1 Introduction
Non-determinism is one of the most appealing features of functional logic pro-
graming. A program is non-deterministic when its execution may evaluate some
expression that has multiple results. To better understand this concept, consider
|
