We investigate the development of a graph narrowing machine for a higher order functional logic language by extension of an appropriate architecture for purely functional languages. To execute logic programs the machine must be capable of unification and backtracking. We show the integration of these mechanisms in a programmed (functional) graph reduction machine. The resulting abstract machine has been realized in C code as part of the implementation of the functional logic language BABEL. A brief introduction to this language is included. Moreover, we show a comparison between BABEL and PROLOG based on the runtimes of some example programs.
Keywords: implementation of funtional logic languages
This file was generated by bibtex2html 1.98.