Fully Automatic Binding-Time Analysis for Prolog

Abstract Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and ensure the termination of the partial evaluation. We present an algorithm for generating these annotations automatically. The algorithm uses state-of-the-art termination analysis techniques, combined with a new type-based abstract interpretation for propagating the binding types. This algorithm has been implemented as part of the logen partial evaluation system, along with a graphical annotation visualiser and editor, and we report on the performance of the algorithm for a series of benchmarks.

Authors

• Stephen-John Craig
• John P. Gallagher
• Michael Leuschel
• Kim S. Henriksen

Keywords

No keywords are indexed for this paper.