1. S. Antoy. Definitional trees. In Proc. of the 4th Intl. Conf. on Algebraic and Logic programming, pages 143–157. Springer LNCS 632, 1992.
2. S. Antoy. Needed narrowing in Prolog. Technical report TR 96-2, Portland State University, Portland, OR, May 1996. Full version of this abstract accessible via http://www.cs.pdx.edu/∼antoy.
3. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pages 268–279, Portland, 1994.
4. B. J. Barry. Needed narrowing as the computational strategy of evaluable functions in an extension of Gödel. Master's thesis, Portland State University, June 1996.
5. M. Hanus. Efficient translation of lazy functional logic programs into Prolog. In Proc. Fifth International Workshop on Logic Program Synthesis and Transformation, pages 252–266. Springer LNCS 1048, 1995.