Compiling Evaluable Functions in the Godel Programming Language
We present an extension of the Godel 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 Godel as rewrite rules. A translation scheme is introduced to convert function def...
Main Author: | Shapiro, David |
---|---|
Format: | Others |
Published: |
PDXScholar
1996
|
Subjects: | |
Online Access: | https://pdxscholar.library.pdx.edu/open_access_etds/5101 https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=6173&context=open_access_etds |
Similar Items
-
Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel
by: Barry, Bobbi J.
Published: (1996) -
Language and compiler support for mixin programming
by: Cardone, Richard Joseph
Published: (2011) -
EXTRACT: Extensible Transformation and Compiler Technology
by: Calnan, III, Paul W.
Published: (2003) -
Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules
by: Vorvick, Janet
Published: (1995) -
Incorporating domain-specific information into the compilation process
by: Guyer, Samuel Zev
Published: (2011)