G. Hamilton. Extending first order deforestation. Technical Report TR 95-06, Department of Computer Science, Keele University, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (10 citations) (Correct)
....55] deforestation which eliminates intermediate data structures from first order functional programs. 1 Deforestation terminates on treeless programs. Subsequent techniques to ensure termination of deforestation on all firstorder programs are due to Chin [7, 8, 10, 11, 13] and later to Hamilton [21, 22, 24, 25]. The essence of these techniques is to annotate all parts of the program that violate the treeless syntax, and then let the deforestation algorithm skip over annotated parts. A technique that annotates fewer parts of the program is due to Srensen [48] and was later improved by Seidl [45] These ....
G. Hamilton. Extending first order deforestation. Technical Report TR 95-06, Department of Computer Science, Keele University, 1995.
On Understanding Partial Execution - Lindroth (1999) (Correct)
....be described as syntactically based offline call by name partial evaluation without information propagation of a subset of first order functional languages. People then refined this method by bettering the syntactic techniques to allow the transformation for all first order functional languages [4, 5]. Then came the generalisation to handle higher order languages [6, 7] but the termination methods were still only syntactical. This was bettered somewhat in [2] in that a constraint system is used to analyze wether deforestation will terminate. This was a improvement over the other offline ....
G. Hamilton. Extending first order deforestation. Technical Report TR 95-06, Department of Computer Science, Keele University, 1995.
Constraints to Stop Deforestation - Seidl, Sørensen (1998) (8 citations) (Correct)
....stating that all terms evaluated more than once should be marked. More extensions were devised by Chin and Khoo [13] Hamilton and Jones [25,26] use static analyses to blaze first order programs, but in some cases blazed deforestation loops indefinitely on the blazed program. Later, Hamilton [22] describes a safe blazing scheme similar to Chin s (i iii) In his thesis [21] he gives another safe blazing scheme, replacing (ii iii) by similar semantic conditions, roughly: ii) all terms appearing as a case selector after a number of evaluation steps; iii) all terms that will be evaluated ....
G. Hamilton. Extending first order deforestation. Technical Report TR 95-06, Department of Computer Science, Keele University, 1995.
Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (10 citations) (Correct)
....54] deforestation which eliminates intermediate data structures from first order functional programs. 1 Deforestation terminates on treeless programs. Subsequent techniques to ensure termination of deforestation on all first order programs are due to Chin [6, 7, 9, 10, 12] and later to Hamilton [20, 21, 23, 24]. The essence of these techniques is to annotate all parts of the program that violate the treeless syntax, and then let the deforestation algorithm skip over annotated parts. Following a suggestion of Jones, the second author [47] developed a technique that annotates fewer parts of the program. ....
G. Hamilton. Extending first order deforestation. Technical Report TR 95-06, Department of Computer Science, Keele University, 1995.
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