Summary: TERMGRAPH 2006
Lazy Context Cloning for Non­Deterministic
Graph Rewriting #
Sergio Antoy Daniel W. Brown Su­Hui Chiang
Department of Computer Science
Portland State University
P.O. Box 751
Portland, OR 97207
USA
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 trans­
formation, 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.
Key words: non­deterministic computations, functional logic
programming, bubbling, graph transformations
1 Introduction

Source: Antoy, Sergio - Department of Computer Science, Portland State University

Collections: Computer Technologies and Information Sciences