A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Programming Languages
2007-05-23 v1 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.cs/0003068,
title = {A Polyvariant Binding-Time Analysis for Off-line Partial Deduction},
author = {Maurice Bruynooghe and Michael Leuschel and Konstantinos Sagonas},
journal= {arXiv preprint arXiv:cs/0003068},
year = {2007}
}
Comments
19 pages (including appendix) Paper (without appendix) appeared in Programming Languages and Systems, Proceedings of the European Symposium on Programming (ESOP'98), Part of ETAPS'98 (Chris Hankin, eds.), LNCS, vol. 1381, 1998, pp. 27-41