LOG(F): A new scheme for integrating rewrite rules, logic programming and lazy evaluation
Book
·
OSTI ID:5496837
The authors present LOG(F), a new scheme for integrating rewrite rules logic programming and lazy evaluation. First, they develop a simple yet expressive rewrite rule system F/sup */ for representing functions. F/sup */ is non-Noetherian, i.e. an F/sup */ program can admit infinite reductions. For this system, the authors develop a reduction strategy called select and show that is possesses the property, select exhibits a weak form of lazy evaluation. They then show how to implement F/sup */ in Prolog. Specifically, they compile rewrite rules of F/sup */ into Prolog clauses in such a way that when Prolog interprets these clauses it directly simulates the behavior of select. In particular, Prolog behaves lazily. Since it is not necessary to change already a logic programming system, a combination of rewrite rules, logic programming and lazy evaluation is achieved.
- OSTI ID:
- 5496837
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel implementation of concurrent logic languages using graph-rewriting techniques
Micro-PROLOG: Programming in logic
Logic programming
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5533843
Micro-PROLOG: Programming in logic
Book
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:6197288
Logic programming
Book
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5903373