Name
Abstract | ||
|---|---|---|
Many array-centric algorithms from computational science and engineering, especially those based on dynamic and irregular data structures, can be coded rather elegantly in a purely functional style. The challenge, when compared to imperative array languages, is performance. These lecture notes discuss the shortcomings of Haskell's standard arrays in this context and present an alternative approach that decouples array from list processing and is based on program transformation and generic programming. In particular, we will present (1) an array library that uses type analysis to achieve unboxing and flattening of data structures as well as (2) equational array fusion based on array combinators and compiler-driven rewrite rules. We will make use of a range of advanced language extensions to Haskell, such as multi-parameter type classes, functional dependencies, rewrite rules, unboxed values, and locally state-based computations. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/978-3-540-44833-4_2 | ADVANCED FUNCTIONAL PROGRAMMING |
Field | DocType | Volume |
Data structure,Computational Science and Engineering,Programming language,Computer science,Theoretical computer science,Haskell,Purely functional,Parallel array,Type constructor | Conference | 2638 |
ISSN | Citations | PageRank |
0302-9743 | 13 | 1.03 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel M. T. Chakravarty | 1 | 666 | 41.89 |
| Gabriele Keller | 2 | 657 | 36.02 |