Advertisement

Reform compilation for nonlinear recursion

  • Håkan Millroth
Session 7: Implementation Aspects
Part of the Lecture Notes in Computer Science book series (LNCS, volume 624)

Abstract

We present a method for compiling nonlinear recursion in logic programming to parallel iteration (for-loops). The method results in less unification work and fewer procedure calls than implementations of SLD-resolution. The principal restriction is that the recursion depth of the computation must depend only on the size of the input arguments.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barklund, J. Parallel Unification, Ph.D. Thesis, Computing Science Dept., Uppsala University, 1990.Google Scholar
  2. 2.
    Clark, K.L. Negation as failure, Logic and Data Bases (eds. H. Gallaire & J. Minker), Plenum Press, 1978.Google Scholar
  3. 3.
    Millroth, H. Reforming Compilation of Logic Programs, Ph.D. Thesis, Computing Science Dept., Uppsala University, 1990. (Summary in: Proc. Int. Logic Programming Symp., San Diego, CA., October 1991)Google Scholar
  4. 4.
    Robinson, J. A. A machine-oriented logic based on the resolution principle. Journal of the ACM 12 (1965), 23–41.CrossRefGoogle Scholar
  5. 5.
    Tärnlund, S.-Å. Reform, report, Uppsala University.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Håkan Millroth
    • 1
  1. 1.Computing Science Dept.Uppsala UniversityUppsalaSweden

Personalised recommendations