PEPM
1994
ACM
14 years 3 months ago
1994
ACM
The performance of object-oriented languages can be greatly improved if methods can be specialized for particular classes of arguments. Such specialization can provide the compile...
PEPM
1994
ACM
14 years 3 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...
PEPM
1994
ACM
14 years 3 months ago
1994
ACM
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
PEPM
1994
ACM
14 years 3 months ago
1994
ACM
It is well-known that self-applicable partial evaluation can be used to generate compiler generators: cogen = mix(mix;mix), where mix is the specializer (partial evaluator). Howev...
PEPM
1994
ACM
14 years 3 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
14 years 3 months ago
1994
ACM
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
PEPM
1994
ACM
14 years 3 months ago
1994
ACM
PEPM
1994
ACM
14 years 3 months ago
1994
ACM
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...