Sciweavers

1087 search results - page 27 / 218
» Eta-Redexes in Partial Evaluation
Sort
View
ENTCS
2007
134views more  ENTCS 2007»
13 years 9 months ago
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
ERSHOV
1999
Springer
14 years 1 months ago
The Essence of Program Transformation by Partial Evaluation and Driving
Abstract. An abstract framework is developed to describe program transformation by specializing a given program to a restricted set of inputs. Particular cases include partial eval...
Neil D. Jones
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
14 years 1 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
PEPM
1994
ACM
14 years 1 months ago
The Essence of Eta-Expansion in Partial Evaluation
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...
Olivier Danvy, Karoline Malmkjær, Jens Palsb...
APLAS
2007
ACM
14 years 1 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan