Lazy Context Cloning for Non-Deterministic Graph Rewriting

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 extension 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

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
• Keywords: ENTCS 2007, Functional Logic Programming, Modern Functional Logic, Strategy