The DP package

[Tags: bsd3, library]

This module provides a simple declarative framework for dynamic programming optimization. Users specify a dynamic programming problem as a simple haskell function that looks very similar to mathematical recursion used in texts. The specification is then translated into a form that can be solved efficiently by a modular solver. Includes solvers using memoization, strict and lazy ordered tables, and recursion with a range of data structures for the underlying table. This method also separates processing steps like pruning and debugging from the recursion itself, and this package contains preliminary tools for beam search and tracing.


Versions0.1, 0.1.1
Dependenciesarray, base (<=4.0), containers, list-tries, mtl (>1.1), QuickCheck (>2.0), safe, semiring (>=0.3)
AuthorSasha Rush
Maintainer<srush at mit dot edu>
CategoryAlgorithms, Math, Natural Language Processing
Home page
UploadedMon Mar 8 02:24:54 UTC 2010 by SashaRush
Downloads408 total (42 in last 30 days)
StatusDocs pending
Build status unknown [no reports yet]



Maintainers' corner

For package maintainers and hackage trustees