An inductive-form set constraint solver

Latest on Hackage:

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Tristan Ravitch
Maintained by travitch@cs.wisc.edu

This is an implementation of an (inclusion) set constraint solver. Set constraints are a convenient and efficient way to specify and solve graph reachability problems.

See the Constraints.Set.Solver module for detailed documentation.

Depends on 3 packages:
Used by 1 package:
comments powered byDisqus