adp-multi-monadiccp: Subword construction in adp-multi using monadiccp

[ algorithms, bioinformatics, bsd3, data-structures, library ] [ Propose Tags ]

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.


Automatic Flags

Build benchmark executable


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


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.1, 0.2.0, 0.2.1
Dependencies adp-multi (>=0.2.3 && <0.3), base (>=4 && <5), containers (>=0.4 && <0.6), criterion (>=0.6 && <0.7), deepseq (>=, monadiccp (>=0.7 && <0.8), mtl (>=2.0 && <2.2), QuickCheck (>=2.5 && <2.6), test-framework (>=0.8 && <0.9), test-framework-quickcheck2 (>=0.3 && <0.4) [details]
License BSD-3-Clause
Copyright Maik Riechert, 2013
Author Maik Riechert
Maintainer Maik Riechert
Category Algorithms, Data Structures, Bioinformatics
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by MaikRiechert at 2013-05-29T14:28:41Z
Reverse Dependencies 1 direct, 0 indirect [details]
Executables adp-multi-monadiccp-benchmarks
Downloads 2915 total (9 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]