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 discuss its correctness. Our strategy and its exten­
sion to narrowing are intended for the implementation of modern functional logic
programming languages. Our strategy 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­determinism, functional logic programming
1 Introduction
Non­determinism is one of the most appealing features of functional logic
programing. A program is non­deterministic when its execution may evaluate

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

Collections: Computer Technologies and Information Sciences