Sciweavers

5 search results - page 1 / 1
» Polyvariant Binding-Time Analysis For Applicative Languages
Sort
View
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
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...
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
ESOP
1999
Springer
13 years 9 months ago
Interprocedural Control Flow Analysis
Control Flow Analysis is a widely used approach for analysing functional and object oriented programs. Once the applications become more demanding also the analysis needs to be mor...
Flemming Nielson, Hanne Riis Nielson
LOPSTR
1992
Springer
13 years 9 months ago
Logimix: A Self-Applicable Partial Evaluator for Prolog
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
Torben Æ. Mogensen, Anders Bondorf