Summary: Constructor­based Conditional Narrowing #
Sergio Antoy
Dept. of Computer Science
Portland State University
antoy@cs.pdx.edu
ABSTRACT
We define a transformation from a left­linear constructor­based con­
ditional rewrite system into an overlapping inductively sequential
rewrite system. This transformation is sound and complete for the
computations in the source system. Since there exists a sound and
complete narrowing strategy for the target system, the combination
of these results offers the first procedure for provably sound and
complete narrowing computations for the whole class of the left­
linear constructor­based conditional rewrite systems. We address
the differences between demand driven and lazy strategies and be­
tween narrowing strategies and narrowing calculi. In this context,
we analyze the efficiency and practicality of using our transforma­
tion for the implementation of functional logic programming lan­
guages. The results of this paper complement, extend, and occa­
sionally rectify, previously published results in this area.

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

Collections: Computer Technologies and Information Sciences