array-memoize alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view array-memoize alternatives based on common mentions on social networks and blogs.
-
Agda
Agda is a dependently typed programming language / interactive theorem prover. -
-
-
vinyl
Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. -
-
repa-scalar
High performance, regular, shape polymorphic parallel arrays. -
repa-eval
High performance, regular, shape polymorphic parallel arrays. -
repa-array
High performance, regular, shape polymorphic parallel arrays. -
repa-convert
High performance, regular, shape polymorphic parallel arrays. -
parameterized-utils
A set of utilities for using indexed types including containers, equality, and comparison. -
psqueues
Priority Search Queues in three different flavors for Haskell -
ethereum-client-haskell
A Haskell version of an Ethereum client -
-
type-level-sets
Type-level sets for Haskell (with value-level counterparts and various operations) -
justified-containers
Standard containers, with keys that carry type-level proofs of their own presence. -
-
-
bytestring-trie
An efficient finite map from (byte)strings to values. -
ixset-typed
More strongly typed variant of the ixset Haskell package -
knit
Ties the knot on data structures that reference each other by unique keys -
-
nonempty-containers
Efficient non-empty variants of containers data types, with full API -
-
claferIG
Support for reasoning on Clafer models by instantiation and counter example generation. -
eliminators
Dependently typed elimination functions using singletons -
-
igraph
Incomplete Haskell bindings to the igraph library (which is written in C) -
selections
Haskell Package for operating with selections over an underlying functor -
map-syntax
Syntax sugar and explicit semantics for statically defined maps
Static code analysis for 29 languages.
Do you think we are missing an alternative of array-memoize or a related project?
|
Access the most powerful time series database as a service
sponsored
www.influxdata.com
|
Popular Comparisons
-
data-clistvspomaps
-
naperianvsjustified-containers
-
ethereum-analyzervsethereum-client-haskell
-
rawrvsgraphite
-
bytestring-trievsgraphite
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
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 as an array can then be used.
This package provides various combinators for doing just this, including also combinators for quanitzing and discretizing Float/Double-valued functions.
Example:
fibA :: Int -> Int fibA 0 = 1 fibA 1 = 1 fibA n = fibB (n - 1) + fibB (n - 2)
fibB = arrayMemo (0, 1000) fibA