A Polyvariant Binding-Time Analysis for Off-line Partial Deduction

Details A Polyvariant Binding-Time Analysis for Off-line Partial Deduction A Polyvariant Binding-Time Analysis for Off-line Partial Deduction

2000-03-17

arxiv.org/abs/cs/0003068v1

Computer Science

Programming Languages

19 pages (including appendix) Paper (without appendix) appeared in Programming Languages and Systems, Proceedings of the Europ

Scientific paper

We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction system as a Prolog program. Using abstract interpretation, we collect information about the run-time behaviour of the program. We use this information to make the control decisions about the unfolding at analysis time and to turn the on-line system into an off-line system. We report on some initial experiments.

Affiliated with

Also associated with

No associations

Rating

A Polyvariant Binding-Time Analysis for Off-line Partial Deduction 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 A Polyvariant Binding-Time Analysis for Off-line Partial Deduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Polyvariant Binding-Time Analysis for Off-line Partial Deduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-488151