Paper Info
Title
HaskSkel: Algorithmic Skeletons in Haskell
Abstract
This paper introduces HaskSkel: an implementation of algorithmic skeletons for the non-strict functional language Haskell. The implementation is based on the evaluation strategy mechanism for Glasgow Parallel Haskell (GpH), and has been tested in both simulated and real parallel settings. Compared with most skeleton libraries, HaskSkel has a number of novel and interesting features: (strict) skeletons have been embedded in a non-strict language; the cost models and implementation modules are written entirely using standard Haskell (and may therefore be modified or extended by the user rather than being a fixed part of the compiler); it is possible to nest skeletons (though we have not yet defined nested cost models to support this); and the library is not restricted to a single bulk data type. Finally, in contrast with most other skeletal approaches, it is possible to freely mix HaskSkel skeletons with other parallel constructs that have been introduced using standard evaluation strategies.
Year
DOI
Venue
1999
10.1007/10722298_11
IFL
Keywords
Field
DocType
algorithmic skeletons,data type,functional language
Evaluation strategy,Programming language,Functional programming,Computer science,Algorithmic skeleton,Compiler,Theoretical computer science,Data type,Haskell
Conference
Volume
ISSN
ISBN
1868
0302-9743
3-540-67864-6
Citations 
PageRank 
References 
7
0.82
11
Authors
2
Name
Order
Citations
PageRank
Kevin Hammond127633.68
Álvaro J. Rebón Portillo2242.64