No CrossRef data available.
Article contents
Continuation-based compilation of functional languages for parallel machines
Published online by Cambridge University Press: 04 March 2009
Abstract
We tackle the problems of correctness and efficiency of paralled implementations of functional languages. We present a compilation technique described in terms of program transformations in the functional framework. The original functional expression is transformed into a functional term, which can be seen as traditional machine code. The main feature of the parallel implementation is the use of continuations. We introduce a parallel abstract machine describing lazy task creation in terms of exportation of continuations. The advantages of the approach are twofold: (1)correetness proofs are made simpler and (2) the implementation is efficient because the use of continuations reduces the task management overhead.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1992