Portland State University. Department of Computer Science.
Date of Publication
Master of Science (M.S.) in Computer Science
Gèodel (Computer program language), Logic programming languages
1 online resource (82 p.)
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.
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).
Barry, Bobbi J., "Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel" (1996). Dissertations and Theses. Paper 4915.