@hackage adp-multi-monadiccp0.2.1

Subword construction in adp-multi using monadiccp

Categories
License
BSD-3-Clause
Maintainer
Maik Riechert
Links
Versions
- 0.2.1 Wed, 29 May 2013
- 0.2.0 Sat, 18 May 2013
- 0.1 Thu, 11 Apr 2013

Installation
In your cabal file:
Dependencies (4)
- base >=4 && <5
- containers >=0.4 && <0.6
- adp-multi >=0.2.3 && <0.3
- monadiccp >=0.7 && <0.8
Dependents (1)
@hackage/acme-everything

Package Flags

buildbenchmark

(off by default)

Build benchmark executable

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.

@hackage adp-multi-monadiccp0.2.1

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (4)

Dependents (1)

Package Flags