Needed narrowing in Prolog

Extended abstract
  • Sergio Antoy
Posters and Demonstrations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1140)


  1. 1.
    S. Antoy. Definitional trees. In Proc. of the 4th Intl. Conf. on Algebraic and Logic programming, pages 143–157. Springer LNCS 632, 1992.Google Scholar
  2. 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∼antoy.Google Scholar
  3. 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.Google Scholar
  4. 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.Google Scholar
  5. 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.Google Scholar
  6. 6.
    P. M. Hill and J. W. Lloyd. The Gödel Programming Language. MIT Press, 1993.Google Scholar
  7. 7.
    R. Loogen, F. J. López-Fraguas, and M. Rodríguez-Artalejo. A demand driven computation strategy for lazy narrowing. In PLILP'93, pages 184–200, Tallinn, Estonia, August 1993. Springer LNCS 714.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  1. 1.Portland State UniversityAustralia

Personalised recommendations