Reform compilation for nonlinear recursion
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.
Unable to display preview. Download preview PDF.
- 1.Barklund, J. Parallel Unification, Ph.D. Thesis, Computing Science Dept., Uppsala University, 1990.Google Scholar
- 2.Clark, K.L. Negation as failure, Logic and Data Bases (eds. H. Gallaire & J. Minker), Plenum Press, 1978.Google Scholar
- 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
- 5.Tärnlund, S.-Å. Reform, report, Uppsala University.Google Scholar