L.O. Andersen and C.K. Gomard. Speedup analysis in partial evaluation (preliminary results). In Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut. (Sigplan Notices, vol. 26, no. 9, September 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Positive Supercompiler - Sørensen, Glück, Jones (1993) (3 citations) (Correct)
....efficiency is what we are after. In (S rensen, 1994a) it is shown that transformed programs arising from deforestation and positive supercompilation run faster by at most a constant factor (the factor may depend on the program s initial term) A related result for partial evaluation is due to Andersen and Gomard (1992). Termination. The algorithm P together with folding should always terminate, but in fact does not, just as deforestation does not always terminate. However, an important aspect of deforestation is that there is a syntactic class of function definitions, treeless definitions (Wadler, 1990) such ....
Andersen, L.O. and Gomard, C.K. 1992. Speedup analysis in partial evaluation. In ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Technical Report YALEU/DCS/RR-909, pages 1--7.
Transformation by Interpreter Specialisation - Jones (2004) (1 citation) (Correct)
No context found.
L.O. Andersen and C.K. Gomard. Speedup analysis in partial evaluation (preliminary results). In Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut. (Sigplan Notices, vol. 26, no. 9, September 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC