Regular, shape-polymorphic, parallel arrays in Haskell
From MaRDI portal
Publication:5176945
DOI10.1145/1863543.1863582zbMath1323.68127OpenAlexW2148599839MaRDI QIDQ5176945
Ben Lippmeier, Roman Leshchinskiy, Gabriele Keller, Manuel M. T. Chakravarty, Simon L. 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
Related Items (8)
Algebraic dynamic programming on trees ⋮ Linearity and uniqueness: an entente cordiale ⋮ A language for hierarchical data parallel design-space exploration on GPUs ⋮ APLicative Programming with Naperian Functors ⋮ Combining deep and shallow embedding of domain-specific languages ⋮ Productivity, performance, and portability for computational fluid dynamics applications ⋮ Algebraic Program Semantics for Supercomputing ⋮ Lambda calculus with algebraic simplification for reduction parallelisation: Extended study
Uses Software
This page was built for publication: Regular, shape-polymorphic, parallel arrays in Haskell