A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
<|reference_start|>A Polyvariant Binding-Time Analysis for Off-line Partial Deduction: 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.<|reference_end|>
@article{bruynooghe2000a,
    title={A Polyvariant Binding-Time Analysis for Off-line Partial Deduction},
    author={Maurice Bruynooghe, Michael Leuschel, Konstantinos Sagonas (Katholieke
  Universiteit Leuven, Belgium)},
    journal={arXiv preprint arXiv:cs/0003068},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0003068},
    primaryClass={cs.PL cs.LO}
}