Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Lazy Rewriting in Logic Programming \Lambda Sergio Antoy y
 

Summary: Lazy Rewriting in Logic Programming \Lambda
Sergio Antoy y
Department of Computer Science
Portland State University
P.O. Box 751
Portland, Oregon 97207
antoy@cs.pdx.edu
Abstract
We describe a technique enabling a logic program to perform lazy rewriting. Our
technique is based on a transformation of a rewrite system in a set of Horn clauses.
We characterize syntactically, in terms of a hierarchical structure of the rewrite
rules of an operation, the systems accepted by our transformation and outline a
design technique yielding systems with these characteristics. We define our trans­
formation, prove its correctness and other properties, and relate the efficiency of
resolution to that of rewriting. Improvements over previous similar results include
using a more expressive and more powerful language, generating a more efficient
logic program, providing efficient operational completeness, and establishing a tight
bound on the length of a resolution as a function of the length of a corresponding
reduction sequence. We compare our approach with several related proposals and
discuss examples which also show the integration of lazy with eager evaluation and

  

Source: Antoy, Sergio - Department of Computer Science, Portland State University

 

Collections: Computer Technologies and Information Sciences