Name
Abstract | ||
|---|---|---|
We extend the flattening transformation, which turns nested into flat data parallelism, to the full higher-order case, including lambda abstractions and data parallel
arrays of functions. Our central observation is that flattening needs to transform the closures used to represent functional
values. Thus, we use closure conversion before flattening and introduce array closures to represent arrays of functional values.
|
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11758525_122 | International Conference on Computational Science |
Keywords | Field | DocType |
flattening need,lambda abstraction,flattening transformation,full higher-order case,array closure,flat data parallelism,central observation,closure conversion,data parallel array,functional value,higher order flattening,higher order | Closure (computer programming),Flattening,Functional programming,Computer science,Nested parallelism,Algorithm,Data parallelism,Geometry,Parallel array,Lambda,Partial application | Conference |
Volume | ISSN | ISBN |
3992 | 0302-9743 | 3-540-34381-4 |
Citations | PageRank | References |
15 | 0.84 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Leshchinskiy | 1 | 326 | 14.89 |
| Manuel M. T. Chakravarty | 2 | 666 | 41.89 |
| Gabriele Keller | 3 | 657 | 36.02 |