@inproceedings{Antoy01ENTCS57, author = {Sergio Antoy}, title = {Evaluation Strategies for Functional Logic Programming}, booktitle = {Electronic Notes in Theoretical Computer Science}, volume = {57}, publisher = {Elsevier Science Publishers}, editor = {Bernhard Gramlich and Salvador Lucas}, year = {2001} } @inproceedings{Antoy01WRS ,author={S. Antoy} ,title={Evaluation Strategies for Functional Logic Programming} ,year={May 2001} ,address={Utrecht, The Netherlands} ,pages={1-17} ,publisher={Departamento de Sistemas Infom\'aticos y Computaci\'on, Ref.:2001.2359, Universidad Politecnica de Valencia} ,booktitle={International Workshop on Reduction Strategies in Rewriting and Programming} ,abstract={ Recent advances in the foundations and the development of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. Narrowing is a computation similar to rewriting which yields substitutions in addition to normal forms. In functional logic programming, the classes of rewrite systems to which narrowing is applied are, for the most part, subclasses of the constructor-based, possibly conditional, rewrite systems. Many interesting narrowing strategies, particularly for the smallest subclasses of the constructor-based rewrite systems, are generalizations of well-known rewrite strategies. However, some strategies for larger non-confluents subclasses have been developed just for functional logic computations. In this paper, I will discuss the elements that play a relevant role in evaluation strategies for functional logic programming, describe some important classes of rewrite systems that model functional logic programs, show examples of the differences in expressiveness provided by these classes, and review the characteristics of narrowing strategies proposed for each class of rewrite systems. } }