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)

representable-functors

representable functors (by ekmett)
Our great sponsors
  • JetBrains - Developer Ecosystem Survey 2022
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Less time debugging, more time building
type-level-sets representable-functors
0 0
63 9
- -
5.5 0.0
5 months ago over 8 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:

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

EdisonAPI - Edison: A Library of Efficient Data Structures

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

miso - :ramen: A tasty Haskell front-end framework

distributive - Dual Traversable

ethereum-client-haskell

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

perfect-hash-generator - Perfect minimal hashing implementation in native Haskell

permutation - git import of patrick perry permutations lib from darcs

repa-array - High performance, regular, shape polymorphic parallel arrays.

psqueues - Priority Search Queues in three different flavors for Haskell

containers - Assorted concrete container types