Portland State University. Department of Computer Science.
Date of Publication
Master of Science (M.S.) in Computer Science
Gèodel (Computer program language)
1 online resource (82 p.)
We present an extension of the Godel logic programming language code generator which compiles user-defined functions. These functions may be used as arguments in predicate or goal clauses. They are defined in extended Godel as rewrite rules. A translation scheme is introduced to convert function definitions into predicate clauses for compilation. This translation scheme and the compilation of functional arguments both employ leftmost-innermost narrowing. As function declarations are indistinguishable from constructor declarations, a function detection method is implemented. The ultimate goal of this research is the implementation of extended Godel using needed narrowing. The work presented here is an intermediate step in creating a functional-logic language which expands the expressiveness of logic programming and streamlines its execution.
Shapiro, David, "Compiling Evaluable Functions in the Godel Programming Language" (1996). Dissertations and Theses. Paper 5101.