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

Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s 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.

• Type: Conference
• Year: 1998
• Where: ESOP
• Authors: Maurice Bruynooghe, Michael Leuschel, Konstantinos F. Sagonas
• Keywords: Binding-time Analysis, ESOP 1998, On-line Partial Deduction, Programming Languages, Unfolding