Package Info

ghc-array-memoize


Memoization combinators using arrays for finite sub-domains of functions


Development/Libraries/Haskell

Memoization combinators are great for providing high-performance Haskell programs, but they can be even faster if memoization is performed on a finite, discrete domain since an array can then be used to store results.

This package provides various combinators for doing just this, including also combinators for quanitzing and discretizing Float/Double-valued functions.

Example:

' fib' :: (Int -> Int) -> Int -> Int fib' 0 = 1 fib' 1 = 1 fib' rec n = rec (n - 1) + rec (n - 2) fib :: Int -> Int fib = arrayMemoFix (0, 1000) fib' '.


License: BSD-2-Clause
URL: https://hackage.haskell.org/package/array-memoize

Categories

Releases

Package Version Update ID Released Package Hub Version Platforms Subpackages
0.6.0-bp150.2.4 info GA Release 2018-08-01 15
  • AArch64
  • ghc-array-memoize
  • ghc-array-memoize-devel
0.6.0-bp150.2.6 info GA Release 2018-07-30 15
  • ppc64le
  • x86-64
  • ghc-array-memoize
  • ghc-array-memoize-devel