Efficient Translation of Lazy Functional Logic Programs into Prolog

by Michael Hanus

Fifth International Workshop on Logic Program Synthesis and Transformation (LOPSTR'95), Springer LNCS 1048, pp. 252-266, 1995
© Springer-Verlag

In this paper, we present a high-level implementation of lazy functional logic programs by transforming them into Prolog programs. The transformation is controlled by generalized definitional trees which specify the narrowing strategy to be implemented. Since we consider a sophisticated narrowing strategy, a direct mapping of functions into predicates is not possible. Therefore, we present new techniques to reduce the interpretational overhead of the generated Prolog code. This leads to a portable and efficient implementation of functional logic programs.

DVI (64 KB) Postscript (207 KB) BibTeX-Entry