Name
Abstract | ||
|---|---|---|
We discuss a language-based cost model for array programs build on the notions of work complexity and parallel depth. The programs operate over data structures comprising nested arrays and recursive product-sum types. In a purely functional setting, such programs can be implemented by way of the flattening transformation that converts codes over nested arrays into vectorised code over flat arrays. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1142/S0129626402000951 | Parallel Processing Letters |
Keywords | Field | DocType |
functional programming,data structure,flattening | Data structure,Flattening,Program transformation,Functional programming,Tuple,Computer science,Parallel computing,Activity-based costing,Nested arrays,Recursion,Distributed computing | Journal |
Volume | Issue | Citations |
12 | 2 | 5 |
PageRank | References | Authors |
0.85 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Lechtchinsky | 1 | 23 | 1.85 |
| Manuel M. T. Chakravarty | 2 | 666 | 41.89 |
| Gabriele Keller | 3 | 657 | 36.02 |