Implementing natural rewriting and narrowing efficiently.

*(English)*Zbl 1122.68371
Kameyama, Yukiyoshi (ed.) et al., Functional and logic programming. 7th international symposium, FLOPS 2004, Nara, Japan, April 7–9, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21402-X/pbk). Lecture Notes in Computer Science 2998, 147-162 (2004).

Summary: Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel extension, known as weakly, deals with non-inductively sequential constructor systems. Recently, refinements of (weakly) outermost-needed rewriting and narrowing have been obtained. These new strategies are called natural rewriting and natural narrowing, respectively, and incorporate a better treatment of demandedness. In this paper, we address the problem of how to implement natural rewriting and narrowing efficiently by using a refinement of the notion of definitional tree, which we call matching definitional tree. We also show how to compile natural rewriting and narrowing to Prolog and provide some promising experimental results.

For the entire collection see [Zbl 1048.68005].

For the entire collection see [Zbl 1048.68005].

##### MSC:

68N17 | Logic programming |

68N30 | Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) |

68Q42 | Grammars and rewriting systems |