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.


Versions 0.1, 0.1.1
Dependencies array, base (<=4.0), containers, list-tries, mtl (>1.1), QuickCheck (>2.0), safe, semiring (>=0.3) [details]
License BSD3
Author Sasha Rush
Maintainer <srush at mit dot edu>
Stability Unknown
Category Algorithms, Math, Natural Language Processing
Home page
Uploaded Mon Mar 8 02:24:54 UTC 2010 by SashaRush
Distributions NixOS:0.1.1
Downloads 727 total (6 in the last 30 days)
0 []
Status Docs not available [build log]
All reported builds failed as of 2016-12-30 [all 6 reports]


  • Data
    • Data.DP
      • Data.DP.Examples
        • Data.DP.Examples.Bigram
        • Data.DP.Examples.CheckerBoard
        • Data.DP.Examples.Fibonacci
        • Data.DP.Examples.HMM
      • Data.DP.Solvers
        • Data.DP.Solvers.Beam
        • Data.DP.Solvers.BottomUpLazy
        • Data.DP.Solvers.BottomUpStrict
        • Data.DP.Solvers.Recursive
        • Data.DP.Solvers.TopDown


Maintainer's Corner

For package maintainers and hackage trustees