Popularity

2.9

Declining

Activity

0.0

Stable

Stars 6

Watchers 2

Forks 0

Last Commit over 9 years ago

Monthly Downloads: 11

Programming language: Haskell

License: BSD 3-clause "New" or "Revised" License

Tags: Syntax

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

10.0 9.6 array-memoize VS Agda

Agda is a dependently typed programming language / interactive theorem prover.
hevm

10.0 5.7 array-memoize VS hevm

Dapp, Seth, Hevm, and more

Updating dependencies is time-consuming.

Solutions like Dependabot or Renovate update but don't merge dependencies. You need to do it manually while it could be fully automated! Add a Merge Queue to your workflow and stop caring about PR management & merging. Try Mergify for free.

Promo blog.mergify.com

miso

10.0 0.0 array-memoize VS miso

:ramen: A tasty Haskell front-end framework
containers

9.8 7.8 array-memoize VS containers

Assorted concrete container types
vinyl

9.7 0.0 array-memoize VS vinyl

Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
singletons

9.7 0.0 array-memoize VS singletons

Fake dependent types in Haskell using singletons
fgl

9.6 0.0 array-memoize VS fgl

A Functional Graph Library for Haskell
repa-eval

9.4 0.0 array-memoize VS repa-eval

High performance, regular, shape polymorphic parallel arrays.
repa-scalar

9.4 0.0 array-memoize VS repa-scalar

High performance, regular, shape polymorphic parallel arrays.
repa-convert

9.4 0.0 array-memoize VS repa-convert

High performance, regular, shape polymorphic parallel arrays.
repa-array

9.4 0.0 array-memoize VS repa-array

High performance, regular, shape polymorphic parallel arrays.
cubical

9.4 0.0 array-memoize VS cubical

Implementation of Univalence in Cubical Sets
parameterized-utils

9.1 0.0 array-memoize VS parameterized-utils

A set of utilities for using indexed types including containers, equality, and comparison.
adjunctions

9.0 0.0 array-memoize VS adjunctions

Simple adjunctions
ethereum-client-haskell

9.0 0.0 array-memoize VS ethereum-client-haskell

A Haskell version of an Ethereum client
psqueues

9.0 0.0 array-memoize VS psqueues

Priority Search Queues in three different flavors for Haskell
hoq

8.9 0.0 array-memoize VS hoq

A language based on homotopy type theory with an interval
distributive

8.9 0.0 array-memoize VS distributive

Dual Traversable
bookkeeper

8.8 0.0 array-memoize VS bookkeeper

Anonymous records and overloaded labels
type-level-sets

8.8 0.0 array-memoize VS type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations)
justified-containers

8.7 0.0 array-memoize VS justified-containers

Standard containers, with keys that carry type-level proofs of their own presence.
clafer

8.6 0.0 array-memoize VS clafer

Clafer is a lightweight modeling language
EdisonAPI

8.5 0.0 array-memoize VS EdisonAPI

Edison: A Library of Efficient Data Structures
slist

8.2 0.0 array-memoize VS slist

♾️ Sized list
bytestring-trie

8.2 0.0 array-memoize VS bytestring-trie

An efficient finite map from (byte)strings to values.
ixset-typed

8.2 3.6 array-memoize VS ixset-typed

More strongly typed variant of the ixset Haskell package
void

8.1 0.0 array-memoize VS void

Provides Data.Void, which is in base since ghc 7.8 or so
heaps

8.0 0.0 array-memoize VS heaps

Asymptotically optimal Brodal/Okasaki heaps
hamtmap

7.9 0.0 array-memoize VS hamtmap

A purely functional and persistent hash map
knit

7.9 0.0 array-memoize VS knit

Ties the knot on data structures that reference each other by unique keys
haggle

7.9 0.0 array-memoize VS haggle

An efficient graph library for Haskell
bitset

7.8 0.0 array-memoize VS bitset

A compact functional set data structure
multiset

7.7 0.0 array-memoize VS multiset

multiset haskell package
graphite

7.6 0.0 array-memoize VS graphite

Haskell graphs and networks library
nonempty-containers

7.6 0.0 array-memoize VS nonempty-containers

Efficient non-empty variants of containers data types, with full API
algebra-checkers

7.5 0.0 array-memoize VS algebra-checkers

checkers for algebra driven design
map-exts

7.4 0.0 array-memoize VS map-exts

Extensions to Data.Map
rawr

7.3 0.0 array-memoize VS rawr

Anonymous extensible records and variant types
data-r-tree

7.2 0.0 array-memoize VS data-r-tree

Haskell implementatio of R-Trees
helf

7.2 0.0 array-memoize VS helf

Haskell implementation of the Edinburgh Logical Framework
TypeCompose

7.0 0.0 array-memoize VS TypeCompose

Type composition classes & instances & misc
eliminators

7.0 0.0 array-memoize VS eliminators

Dependently typed elimination functions using singletons
claferIG

6.9 0.0 array-memoize VS claferIG

Support for reasoning on Clafer models by instantiation and counter example generation.
mtl-c

6.8 0.0 array-memoize VS mtl-c

Monad transformers in CPS
ixset

6.7 0.0 array-memoize VS ixset

A Set type which supports multiple indexes
igraph

6.7 0.0 array-memoize VS igraph

Incomplete Haskell bindings to the igraph library (which is written in C)
supermonad

6.7 0.0 array-memoize VS supermonad

A plugin for GHC to support super monads.
selections

6.7 0.0 array-memoize VS selections

Haskell Package for operating with selections over an underlying functor
map-syntax

6.7 0.0 array-memoize VS map-syntax

Syntax sugar and explicit semantics for statically defined maps
representable-functors

6.7 0.0 array-memoize VS representable-functors

representable functors

Do you think we are missing an alternative of array-memoize or a related project?

Add another 'Data Structures' Package

Popular Comparisons

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

array-memoize

Memoize discrete functions (restricted to a finite domain) using arrays

array-memoize alternatives and similar packages

Popular Comparisons

README