sparse: A playground of sparse linear algebra primitives using Morton ordering

[ bsd3, data, library, vector ] [ Propose Tags ]

A playground of sparse linear algebra primitives using Morton ordering

The design of this library is described in the series "Revisiting Matrix Multiplication" on FP Complete's School of Haskell.

[Skip to Readme]
Versions 0.5, 0.6, 0.7,, 0.9, 0.9.1, 0.9.2
Change log CHANGELOG.markdown
Dependencies base (==4.*), contravariant (>=0.4.2 && <1), deepseq (>=1.1 && <1.4), hybrid-vectors (>=0.1 && <1), lens (>=3.9 && <4), primitive (==0.5.*), transformers (==0.3.*), vector (==0.10.*), vector-algorithms (==0.5.*) [details]
License BSD-3-Clause
Copyright Copyright (C) 2013 Edward A. Kmett
Author Edward A. Kmett
Maintainer Edward A. Kmett <>
Category Data, Vector
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by EdwardKmett at Sun Aug 25 18:13:07 UTC 2013
Distributions NixOS:0.9.2
Downloads 2535 total (12 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI





Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees

Readme for sparse-

[back to package description]


Build Status

A sparse linear algebra playground based on Morton ordering.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on

-Edward Kmett