ifscs: An inductive-form set constraint solver
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.
Downloads
- ifscs-0.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.2.0.0 |
|---|---|
| Dependencies | base (>=4 && <5), containers, failure (>=0.2 && <0.3) [details] |
| License | BSD-3-Clause |
| Author | Tristan Ravitch |
| Maintainer | travitch@cs.wisc.edu |
| Category | Constraints |
| Uploaded | by TristanRavitch at 2013-10-22T05:20:01Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 1 indirect [details] |
| Downloads | 1445 total (2 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Successful builds reported [all 1 reports] |