Transformations of Logic Programs with Goals as Arguments

Details Transformations of Logic Programs with Goals as Arguments Transformations of Logic Programs with Goals as Arguments

2003-07-09

arxiv.org/abs/cs/0307022v2

Computer Science

Programming Languages

51 pages. Full version of a paper that will appear in Theory and Practice of Logic Programming, Cambridge University Press, UK

Scientific paper

We consider a simple extension of logic programming where variables may range over goals and goals may be arguments of predicates. In this language we can write logic programs which use goals as data. We give practical evidence that, by exploiting this capability when transforming programs, we can improve program efficiency. We propose a set of program transformation rules which extend the familiar unfolding and folding rules and allow us to manipulate clauses with goals which occur as arguments of predicates. In order to prove the correctness of these transformation rules, we formally define the operational semantics of our extended logic programming language. This semantics is a simple variant of LD-resolution. When suitable conditions are satisfied this semantics agrees with LD-resolution and, thus, the programs written in our extended language can be run by ordinary Prolog systems. Our transformation rules are shown to preserve the operational semantics and termination.

Affiliated with

Also associated with

No associations

Rating

Transformations of Logic Programs with Goals as Arguments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Transformations of Logic Programs with Goals as Arguments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transformations of Logic Programs with Goals as Arguments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-577434