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 wellknown 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. 1

Citations

1224	Lectures on constructive functional programming - Bird - 1989
823	T.Nipkow : Term Rewriting and All That - Baader - 1998
723	Rewrite systems - Dershowitz, Jouannaud - 1990
550	Term rewriting systems - Klop - 1992
317	The integration of functions into logic programming: From theory to practice - Hanus - 1994
273	A needed narrowing strategy - Antoy, Echahed, et al.
138	Definitional trees - Antoy - 1992
136	The Craft of Prolog - O'Keefe - 1990
95	A demand driven computation strategy for lazy narrowing - Loogen, López-Fraguas, et al. - 1993
84	Computing in Systems Described by Equations - O'Donnell
84	Higher-order extensions to Prolog | are they needed - Warren - 1981
83	Conditional Rewrite Rules: Confluence and Termination - Bergstra, Klop
74	Higher-Order Narrowing with Definitional Trees - Hanus, Prehofer - 1999
59	Computations in Orthogonal Term Rewriting Systems - Huet, Lévy - 1992
53	Optimal non-deterministic functional logic computations - Antoy - 1298
46	Parallel Evaluation Strategies for Functional Logic Languages - Antoy, Echahed, et al. - 1997
41	Programming in equational logic: Beyond strong sequentiality - Sekar, Ramakrishnan - 1993
26	Strongly sequential and inductively sequential term rewriting systems - Hanus, Lucas, et al. - 1998
19	A complete narrowing calculus for higher-order functional logic programming. Pages 97–114 of - Nakahara, Middeldorp, et al. - 1995
18	Higher-order rewriting - Raamsdonk - 2003
14	Non-Determinism and Lazy Evaluation in Logic Programming - Antoy - 1991
11	Typed Higher-Order Narrowing without Higher-Order Strategies - Antoy, Tolmach - 1722
10	A correctness proof for Warren's HO into FO translation - Gonzalez-Moreno - 1993
1	Constructor-based conditional narrowing, 2001. Submitted for publication. Available at URL http://www.cs.pdx.edu/ antoy - Antoy