Regular, shape-polymorphic, parallel arrays in Haskell

DOI10.1145/1863543.1863582MaRDI QIDQ5176945zbMATH OpenOpenAlexFDO

Authors Gabriele Keller, Manuel M. T. Chakravarty, Roman Leshchinskiy, Ben Lippmeier, Simon Peyton-Jones

Publication date 5 March 2015

Published in Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1863543.1863582

zbMATH Keywords

arraysdata parallelismHaskell

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05)

Recommendations

• An approach to fast arrays in Haskell
• Functional array fusion
• Multi-dimensional arrays with levels
• scientific article; zbMATH DE number 1875371
• Harnessing the multicores: nested data parallelism in Haskell

Cited in

(15)

• Combining deep and shallow embedding of domain-specific languages
• On building cyclic and shared structures in Haskell
• Productivity, performance, and portability for computational fluid dynamics applications
• Algebraic dynamic programming on trees
• Algebraic program semantics for supercomputing
• APLicative Programming with Naperian Functors
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study
• Multi-dimensional arrays with levels
• Functional array fusion
• Automatic SIMD vectorization for Haskell
• A language for hierarchical data parallel design-space exploration on GPUs
• An approach to fast arrays in Haskell
• An array-oriented language with static rank polymorphism
• Linearity and uniqueness: an entente cordiale
• Domain-specific tensor languages

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Regular, shape-polymorphic, parallel arrays in Haskell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176945)