Z. Hu, H. Iwasaki, and M. Takeichi. Calculating accumulations. New Gener. Comput., 17(2): 153--173, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Deforesting Parameters of Accumulating Maps - Kakehi, Glück, Futamura (2002) (2 citations) (Correct)
....Copenhagen. One of the weaknesses [2] of such transformations is the inability to deforest programs using accumulating parameters. This is not just a deficiency of these techniques, for other program transformers su#er from the same weakness (e.g. supercompilation [22] calculational methods [10]) When composing a consumer of lists with a producer of lists, where the producer is written using an accumulating parameter, the intermediate list cannot be removed. For example, the expression rev (rev xs) cannot be fused into a single copy xs (let al..one identity) when rev is the fast version ....
Z. Hu, H. Iwasaki, and M. Takeichi. Calculating accumulations. New Gener. Comput., 17(2): 153--173, 1999.
On Deforesting Parameters of Accumulating Maps (Extended.. - Kakehi, Glück, Futamura (2001) (Correct)
....su er from the same Research fellow of the Japan Society for the Promotion of Science y PRESTO, Japan Science and Technology Corporation (JST) on leave from DIKU, Dept. of Computer Science, University of Copenhagen 10 weakness (e.g. supercompilation [18] calculational methods [10]) For example, the expression rev (rev xs) cannot be fused into a single copy xs (let al..one identity) when rev is the fast version of list reversal. When composing a consumer of lists with a producer of lists, where the producer is written using an accumulating parameter, the intermediate list ....
Z. Hu, H. Iwasaki, and M. Takeichi. Calculating accumulations. New Gener. Comput., 17(2):153-173, 1999.
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