knead: Repa-like array processing using LLVM JIT

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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.

Highlights:

Known deficiencies:

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

Properties

Versions 0.2, 0.2.0.1, 0.2.1, 0.2.2, 0.2.3, 0.3, 0.3, 0.4, 0.4.1, 0.4.2, 0.5
Change log None available
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 <haskell@henning-thielemann.de>
Maintainer Henning Thielemann <haskell@henning-thielemann.de>
Category Data Structures
Home page http://hub.darcs.net/thielema/knead/
Source repo this: darcs get http://hub.darcs.net/thielema/knead/ --tag 0.3
head: darcs get http://hub.darcs.net/thielema/knead/
Uploaded by HenningThielemann at 2018-10-07T07:33:29Z

Modules

Downloads

Maintainer's Corner

For package maintainers and hackage trustees