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]

Modules

[Last Documentation]

  • Lib

Flags

Manual Flags

NameDescriptionDefault
development

Enable `-Werror`

Disabled

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

Downloads

Maintainer's Corner

Package maintainers

  • No current members of group

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.0.5, 0.1.0.6, 0.1.0.7, 0.1.0.8, 0.1.0.9
Dependencies base (>=4.7 && <5), composition-prelude [details]
License BSD-3-Clause
Copyright Copyright: (c) 2017 Vanessa McHale
Author Vanessa McHale
Maintainer vamchale@gmail.com
Category Numerics
Home page https://github.com//fast-combinatorics#readme
Source repo head: git clone https://github.com//fast-combinatorics
Uploaded by vmchale at 2017-12-30T17:10:32Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5489 total (25 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-0.1.0.0

[back to package description]

fast-combinatorics

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.

Building

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