On the Correctness of Bubbling

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 r...

Full description

Saved in:
Bibliographic Details
Published inLecture notes in computer science pp. 35 - 49
Main Authors Antoy, Sergio, Brown, Daniel W., Chiang, Su-Hui
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Functional Logic
Logic Program
Programming languages
Software
Term Graph
Term Rewrite System
True False
Backtracking
Replacement
Graph transformation
Functional transformation
Rewriting
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:Partially supported by the NSF grant CCR-0218224.
ISBN:9783540368342
3540368345
ISSN:0302-9743
1611-3349
DOI:10.1007/11805618_4