type-level-sets VS representable-functors

Compare type-level-sets vs representable-functors and see what are their differences.

type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations) (by dorchard)
Data structures Type
Source Code
Suggest alternative
Edit details

representable-functors

representable functors (by ekmett)
Data structures
Source Code
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
type-level-sets representable-functors
- -
65 9
- -
0.0 0.0
4 months ago over 10 years ago
Haskell Haskell
BSD 2-clause "Simplified" License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

type-level-sets

Posts with mentions or reviews of type-level-sets. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning type-level-sets yet.
Tracking mentions began in Dec 2020.

representable-functors

Posts with mentions or reviews of representable-functors. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning representable-functors yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing type-level-sets and representable-functors you can also consider the following projects:

EdisonAPI - Edison: A Library of Efficient Data Structures

ethereum-client-haskell

type-level-bst - Type-Level Binary Search Tree in Haskell

fgl - A Functional Graph Library for Haskell

type-indexed-queues - Queues with verified and unverified versions

psqueues - Priority Search Queues in three different flavors for Haskell

distributive - Dual Traversable

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

permutation - git import of patrick perry permutations lib from darcs

singletons - Fake dependent types in Haskell using singletons

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

containers - Bitnami container images

type-level-sets vs EdisonAPI representable-functors vs ethereum-client-haskell type-level-sets vs type-level-bst representable-functors vs fgl type-level-sets vs type-indexed-queues representable-functors vs psqueues type-level-sets vs distributive representable-functors vs Agda type-level-sets vs permutation representable-functors vs singletons type-level-sets vs selections representable-functors vs containers