Sponsor
Portland State University. Department of Computer Science
First Advisor
Sergio Antoy
Term of Graduation
Fall 1995
Date of Publication
10-31-1995
Document Type
Thesis
Degree Name
Master of Science (M.S.) in Computer Science
Department
Computer Science
Language
English
Subjects
Gödel (Computer program language)
DOI
10.15760/etd.7071
Physical Description
1 online resource (ii, 71 pages)
Abstract
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 Gödel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Gödel parser which enables the parsing of evaluable functions in Gödel. As the first part of an extended Gödel, the parser produces output similar to the output from the original Gödel parser, ensuring that Gödel modules are properly handled by the extended-Gödel 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 Gödel parser, the objects produced by it, the modifications made for the implementation of the extended Gödel and the motivation for those modifications. The ultimate goal of this research is production of a functional component for Gödel which evaluates user-defined functions with needed narrowing, a strategy which is sound, complete, and optimal for inductively sequential rewrite systems.
Rights
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).
Persistent Identifier
https://archives.pdx.edu/ds/psu/30009
Recommended Citation
Vorvick, Janet, "Evaluable Functions in the Gödel Programming Language: Parsing and Representing Rewrite Rules" (1995). Dissertations and Theses. Paper 5195.
https://doi.org/10.15760/etd.7071
Comments
If you are the rightful copyright holder of this dissertation or thesis and wish to have it removed from the Open Access Collection, please submit a request to pdxscholar@pdx.edu and include clear identification of the work, preferably with URL.