The adp-multi-monadiccp package

[ Tags: 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.


Versions 0.1, 0.2.0, 0.2.1
Dependencies adp-multi (>=0.2.3 && <0.3), base (==4.*), containers (>=0.4 && <0.6), criterion (==0.6.*), deepseq (>=, monadiccp (==0.7.*), mtl (>=2.0 && <2.2), QuickCheck (==2.5.*), test-framework (==0.8.*), test-framework-quickcheck2 (==0.3.*) [details]
License BSD3
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 Wed May 29 14:28:41 UTC 2013 by MaikRiechert
Distributions NixOS:0.2.1
Executables adp-multi-monadiccp-benchmarks
Downloads 1326 total (21 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI





Build benchmark executable


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


Maintainer's Corner

For package maintainers and hackage trustees