PEPM
1994
ACM
14 years 23 hour 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 23 hour 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 23 hour 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 23 hour ago
1994
ACM
PEPM
1994
ACM
14 years 23 hour 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...
FSTTCS
1992
Springer
14 years 23 hour ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
FSTTCS
1992
Springer
14 years 23 hour ago
1992
Springer
The branching bisimulation de ned by Van Glabbeek and Weijland takes care of preserving the branching structure of processes even though silent actions are taken. Branching bisimu...
FSTTCS
1992
Springer
14 years 23 hour ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
RE
1993
Springer
14 years 1 days ago
1993
Springer
EWSPT
1992
Springer
14 years 1 days ago
1992
Springer