H. Seidl and M. H. Srensen. Constraints to stop deforestation. Science of Computer Programming, 32(1-3):73-107, September 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... the practical usability of Wadlet s blazed deforestation by devising a higher order removal method [18] and automatically skipping dangerous parts of the resulting first order programs [15] References to many other papers about traditional deforestation appears in a paper by Seidl and Srensen [98], who deals with more general methods for ensuring termination of deforestation. The division of the transformation process into symbolic computation, search for regulartries, and program extraction is due to Pettorossi and Proterri [84] but it can be seen already in the works of Turchin [115] ....

SEIDL, H., AND SORENSEN, M. Constraints to stop deforestation. Science of Computer Programming 32 (1998), 73-107.

....program transformations [6, 4] Since 1990, di erent approaches have been developed in order to improve the eciency of deforestation transformations. Wadler s algorithm [29] based on Burstall and Darlington unfold fold strategy [1] has been improved and extended by several works [2, 12, 25, 27]. Another approach, the deforestation in calculational form [11, 26, 16, 28, 13] was based on algebraic notions. This latter aims at using categorial functors to capture both function and data type patterns of recursion [18] to guide the deforestation process. With a large degree of formalisms ....

H. Seidl and M. H. Srensen. Constraints to stop deforestation. Science of Computer Programming, 32(1-3):73-107, September 1998.

....Henglein [23] addresses higher order binding time analysis and how Heintze [22] and Flanagan and Felleisen [16] handle higher order functions for analyzing ML programs and Scheme programs, respectively. Use of constraints has also been studied for stopping deforestation for higher order programs [53]. Our method is described here for an untyped language, but the analysis results provide an important kind of type information; the analysis may also be adopted to enhance soft typing; and the analysis applies to typed languages as well. For example, consider the productions in Figure 7(c) The ....

H. Seidl and M. H. Srensen. Constraints to stop deforestation. Sci. Comput. Program., 32:73-107, 1998.

....for simplifying them. This is similar to how Henglein [20] addresses higher order binding time analysis and how Heintze [19] handles higher order functions for analyzing sets of values for ML programs. Similar use of constraints has been studied for stopping deforestation for higherorder programs [49]. Our extension adds two constraints productions for each lambda expression and uses two additional rules for simplification; it is not yet implemented. Handling higher order functions does not increase the time complexity of our algorithms. In fact, for a language with higher order functions but ....

H. Seidl and M. H. Sørensen. Constraints to stop deforestation. Sci. Comput. Program., 32:73--107, 1998.

....program transformations [6, 4] Since 1990, different approaches have been developed in order to improve the efficiency of deforestation transformations. Wadler s algorithm [29] based on Burstall and Darlington unfold fold strategy [1] has been improved and extended by several works [2, 12, 25, 27]. Another approach, the deforestation in calculational form [11, 26, 16, 28, 13] was based on algebraic notions. This latter aims at using categorial functors to capture both function and data type patterns of recursion [18] to guide the deforestation process. With a large degree of formalisms or ....

H. Seidl and M. H. Sørensen. Constraints to stop deforestation. Science of Computer Programming, 32(1-3):73-107, September 1998.

....program transformations [6, 4] Since 1990, several different approaches have been developed in order to improve the efficiency of deforestation transformations. Wadler s algorithm [29] based on Burstall and Darlington unfold fold strategy [1] has been improved and extended by several works [2, 12, 25, 27]. Another approach, the deforestation in calculational form [11, 26, 16, 28, 13] was based on algebraic notions. This latter aims at using categorial functors to capture both function and data type patterns of recursion [18] to guide the deforestation process. With a large degree of formalisms or ....

H. Seidl and M. H. Sørensen. Constraints to stop deforestation. Science of Computer Programming, 32(1-3):73-107, September 1998.

....for simplifying them. This is similar to how Henglein [20] addresses higher order binding time analysis and how Heintze [19] handles higher order functions for analyzing sets of values for ML programs. Similar use of constraints has been studied for stopping deforestation for higher order programs [48]. Our extension adds two constraints productions for each lambda expression and uses two additional rules for simplification; it is not yet implemented. Handling higher order functions does not increase the time complexity of our algorithms. In fact, for a language with higher order functions but ....

H. Seidl and M. H. Sørensen. Constraints to stop deforestation. Sci. Comput. Program., 32:73--107, 1998.

No context found.

H. Seidl and M. H. Srensen. Constraints to stop deforestation. Science of Computer Programming, 32(1-3):73-107, September 1998.

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