Portland State University. Department of Computer Science
Term of Graduation
Date of Publication
Master of Science (M.S.) in Computer Science
Gödel (Computer program language)
1 online resource (82 pages)
We present an extension of the Gödel 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 Gödel 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 Gödel 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.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Shapiro, David, "Compiling Evaluable Functions in the Gödel Programming Language" (1996). Dissertations and Theses. Paper 5101.