249 search results - page 2 / 50 » Polymorphic Binding-Time Analysis |
ESOP
1998
Springer
13 years 10 months ago
1998
Springer
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 inte...
PEPM
1994
ACM
13 years 9 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
PEPM
1994
ACM
13 years 9 months ago
1994
ACM
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
ERSHOV
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. Existing partial evaluators usually fix the strategy for binding-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding ...
LOPSTR
2004
Springer
13 years 11 months ago
2004
Springer
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 ...