Memoization combinators using arrays for finite sub-domains of functions

Version on this page:0.6.0
LTS Haskell 8.20:0.6.0
Stackage Nightly 2017-06-28:0.6.0
Latest on Hackage:0.6.0
BSD3 licensed and maintained by Dominic Orchard

Module documentation for 0.6.0

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.


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'
Depends on:
Used by 1 package:
comments powered byDisqus