Higher Order Flattening

@inproceedings{Leshchinskiy2006HigherOF,
  title={Higher Order Flattening},
  author={Roman Leshchinskiy and Manuel M. T. Chakravarty and Gabriele Keller},
  booktitle={International Conference on Computational Science},
  year={2006}
}
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 observa-ions 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. 
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

An approach to fast arrays in Haskell

G. Keller
2000

Programming Parallel Algorithms

Commun. ACM • 1996
View 1 Excerpt

Vector Models f

G. E. Blelloch
Data-Parallel Computing. MIT Press • 1990
View 1 Excerpt

Similar Papers

Loading similar papers…