Summary: Demandness in Rewriting and Narrowing
Sergio Antoy 1# and Salvador Lucas 2##
1 Computer Science Department
Portland State University
Portland, OR 97207, U.S.A.
Universidad Polit’ecnica de Valencia
11th Int. Workshop on Functional and (constraint) Logic Programming (WFLP'02)
Grado, Italy --- June 20--22, 2002.
Research Report UDMI/18/2002/RR, pages 35--43
Abstract. The traditional investigation of rewriting and narrowing
strategies aims at establishing fundamental properties, such as sound
ness, completeness and/or optimality, of a strategy. In this work, we
analyze and compare rewriting and narrowing strategies from the point
of view of the information taken into account by a strategy to compute
a step. The notion of demandness provides a suitable framework for pre
senting and comparing wellknown strategies. We find the existence of