@INPROCEEDINGS{AntoyBrownChiang06RTA
    ,author={S. Antoy and D. Brown and S.-H. Chiang}
    ,editor={F. Pfenning}
    ,title={On the Correctness of Bubbling}
    ,year={2006}
    ,month={Aug.}
    ,address={Seattle, WA}
    ,publisher={Springer LNCS 4098}
    ,booktitle = "17th  International Conference on Rewriting Techniques and Applications"
    ,pages = "35-49"
    ,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.
    }
}