Sciweavers

5 search results - page 1 / 1
» A Polyvariant Binding-Time Analysis for Off-line Partial Ded...
Sort
View
ESOP
1998
Springer
13 years 9 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
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...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
PEPM
1993
ACM
13 years 9 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
ERSHOV
1999
Springer
13 years 9 months ago
Binding-Time Analysis in Partial Evaluation: One Size Does Not Fit All
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 ...
Niels H. Christensen, Robert Glück, Sø...
ICFP
1997
ACM
13 years 9 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
PPDP
2005
Springer
13 years 11 months ago
Self-tuning resource aware specialisation for prolog
The paper develops a self-tuning resource aware partial evaluation technique for Prolog programs, which derives its own control strategies tuned for the underlying computer archit...
Stephen-John Craig, Michael Leuschel