@inproceedings{3478c17fe5424b4fa4dbd65a11ffaff8,
title = "Binding-time annotations without binding-time analysis",
abstract = "The basic task of binding-time analysis (BTA) is to compute annotations that guide the unfolding decisions of a specialiser. The main problem is to guarantee that the specialisation will terminate. In the context of logic programming, onlyfew automatic such analyses have been developed, the most sophisticated among them relying on the result of a separate termination analysis. In this work, we devise an analysis that generates the annotations during termination analysis, which allows much more liberal unfoldings than earlier approaches.",
author = "Wim Vanhoof and Maurice Bruynooghe",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2001 ; Conference date: 03-12-2001 Through 07-12-2001",
year = "2001",
doi = "10.1007/3-540-45653-8\_49",
language = "English",
volume = "2250",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "707--722",
editor = "Robert Nieuwenhuis and Andrei Voronkov",
booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 8th International Conference, LPAR 2001, Proceedings",
address = "Germany",
}