W.-N. Chin. Generalising deforestation to all first-order functional programs. In Work - shop on Static Analysis of Equational, Functional and Logic Programming Languages, BIGRE 74, pages 173--181, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....two methods for extending the domain of deforestation: blazing and higher order macros [Wad90] Since then, a number of static analyses to annotate unsafe expressions in first order functional programs have been developed by 2. 1 Program Specialisation by Partial Evaluation 14 Chin [Chi90, Chi91, Chi94] Hamilton [Ham93, HJ91, Ham91] Srensen [Sr94, Sr93] and Seidl [Sei96] Approaches to higher order deforestation problem include extending the rules of Wadler s deforestation [MW92, Mar96, Ham96] and adding a higher order removal transformation [Chi92] Deforestation provides no ....

W.-N. Chin. Generalising deforestation to all first-order functional programs. In Workshop on Static Analysis of Equational, Functional and Logic Programming Languages, BIGRE 74, pages 173--181, 1991.

....This is indeed done by Wadler s [17, 54, 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 ....

....Any such program typable in the HindleyMilner [27, 36] type system can be expanded out to a first order program, and transformed with first order deforestation. These programs include applications of the fold and map functions, but exclude useful constructions, e.g. lists of functions. Chin [7, 8, 10, 11] starts out with a higher order program and uses a higher order removal transformation [7, 9, 12] to eliminate some higherorder parts, resulting in a program in a restricted higherorder form. He then adopts a version of deforestation applicable to annotated programs in the restricted ....

W.-N. Chin. Generalising deforestation to all firstorder functional programs. In Workshop on Static Analysis of Equational, Functional and Logic Programming Languages, BIGRE 74, pages 173--181, 1991. 10

....should receive marks to ensure safety. Wadler blazes programs on the basis of types. For instance, a subterm of integer type does not produce as a result a data structure, so nothing is lost by marking the subterm. The type based blazing is not generally safe (and was not mean to be) Chin [7,8,10,11] safely blazes all first order programs by, roughly, marking all subterms violating the linear, treeless syntax: i) for every definition, all arguments that are not variables; ii) for every definition, all selectors that are not variables; iii) for every definition and the main term, all ....

....Any such program typable in the Hindley Milner [29,38] type system can be expanded out to a first order program, and transformed with first order deforestation. These programs include applications of the fold and map functions, but exclude useful constructions, e.g. lists of functions. Chin [7,8,10,11] starts out with a higher order program and uses higher order removal [7,9,12] to eliminate some higher order parts, resulting in a program in a restricted higher order form. He then adopts a version of deforestation applicable to blazed programs in the restricted higher order form, and marks ....

W.-N. Chin. Generalising deforestation to all first-order functional programs. In Workshop on Static Analysis of Equational, Functional and Logic Programming Languages, BIGRE 74, pages 173--181, 1991.

....This is indeed done by Wadler s [16, 53, 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 ....

....Any such program typable in the Hindley Milner [27, 35] type system can be expanded out to a first order program, and transformed with first order deforestation. These programs include applications of the fold and map functions, but exclude useful constructions, e.g. lists of functions. Chin [6, 7, 9, 10] starts out with a higher order program and uses a higherorder removal transformation [6, 8, 11] to eliminate some higher order parts, resulting in a program in a restricted higher order form. He then adopts a version of deforestation applicable to annotated programs in the restricted higherorder ....

W.-N. Chin. Generalising deforestation to all first-order functional programs. In Workshop on Static Analysis of Equational, Functional and Logic Programming Languages, BIGRE 74, pages 173--181, 1991.

No context found.

W.-N. Chin. Generalising deforestation to all first-order functional programs. In Work - shop on Static Analysis of Equational, Functional and Logic Programming Languages, BIGRE 74, pages 173--181, 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