fast-combinatorics: Fast combinatorics.

[ bsd3, library, numerics ] [ Propose Tags ]

Fast combinatorics code with a high level of safety guaranteed by writing it in ATS.

[Skip to Readme]


  • Lib


Manual Flags


Enable `-Werror`


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


  • No Candidates
Versions [RSS],,,,,,,,,
Dependencies base (>=4.7 && <5), composition-prelude [details]
License BSD-3-Clause
Copyright Copyright: (c) 2017 Vanessa McHale
Author Vanessa McHale
Category Numerics
Home page
Source repo head: git clone
Uploaded by vmchale at 2017-12-30T17:10:32Z
Distributions NixOS:
Downloads 5171 total (23 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2018-01-01 [all 3 reports]

Readme for fast-combinatorics-

[back to package description]


This is a library for fast combinatorics using ATS. You may need to download the relevant ATS libraries here if linking fails.

Currently it is in-progress, being somewhat constrained by the fact that I have yet to figure out how to share arbitrary-precision types between ATS and Haskell.


The Haskell library comes with the C bundled, however you may wish to build from source if you are hacking on the library. To that end, you can install stack, patscc , and pats-filter and build with

 $ ./shake.hs