1999
DOI: 10.1007/10704567_22
|View full text |Cite
|
Sign up to set email alerts
|

Declarative Program Transformation: A Deforestation Case-Study

Abstract: International audienc

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2002
2002
2013
2013

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…In a separate paper, one of us (Backhouse) has shown how abstract interpretation can benefit the study of attribute grammars [2]. Conversely, Correnson, Parigot and their coworkers have argued that transformations on attribute grammars benefit functional programs [4,22].…”
Section: Resultsmentioning
confidence: 99%
“…In a separate paper, one of us (Backhouse) has shown how abstract interpretation can benefit the study of attribute grammars [2]. Conversely, Correnson, Parigot and their coworkers have argued that transformations on attribute grammars benefit functional programs [4,22].…”
Section: Resultsmentioning
confidence: 99%
“…Function lrev is that seen in the Introduction, and flatten gathers leaves in a tree, Since both lrev and flatten are accumulative, their fusion is nontrivial. The situation is very similar to grayCode discussed in Sections 4 and 5: unfoldingfolding cannot deforest the intermediate list, and the foldr/build rule yields a program that accumulates complicated closures, whereas more sophisticated methods (Kühnemann, 1998;Correnson et al, 1999;Nishimura, 2003;Nishimura, 2004;Voigtländer, 2004;Voigtländer & Kühnemann, 2004;Katsumata & Nishimura, 2008) can deal with it.…”
Section: Io Swapping Applied To Tree-traversing Functionsmentioning
confidence: 89%
“…As seen, deforestation for accumulative functions is nontrivial. Several solutions have been proposed (Kühnemann, 1998;Correnson et al, 1999;Nishimura, 2004;Voigtländer, 2004;Voigtländer & Kühnemann, 2004;Katsumata & Nishimura, 2008). Here we introduce another method.…”
Section: Lrev (Map F X)mentioning
confidence: 99%
“…The body of work from parallel compilers [16,3] includes formalisms for the automatic loop fusion and deforestation of serial code [5]. KFusion leverages these approaches to optimize for application-specific data flow needs, and though our prototype uses a naive approach, it does not preclude experimentation with other contenders in this domain.…”
Section: Framework For Performancementioning
confidence: 99%