@INPROCEEDINGS{AntoyEchahedHanus97ICLP,
author = "Antoy, S. and Echahed, R. and Hanus, M.",
title = "Parallel Evaluation Strategies for Functional Logic Languages",
year = "1997",
booktitle = "Proc. Fourteenth International Conference on Logic Programming",
publisher = "MIT Press",
pages = "138-152",
abstract = {
We introduce novel, sound, complete, and locally optimal evaluation
strategies for functional logic programming languages.  Our strategies
combine, in a non-trivial way, two landmark techniques in this area:
the computation of unifiers performed by needed narrowing in
inductively sequential rewrite systems and the simultaneous reduction
of a necessary set of redexes performed by rewriting in weakly
orthogonal, constructor-based rewrite systems.  First, we define a
sequential strategy similar in scope to other narrowing strategies
used in modern lazy functional logic languages.  Then, based on the
sequential strategy, we define a parallel narrowing strategy that has
several noteworthy characteristics: it is the first complete narrowing
strategy which evaluates ground expressions in a fully deterministic,
optimal way; it computes shortest derivations and minimal sets of
solutions on inductively sequential rewrite systems; and when combined
with term simplification, it subsumes and improves all recently
developed optimizations of narrowing for overlapping rewrite rules.
} }