Simon Peyton Jones, Thomas Nordin, Dino Oliva (auth.), Chris Clack, Kevin Hammond, Tony Davie (eds.)3540648496, 9783540648499
The 21 revised full papers presented were selected from the 34 papers accepted for presentation at the workshop during a second round of thorough a-posteriori reviewing. The book is divided in sections on compilation, types, benchmarking and profiling, parallelism, interaction, language design, and garbage collection.
Table of contents :
C–: A portable assembly language….Pages 1-19
The brisk machine: A simplified STG machine….Pages 20-38
A Haskell to Java Virtual Machine code compiler….Pages 39-52
Common subexpressions are uncommon in lazy functional languages….Pages 53-71
With-loop-folding in Sac-condensing consecutive array operations….Pages 72-91
Types for register allocation….Pages 92-111
Types for 0, 1 or many uses….Pages 112-122
Fully persistent graphs—which one to choose?….Pages 123-140
Auburn: A kit for benchmarking functional data structures….Pages 141-159
Complete and partial redex trails of functional computations….Pages 160-177
Engineering large parallel functional programs….Pages 178-197
Parallelising a large functional program or: Keeping LOLITA busy….Pages 198-213
Naira: A parallel 2 Haskell compiler….Pages 214-230
Lazy thread and task creation in parallel graph-reduction….Pages 231-249
DREAM: The distributed Eden abstract machine….Pages 250-269
Using multicasting for optimising data-parallelism….Pages 270-284
Using concurrent Haskell to develop views over an active repository….Pages 285-303
Interactive functional objects in Clean….Pages 304-321
Programming in the large: The algebraic-functional language Opal 2α….Pages 322-337
Context patterns, part II….Pages 338-357
A compacting garbage collector for unidirectional heaps….Pages 358-374
Reviews
There are no reviews yet.