Abstract. 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.
To the best of our knowledge, the first binding-time analysis for logic programming is REF .
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
ArXiv
ArXiv
Computer Science