EdisonAPI alternatives and similar packages

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

• Agda

  10.0 9.9 EdisonAPI VS Agda

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

• hevm

  10.0 2.4 EdisonAPI VS hevm

  Dapp, Seth, Hevm, and more
  

CodeRabbit: AI Code Reviews for Developers

Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.

Promo coderabbit.ai



• miso

  10.0 8.9 EdisonAPI VS miso

  :ramen: A tasty Haskell front-end framework
  

• containers

  9.8 8.8 EdisonAPI VS containers

  Assorted concrete container types
  

• singletons

  9.7 7.5 EdisonAPI VS singletons

  Fake dependent types in Haskell using singletons
  

• vinyl

  9.7 0.0 EdisonAPI VS vinyl

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

• fgl

  9.6 4.7 EdisonAPI VS fgl

  A Functional Graph Library for Haskell
  

• repa-array

  9.4 6.3 EdisonAPI VS repa-array

  High performance, regular, shape polymorphic parallel arrays.
  

• cubical

  9.4 0.0 EdisonAPI VS cubical

  Implementation of Univalence in Cubical Sets

• repa-eval

  9.4 6.3 EdisonAPI VS repa-eval

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-scalar

  9.4 6.3 EdisonAPI VS repa-scalar

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-convert

  9.4 6.3 EdisonAPI VS repa-convert

  High performance, regular, shape polymorphic parallel arrays.
  

• parameterized-utils

  9.1 7.0 EdisonAPI VS parameterized-utils

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

• psqueues

  9.0 5.4 EdisonAPI VS psqueues

  Priority Search Queues in three different flavors for Haskell
  

• adjunctions

  9.0 3.3 EdisonAPI VS adjunctions

  Simple adjunctions

• distributive

  8.9 2.7 EdisonAPI VS distributive

  Dual Traversable
  

• ethereum-client-haskell

  8.9 0.0 EdisonAPI VS ethereum-client-haskell

  A Haskell version of an Ethereum client
  

• hoq

  8.9 0.0 EdisonAPI VS hoq

  A language based on homotopy type theory with an interval

• type-level-sets

  8.8 0.0 EdisonAPI VS type-level-sets

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

• bookkeeper

  8.7 0.0 EdisonAPI VS bookkeeper

  Anonymous records and overloaded labels
  

• justified-containers

  8.6 0.0 EdisonAPI VS justified-containers

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

• clafer

  8.5 2.4 EdisonAPI VS clafer

  Clafer is a lightweight modeling language
  

• ixset-typed

  8.3 0.0 EdisonAPI VS ixset-typed

  More strongly typed variant of the ixset Haskell package
  

• bytestring-trie

  8.2 6.0 EdisonAPI VS bytestring-trie

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

• slist

  8.1 2.3 EdisonAPI VS slist

  ♾️ Sized list
  

• haggle

  8.0 5.1 EdisonAPI VS haggle

  An efficient graph library for Haskell
  

• void

  8.0 0.0 EdisonAPI VS void

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

• heaps

  7.9 4.3 EdisonAPI VS heaps

  Asymptotically optimal Brodal/Okasaki heaps
  

• hamtmap

  7.9 0.0 EdisonAPI VS hamtmap

  DISCONTINUED. A purely functional and persistent hash map

• knit

  7.8 2.2 EdisonAPI VS knit

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

• nonempty-containers

  7.7 4.8 EdisonAPI VS nonempty-containers

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

• multiset

  7.7 0.0 EdisonAPI VS multiset

  multiset haskell package
  

• bitset

  7.6 0.0 EdisonAPI VS bitset

  A compact functional set data structure
  

• algebra-checkers

  7.5 0.0 EdisonAPI VS algebra-checkers

  checkers for algebra driven design
  

• graphite

  7.4 0.0 EdisonAPI VS graphite

  Haskell graphs and networks library
  

• helf

  7.3 2.9 EdisonAPI VS helf

  Haskell implementation of the Edinburgh Logical Framework
  

• rawr

  7.2 0.0 EdisonAPI VS rawr

  Anonymous extensible records and variant types
  

• map-exts

  7.2 0.0 EdisonAPI VS map-exts

  Extensions to Data.Map
  

• data-r-tree

  7.0 4.3 EdisonAPI VS data-r-tree

  Haskell implementatio of R-Trees
  

• eliminators

  7.0 4.6 EdisonAPI VS eliminators

  Dependently typed elimination functions using singletons
  

• ixset

  6.7 0.0 EdisonAPI VS ixset

  A Set type which supports multiple indexes
  

• mtl-c

  6.7 0.0 EdisonAPI VS mtl-c

  Monad transformers in CPS

• claferIG

  6.7 3.9 EdisonAPI VS claferIG

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

• TypeCompose

  6.7 0.0 EdisonAPI VS TypeCompose

  Type composition classes & instances & misc

• ethereum-analyzer

  6.7 6.9 EdisonAPI VS ethereum-analyzer

  An Ethereum contract analyzer.
  

• supermonad

  6.6 0.0 EdisonAPI VS supermonad

  A plugin for GHC to support super monads.

• selections

  6.6 0.0 EdisonAPI VS selections

  Haskell Package for operating with selections over an underlying functor
  

• map-syntax

  6.6 0.0 EdisonAPI VS map-syntax

  Syntax sugar and explicit semantics for statically defined maps
  

• igraph

  6.5 0.0 EdisonAPI VS igraph

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

• representable-functors

  6.5 0.0 EdisonAPI VS representable-functors

  representable functors

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

SaaSHub - Software Alternatives and Reviews

featured www.saashub.com

Popular Comparisons

• EdisonAPI
  vs
  type-level-sets
• EdisonAPI
  vs
  multiset
• EdisonAPI
  vs
  containers
• EdisonAPI
  vs
  distributive
• EdisonAPI
  vs
  ixset