Chapter

Computational Science – ICCS 2006

Volume 3992 of the series Lecture Notes in Computer Science pp 920-928

Higher Order Flattening

  • Roman LeshchinskiyAffiliated withSchool of Computer Science and Engineering, Programming Languages and Systems, University of New South Wales
  • , Manuel M. T. ChakravartyAffiliated withSchool of Computer Science and Engineering, Programming Languages and Systems, University of New South Wales
  • , Gabriele KellerAffiliated withSchool of Computer Science and Engineering, Programming Languages and Systems, University of New South Wales

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.