Loading...
Please wait, while we are loading the content...
Similar Documents
Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel
| Content Provider | Semantic Scholar |
|---|---|
| Author | Barry, Bobbi J. |
| Copyright Year | 2000 |
| Abstract | An abstract of the thesis of Bobbi J. Barry for the Master of Science in Computer Science presented June 12, 1996. Title: Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel. A programming language that combines the best aspects of both the functional and logic paradigms with a complete evaluation strategy has been a goal of a Portland State University project team for the last several years. I present the third in a series of modifications to the compiler of the logic programming language Goedel which reaches this goal. This enhancement of Goedel's compiler translates user-defined functions in the form of rewrite rules into code that performs evaluation of these functions by the strategy of needed narrowing. In addition, Goedel's mechanism that evaluates predicates is supplemented so that needed narrowing is still maintained as the evaluation strategy when predicates possess functional arguments. NEEDED NARROWING AS THE COMPUTATIONAL STRATEGY OF EVALUABLE FUNCTIONS IN AN EXTENSION OF GOEDEL |
| File Format | PDF HTM / HTML |
| DOI | 10.15760/etd.6791 |
| Alternate Webpage(s) | http://web.cecs.pdx.edu/~antoy/homepage/theses/B_Barry_thesis.pdf |
| Alternate Webpage(s) | https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=5987&context=open_access_etds |
| Alternate Webpage(s) | https://doi.org/10.15760/etd.6791 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
