Partial vectorisation of Haskell programs

Courtesy Lambda the Ultimate - Programming Languages Weblog  Sun, 07/20/2008 - 10:05

Partial vectorisation of Haskell programs .

Manuel M. T. Chakravarty, Roman Leshchinskiy, Simon Peyton Jones, and Gabriele Keller, Proc ACM Workshop on Declarative Aspects of Multicore Programming, San Francisco, Jan 2008.

Vectorisation for functional programs, also called the flattening transformation, relies on drastically reordering computations and restructuring the representation of data types.

As a result, it only applies to the purely functional core of a fully-fledged functional language, such as Haskell or ML.

A concrete implementation needs to apply...


 

More related items

[ANN] FP Day 2011 - October 14th. Cambridge, UK.
Announcing FP Day 2011 a new 1 day Functional Programming event. The event covers the practical application of FP in Haskell, F# and Clojure. Keynote speakers are Simon-Peyton-Jones and Don...

A Monadic Framework for Delimited Continuations
A Monadic Framework for Delimited Continuations (PDF), R. Kent Dybvig, Simon Peyton Jones, Amr Sabry. TR, June 2005. Delimited continuations are more expressive than traditional abortive...

Generative Type Abstraction and Type-level Computation
Generative Type Abstraction and Type-level Computation (Extended Version), by Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Steve Zdancewic: Modular languages support...


 

Post new comment

The content of this field is kept private and will not be shown publicly.
computer-internet.marc8.com