Oxford Journals
tools journals homepage advanced search contact help
Journal of Logic and Computation: Current Issue
 
home
browse
current
etoc
authors
subinfo
subscribers
samples

OUP > Journals > Computing/Engineer. & Mathematics/Stats. > Journal of Logic and Computation

Journal of Logic and Computation

Volume 13, Issue 2, April 2003: pp. 287-312

Uniform Lazy Narrowing

María Alpuente1, Moreno Falaschi2, Pascual Julián3 and Germán Vidal4

1DSIC, Technical University of Valencia, Camino de Vera s/n, E-46022 Valencia, Spain. E-mail: alpuente@dsic.upv.es
2DMI, Università di Udine, Via delle Scienze 206, 33100 Udine, Italy. E-mail: falaschi@dimi.uniud.it
3Dpto. de Informática, Universidad de Castilla - La Mancha, Paseo de la Universidad 4, 13071 Ciudad Real, Spain. E-mail: pjulian@inf-cr.uclm.es
4DSIC, Technical University of Valencia, Camino de Vera s/n, E-46022 Valencia, Spain. E-mail: gvidal@dsic.upv.es

Needed narrowing is a complete and optimal operational principle for modern declarative languages which integrate the best features of lazy functional and logic programming. We investigate the formal relation between needed narrowing and another (not so lazy) narrowing strategy which is the basis for popular implementations of lazy functional logic languages. We demonstrate that needed narrowing and lazy narrowing are computationally equivalent over the class of uniform programs. We also introduce a complete refinement of lazy narrowing, called uniform lazy narrowing, which is still equivalent to needed narrowing over the aforementioned class. Since actual implementations of functional logic languages are based on the transformation of the original program into a uniform one-which is then executed using a lazy narrowing strategy-our results can be thought of as a formal basis for the correctness of these implementations.

Keywords: Functional logic programming; narrowing strategies

Table of Contents   Full-Text PDF (245 KB)

Oxford University Press
Published by Oxford University Press
Copyright ©Oxford University Press 2003
Print ISSN: 0955-792X  Online ISSN: 1465-363X.
Oxford University Press Privacy Policy and Legal Statement