knead: Repa-like array processing using LLVM JIT

[ bsd3, data-structures, library ] [ Propose Tags ]

This library processes arrays like Repa and Accelerate, but it uses the just-in-time compiler of LLVM for generating the machine code. That is, you get very efficient vectorised code that can be run without a GPU. You do not need to care about inlining and strictness annotations, because the LLVM code is by default inlined and strict. The package is intended as the basis for an LLVM backend for the Accelerate framework.


Known deficiencies:

The name of the package is inspired by the visualization of typical operations like reshaping, collapsing a dimension and extruding another one.

Versions [RSS] [faq] 0.2,, 0.2.1, 0.2.2, 0.2.3, 0.3, 0.4, 0.4.1, 0.4.2, 0.5 (info)
Dependencies base (==4.*), bool8 (==0.0.*), llvm-extra (==0.8.*), llvm-tf (>=3.1.1 && <3.2), storable-record (>=0.0.3 && <0.1), storable-tuple (==0.0.*), tfp (==1.0.*), transformers (>=0.3 && <0.6), utility-ht (>=0.0.1 && <0.1) [details]
License BSD-3-Clause
Author Henning Thielemann <>
Maintainer Henning Thielemann <>
Category Data Structures
Home page
Source repo this: darcs get --tag 0.3
head: darcs get
Uploaded by HenningThielemann at 2018-10-07T07:34:09Z
Distributions NixOS:0.5
Downloads 3805 total (30 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees