Fully Automatic Binding Time Analysis for Prolog
Craig, Stephen-John, Gallagher, John, Leuschel, Michael and Henriksen, Kim S. (2004) Fully Automatic Binding Time Analysis for Prolog. In, Etalle, Sandro (ed.) Logic Based Program Synthesis and Transformation: 14th International Symposium, LOPSTR 2004. Lopstr'04 (Pre-proceedings) , Springer-Verlag, 53-68.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (343Kb) |
Description/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 have to ensure 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, and we report on performance of the algorithm on a series of benchmarks.
| Item Type: | Book Section |
|---|---|
| Additional Information: | Event Dates: August 2004 |
| ISBNs: | 3540266550 |
| Keywords: | Partial Evaluation, BTA, Abstract Interpretation, Termination Analysis, Logic Programming, Prolog |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 259546 |
| Date Deposited: | 28 Jul 2004 |
| Last Modified: | 02 Mar 2012 11:38 |
| Contributors: | Craig, Stephen-John (Author) Gallagher, John (Author) Leuschel, Michael (Author) Henriksen, Kim S. (Author) Etalle, Sandro (Editor) |
| Date: | 2004 |
| Additional Information: | Event Dates: August 2004 |
| Status: | Published |
| Publisher: | Springer-Verlag |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/259546 |
Actions (login required)
 |
View Item |
