heap alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view heap alternatives based on common mentions on social networks and blogs.

Agda

10.0 9.8 heap VS Agda

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

10.0 4.8 heap VS hevm

Dapp, Seth, Hevm, and more

WorkOS - The modern identity platform for B2B SaaS

The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

Promo workos.com

miso

10.0 6.0 heap VS miso

:ramen: A tasty Haskell front-end framework
containers

9.8 6.2 heap VS containers

Assorted concrete container types
vinyl

9.7 0.0 heap VS vinyl

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

9.7 6.3 heap VS singletons

Fake dependent types in Haskell using singletons
fgl

9.6 6.6 heap VS fgl

A Functional Graph Library for Haskell
repa-scalar

9.5 0.0 heap VS repa-scalar

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

9.5 0.0 heap VS repa-array

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

9.5 0.0 heap VS repa-convert

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

9.5 0.0 heap VS repa-eval

High performance, regular, shape polymorphic parallel arrays.
cubical

9.4 0.0 heap VS cubical

Implementation of Univalence in Cubical Sets
parameterized-utils

9.1 6.1 heap VS parameterized-utils

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

9.0 0.0 heap VS hoq

A language based on homotopy type theory with an interval
ethereum-client-haskell

9.0 0.0 heap VS ethereum-client-haskell

A Haskell version of an Ethereum client
adjunctions

9.0 3.3 heap VS adjunctions

Simple adjunctions
psqueues

9.0 5.2 heap VS psqueues

Priority Search Queues in three different flavors for Haskell
distributive

8.9 2.7 heap VS distributive

Dual Traversable
type-level-sets

8.8 0.0 heap VS type-level-sets

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

8.7 0.0 heap VS bookkeeper

Anonymous records and overloaded labels
justified-containers

8.7 0.0 heap VS justified-containers

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

8.5 3.9 heap VS clafer

Clafer is a lightweight modeling language
EdisonAPI

8.4 3.7 heap VS EdisonAPI

Edison: A Library of Efficient Data Structures
ixset-typed

8.2 3.2 heap VS ixset-typed

More strongly typed variant of the ixset Haskell package
bytestring-trie

8.2 4.6 heap VS bytestring-trie

An efficient finite map from (byte)strings to values.
slist

8.2 0.0 heap VS slist

♾️ Sized list
void

8.1 0.0 heap VS void

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

8.0 0.0 heap VS heaps

Asymptotically optimal Brodal/Okasaki heaps
haggle

7.9 5.0 heap VS haggle

An efficient graph library for Haskell
hamtmap

7.9 0.0 heap VS hamtmap

DISCONTINUED. A purely functional and persistent hash map
knit

7.9 0.0 heap VS knit

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

7.7 0.0 heap VS bitset

A compact functional set data structure
nonempty-containers

7.7 3.1 heap VS nonempty-containers

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

7.7 0.0 heap VS multiset

multiset haskell package
algebra-checkers

7.5 0.0 heap VS algebra-checkers

checkers for algebra driven design
graphite

7.5 0.0 heap VS graphite

Haskell graphs and networks library
helf

7.3 3.3 heap VS helf

Haskell implementation of the Edinburgh Logical Framework
map-exts

7.3 0.0 heap VS map-exts

Extensions to Data.Map
rawr

7.2 0.0 heap VS rawr

Anonymous extensible records and variant types
data-r-tree

7.1 4.7 heap VS data-r-tree

Haskell implementatio of R-Trees
eliminators

7.1 4.5 heap VS eliminators

Dependently typed elimination functions using singletons
claferIG

6.8 3.9 heap VS claferIG

Support for reasoning on Clafer models by instantiation and counter example generation.
TypeCompose

6.8 0.0 heap VS TypeCompose

Type composition classes & instances & misc
mtl-c

6.7 0.0 heap VS mtl-c

Monad transformers in CPS
selections

6.7 0.0 heap VS selections

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

6.7 0.0 heap VS map-syntax

Syntax sugar and explicit semantics for statically defined maps
ixset

6.6 0.0 heap VS ixset

A Set type which supports multiple indexes
igraph

6.6 0.0 heap VS igraph

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

6.6 0.0 heap VS supermonad

A plugin for GHC to support super monads.
representable-functors

6.6 0.0 heap VS representable-functors

representable functors