Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules

• Main Author: Vorvick, Janet
• Format: Others
• Published: PDXScholar 1995
• Subjects: Gödel (Computer program language); Computer Sciences
• Online Access: https://pdxscholar.library.pdx.edu/open_access_etds/5195; https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=6267&context=open_access_etds

The integration of a functional component into a logic language extends the expressive power of the language. One logic language which would benefit from such an extension is Godel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Godel parser which enables the parsing of evaluable functions in Godel. As the first part of an extended Godel, the parser produces output similar to the output from the original Godel parser, ensuring that Godel modules are properly handled by the extended-Godel parser. Parser output is structured to simplify, as much as possible, the future task of creating an extended compiler implementing evaluation of functions using narrowing. We describe the structure of the original Godel parser, the objects produced by it, the modifications made for the implementation of the extended Godel and the motivation for those modifications. The ultimate goal of this research is production of a functional component for Godel which evaluates user-defined functions with needed narrowing, a strategy which is sound, complete, and optimal for inductively sequential rewrite systems.