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

You will also likely want to install GHC as well as cabal.

Documentation

Using the ATS library

One of the nice things about a Haskell wrapper is that some of Haskell's tooling/libraries may be used. In particular, you may like to interact with the library via a REPL, viz.

 $ cabal new-repl

Using the Haskell library

You may wish to read the ATS source code for an indication of what sorts of things ATS allows us to prove things about our programs, such as proofs of termination.

There are also a few caveats: note that all results and arguments must be of the Int type. This unfortunate constraint will hopefully be fixed in the future, but right now it limits the usefulness of the library.