Popularity
6.6
Declining
Activity
0.0
Stable
9
7
3
Monthly Downloads: 0
Programming language: Haskell
License: BSD 3-clause "New" or "Revised" License
Latest version: v3.2.0.2
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.
-
Agda
Agda is a dependently typed programming language / interactive theorem prover. -
singletons
Fake dependent types in Haskell using singletons -
vinyl
Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. -
repa-convert
High performance, regular, shape polymorphic parallel arrays. -
repa-array
High performance, regular, shape polymorphic parallel arrays. -
repa-eval
High performance, regular, shape polymorphic parallel arrays. -
repa-scalar
High performance, regular, shape polymorphic parallel arrays. -
parameterized-utils
A set of utilities for using indexed types including containers, equality, and comparison. -
ethereum-client-haskell
A Haskell version of an Ethereum client -
psqueues
Priority Search Queues in three different flavors for Haskell -
type-level-sets
Type-level sets for Haskell (with value-level counterparts and various operations) -
justified-containers
Standard containers, with keys that carry type-level proofs of their own presence. -
EdisonAPI
Edison: A Library of Efficient Data Structures -
bytestring-trie
An efficient finite map from (byte)strings to values. -
ixset-typed
More strongly typed variant of the ixset Haskell package -
void
Provides Data.Void, which is in base since ghc 7.8 or so -
knit
Ties the knot on data structures that reference each other by unique keys -
nonempty-containers
Efficient non-empty variants of containers data types, with full API -
algebra-checkers
checkers for algebra driven design -
helf
Haskell implementation of the Edinburgh Logical Framework -
eliminators
Dependently typed elimination functions using singletons -
claferIG
Support for reasoning on Clafer models by instantiation and counter example generation. -
TypeCompose
Type composition classes & instances & misc -
selections
Haskell Package for operating with selections over an underlying functor -
map-syntax
Syntax sugar and explicit semantics for statically defined maps -
igraph
Incomplete Haskell bindings to the igraph library (which is written in C) -
hw-fingertree-strict
Generic strict finger-tree structure
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
Do you think we are missing an alternative of representable-functors or a related project?