adp-multi-monadiccp: Subword construction in adp-multi using monadiccp
[ algorithms, bioinformatics, bsd3, data-structures, library ]
[ Propose Tags ]
[ Report a vulnerability ]
This is an experimental subword construction algorithm for the adp-multi package. It uses the constraint programming framework monadiccp with the constraint solver OvertonFD. It is slower than the built-in algorithm in adp-multi and serves research purposes. Use it by importing ADP.Multi.Constraint.All instead of ADP.Multi.Rewriting.All in your grammar files.
Modules
- ADP
- Multi
- Constraint
- ADP.Multi.Constraint.All
- ADP.Multi.Constraint.Combinators
- ADP.Multi.Constraint.ConstraintSolver
- Constraint
- Multi
Downloads
- adp-multi-monadiccp-0.1.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.1, 0.2.0, 0.2.1 |
---|---|
Dependencies | adp-multi (>=0.2 && <0.3), base (>=4 && <5), containers (>=0.4 && <0.6), monadiccp (>=0.7 && <0.8) [details] |
Tested with | ghc ==7.4.1 |
License | BSD-3-Clause |
Copyright | Maik Riechert, 2013 |
Author | Maik Riechert |
Maintainer | Maik Riechert |
Category | Algorithms, Data Structures, Bioinformatics |
Home page | http://adp-multi.ruhoh.com |
Bug tracker | https://github.com/neothemachine/adp-multi-monadiccp/issues |
Source repo | head: git clone git://github.com/neothemachine/adp-multi-monadiccp.git |
Uploaded | by MaikRiechert at 2013-04-11T19:53:50Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 2978 total (5 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs not available [build log] All reported builds failed as of 2016-12-21 [all 8 reports] |