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

Simple item page
dc.creatorBruynooghe, Maurice
dc.creatorLeuschel, Michael
dc.creatorSagonas, Konstantinos
dc.date2000-03-17
dc.date.accessioned2026-07-07T03:16:06Z
dc.date.available2026-07-07T03:16:06Z
dc.descriptionWe 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.
dc.description19 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
dc.identifierhttps://arxiv.org/abs/cs/0003068
dc.identifierhttp://arxiv.org/abs/cs/0003068
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30226
dc.subjectProgramming Languages
dc.subjectLogic in Computer Science
dc.subjectD.3.0; D.1.6; F.3.1
dc.titleA Polyvariant Binding-Time Analysis for Off-line Partial Deduction
dc.typetext

Files

Collections

arXiv