representable-functors alternatives and similar packages

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

• miso

  10.0 7.0 representable-functors VS miso

  :ramen: A tasty Haskell front-end framework

• Agda

  10.0 9.6 representable-functors VS Agda

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

Learn any GitHub repo in 59 seconds

Onboard AI learns any GitHub repo in minutes and lets you chat with it to locate functionality, understand different parts, and generate new code. Use it for free at www.getonboard.dev.

Promo getonboard.dev



• hevm

  10.0 4.5 representable-functors VS hevm

  Dapp, Seth, Hevm, and more
  

• containers

  9.8 7.1 representable-functors VS containers

  Assorted concrete container types
  

• singletons

  9.7 0.0 representable-functors VS singletons

  Fake dependent types in Haskell using singletons

• vinyl

  9.7 0.0 representable-functors VS vinyl

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

• fgl

  9.6 0.0 representable-functors VS fgl

  A Functional Graph Library for Haskell
  

• repa-convert

  9.4 0.0 representable-functors VS repa-convert

  High performance, regular, shape polymorphic parallel arrays.
  

• cubical

  9.4 0.0 representable-functors VS cubical

  Implementation of Univalence in Cubical Sets

• repa-array

  9.4 0.0 representable-functors VS repa-array

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-eval

  9.4 0.0 representable-functors VS repa-eval

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-scalar

  9.4 0.0 representable-functors VS repa-scalar

  High performance, regular, shape polymorphic parallel arrays.
  

• parameterized-utils

  9.1 0.0 representable-functors VS parameterized-utils

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

• adjunctions

  9.0 0.0 representable-functors VS adjunctions

  Simple adjunctions

• ethereum-client-haskell

  9.0 0.0 representable-functors VS ethereum-client-haskell

  A Haskell version of an Ethereum client

• psqueues

  9.0 0.0 representable-functors VS psqueues

  Priority Search Queues in three different flavors for Haskell

• distributive

  8.9 0.0 representable-functors VS distributive

  Dual Traversable

• hoq

  8.9 0.0 representable-functors VS hoq

  A language based on homotopy type theory with an interval

• type-level-sets

  8.8 0.0 representable-functors VS type-level-sets

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

• bookkeeper

  8.7 0.0 representable-functors VS bookkeeper

  Anonymous records and overloaded labels
  

• justified-containers

  8.7 0.0 representable-functors VS justified-containers

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

• clafer

  8.6 0.0 representable-functors VS clafer

  Clafer is a lightweight modeling language
  

• EdisonAPI

  8.4 0.0 representable-functors VS EdisonAPI

  Edison: A Library of Efficient Data Structures

• bytestring-trie

  8.3 0.0 representable-functors VS bytestring-trie

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

• slist

  8.2 0.0 representable-functors VS slist

  ♾️ Sized list
  

• ixset-typed

  8.2 3.2 representable-functors VS ixset-typed

  More strongly typed variant of the ixset Haskell package
  

• void

  8.1 0.0 representable-functors VS void

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

• heaps

  8.0 0.0 representable-functors VS heaps

  Asymptotically optimal Brodal/Okasaki heaps

• hamtmap

  7.9 0.0 representable-functors VS hamtmap

  A purely functional and persistent hash map

• knit

  7.9 0.0 representable-functors VS knit

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

• haggle

  7.9 0.0 representable-functors VS haggle

  An efficient graph library for Haskell

• bitset

  7.7 0.0 representable-functors VS bitset

  A compact functional set data structure
  

• nonempty-containers

  7.7 0.0 representable-functors VS nonempty-containers

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

• multiset

  7.7 0.0 representable-functors VS multiset

  multiset haskell package

• graphite

  7.6 0.0 representable-functors VS graphite

  Haskell graphs and networks library

• algebra-checkers

  7.5 0.0 representable-functors VS algebra-checkers

  checkers for algebra driven design

• map-exts

  7.4 0.0 representable-functors VS map-exts

  Extensions to Data.Map
  

• rawr

  7.2 0.0 representable-functors VS rawr

  Anonymous extensible records and variant types

• helf

  7.2 0.0 representable-functors VS helf

  Haskell implementation of the Edinburgh Logical Framework

• data-r-tree

  7.2 0.0 representable-functors VS data-r-tree

  Haskell implementatio of R-Trees

• eliminators

  7.0 0.0 representable-functors VS eliminators

  Dependently typed elimination functions using singletons

• claferIG

  6.9 0.0 representable-functors VS claferIG

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

• mtl-c

  6.8 0.0 representable-functors VS mtl-c

  Monad transformers in CPS

• TypeCompose

  6.8 0.0 representable-functors VS TypeCompose

  Type composition classes & instances & misc

• selections

  6.7 0.0 representable-functors VS selections

  Haskell Package for operating with selections over an underlying functor

• map-syntax

  6.7 0.0 representable-functors VS map-syntax

  Syntax sugar and explicit semantics for statically defined maps

• ixset

  6.6 0.0 representable-functors VS ixset

  A Set type which supports multiple indexes
  

• igraph

  6.6 0.0 representable-functors VS igraph

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

• supermonad

  6.6 0.0 representable-functors VS supermonad

  A plugin for GHC to support super monads.

• hw-fingertree-strict

  6.5 0.0 representable-functors VS hw-fingertree-strict

  Generic strict finger-tree structure
  

Do you think we are missing an alternative of representable-functors or a related project?

Collect and Analyze Billions of Data Points in Real Time sponsored www.influxdata.com

Popular Comparisons

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

SaaSHub - Software Alternatives and Reviews sponsored www.saashub.com