TY - GEN
T1 - Binding-time annotations without binding-time analysis
AU - Vanhoof, Wim
AU - Bruynooghe, Maurice
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84896398062&partnerID=8YFLogxK
U2 - 10.1007/3-540-45653-8_49
DO - 10.1007/3-540-45653-8_49
M3 - Conference contribution
VL - 2250
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 707
EP - 722
BT - Logic for Programming, Artificial Intelligence, and Reasoning - 8th International Conference, LPAR 2001, Proceedings
A2 - Nieuwenhuis, Robert
A2 - Voronkov, Andrei
PB - Springer Verlag
T2 - 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2001
Y2 - 3 December 2001 through 7 December 2001
ER -