Efficient Local Unfolding with Ancestor Stacks

Details Efficient Local Unfolding with Ancestor Stacks Efficient Local Unfolding with Ancestor Stacks

2009-11-20

arxiv.org/abs/0911.4047v1

Computer Science

Programming Languages

Number of pages: 32 Number of figures: 7 Number of Tables: 3

Scientific paper

The most successful unfolding rules used nowadays in the partial evaluation of logic programs are based on well quasi orders (wqo) applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Ancestor (sub)sequences are used to increase the specialization power of unfolding while still guaranteeing termination and also to reduce the number of atoms for which the wqo has to be checked. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with a wqo and allows a stack-based implementation without losing any opportunities for specialization. Using our technique, certain non-leftmost unfoldings are allowed as long as local unfolding is performed, i.e., we cover depth-first strategies.

Affiliated with

Also associated with

No associations

Rating

Efficient Local Unfolding with Ancestor Stacks 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 Efficient Local Unfolding with Ancestor Stacks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Local Unfolding with Ancestor Stacks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432546