psqueues alternatives and similar packages

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

• Agda

  10.0 9.7 psqueues VS Agda

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

• miso

  10.0 7.1 psqueues VS miso

  :ramen: A tasty Haskell front-end framework

Run Linux Software Faster and Safer than Linux with Unikernels

Promo github.com/nanovms



• hevm

  9.9 9.8 psqueues VS hevm

  Dapp, Seth, Hevm, and more
  

• containers

  9.8 5.3 psqueues VS containers

  Assorted concrete container types
  

• vinyl

  9.7 5.8 psqueues VS vinyl

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

• singletons

  9.7 4.9 psqueues VS singletons

  Fake dependent types in Haskell using singletons

• fgl

  9.6 0.0 psqueues VS fgl

  A Functional Graph Library for Haskell
  

• repa-convert

  9.5 0.0 psqueues VS repa-convert

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-scalar

  9.5 0.0 psqueues VS repa-scalar

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-array

  9.5 0.0 psqueues VS repa-array

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-eval

  9.5 0.0 psqueues VS repa-eval

  High performance, regular, shape polymorphic parallel arrays.
  

• cubical

  9.4 0.0 psqueues VS cubical

  Implementation of Univalence in Cubical Sets

• parameterized-utils

  9.2 7.2 psqueues VS parameterized-utils

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

• distributive

  9.0 9.0 psqueues VS distributive

  Dual Traversable

• ethereum-client-haskell

  9.0 0.0 psqueues VS ethereum-client-haskell

  A Haskell version of an Ethereum client

• adjunctions

  9.0 2.1 psqueues VS adjunctions

  Simple adjunctions

• hoq

  9.0 0.0 psqueues VS hoq

  A language based on homotopy type theory with an interval

• bookkeeper

  8.8 0.0 psqueues VS bookkeeper

  Anonymous records and overloaded labels
  

• clafer

  8.7 0.0 psqueues VS clafer

  Clafer is a lightweight modeling language
  

• type-level-sets

  8.6 4.4 psqueues VS type-level-sets

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

• EdisonAPI

  8.5 0.0 psqueues VS EdisonAPI

  Edison: A Library of Efficient Data Structures

• justified-containers

  8.5 0.0 psqueues VS justified-containers

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

• slist

  8.4 0.1 psqueues VS slist

  ♾️ Sized list
  

• ixset-typed

  8.2 0.0 psqueues VS ixset-typed

  More strongly typed variant of the ixset Haskell package
  

• void

  8.1 0.0 psqueues VS void

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

• heaps

  8.0 0.0 psqueues VS heaps

  Asymptotically optimal Brodal/Okasaki heaps

• bitset

  8.0 0.0 psqueues VS bitset

  A compact functional set data structure
  

• bytestring-trie

  8.0 0.0 psqueues VS bytestring-trie

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

• knit

  7.9 0.0 psqueues VS knit

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

• hamtmap

  7.9 0.0 psqueues VS hamtmap

  A purely functional and persistent hash map

• multiset

  7.8 0.0 psqueues VS multiset

  multiset haskell package

• graphite

  7.7 0.0 psqueues VS graphite

  Haskell graphs and networks library

• algebra-checkers

  7.6 0.0 psqueues VS algebra-checkers

  checkers for algebra driven design

• haggle

  7.5 0.8 psqueues VS haggle

  An efficient graph library for Haskell

• map-exts

  7.5 0.0 psqueues VS map-exts

  Extensions to Data.Map
  

• data-r-tree

  7.4 0.0 psqueues VS data-r-tree

  Haskell implementatio of R-Trees

• rawr

  7.3 0.0 psqueues VS rawr

  Anonymous extensible records and variant types

• eliminators

  7.3 0.0 psqueues VS eliminators

  Dependently typed elimination functions using singletons

• helf

  7.3 4.2 psqueues VS helf

  Haskell implementation of the Edinburgh Logical Framework

• nonempty-containers

  7.3 4.2 psqueues VS nonempty-containers

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

• claferIG

  7.2 0.0 psqueues VS claferIG

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

• ixset

  6.8 0.0 psqueues VS ixset

  A Set type which supports multiple indexes
  

• hw-fingertree-strict

  6.7 0.0 psqueues VS hw-fingertree-strict

  Generic strict finger-tree structure
  

• mtl-c

  6.7 0.0 psqueues VS mtl-c

  Monad transformers in CPS

• map-syntax

  6.7 0.0 psqueues VS map-syntax

  Syntax sugar and explicit semantics for statically defined maps

• representable-functors

  6.7 0.0 psqueues VS representable-functors

  representable functors

• igraph

  6.5 0.0 psqueues VS igraph

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

• selections

  6.5 0.0 psqueues VS selections

  Haskell Package for operating with selections over an underlying functor

• supermonad

  6.4 0.0 psqueues VS supermonad

  A plugin for GHC to support super monads.

• ethereum-analyzer

  6.4 0.0 psqueues VS ethereum-analyzer

  An Ethereum contract analyzer.

Do you think we are missing an alternative of psqueues or a related project?

Add another 'Data Structures' Package

Popular Comparisons

• pomaps
  vs
  data-clist
• naperian
  vs
  justified-containers
• ethereum-analyzer
  vs
  ethereum-client-haskell
• graphite
  vs
  rawr
• graphite
  vs
  vinyl