Higher Order Flattening

  • Roman Leshchinskiy
  • Manuel M. T. Chakravarty
  • Gabriele Keller
Conference paper

DOI: 10.1007/11758525_122

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3992)
Cite this paper as:
Leshchinskiy R., Chakravarty M.M.T., Keller G. (2006) Higher Order Flattening. In: Alexandrov V.N., van Albada G.D., Sloot P.M.A., Dongarra J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3992. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Roman Leshchinskiy
    • 1
  • Manuel M. T. Chakravarty
    • 1
  • Gabriele Keller
    • 1
  1. 1.School of Computer Science and Engineering, Programming Languages and SystemsUniversity of New South WalesAustralia

Personalised recommendations