naperian VS type-level-sets

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

naperian

Efficient representable functors (by aaronvargo)
Data structures
Source Code
hackage.haskell.org
Suggest alternative
Edit details

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
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
naperian type-level-sets
- -
5 65
- -
0.0 0.0
over 5 years ago 4 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" 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.

naperian

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

We haven't tracked posts mentioning naperian yet.
Tracking mentions began in Dec 2020.

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.

What are some alternatives?

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

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

EdisonAPI - Edison: A Library of Efficient Data Structures

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

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

hamtmap

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

rawr - Anonymous extensible records and variant types

distributive - Dual Traversable

DrIFT - A mirror of DrIFT.

permutation - git import of patrick perry permutations lib from darcs

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

naperian vs justified-containers type-level-sets vs EdisonAPI naperian vs repa-array type-level-sets vs type-level-bst naperian vs hamtmap type-level-sets vs type-indexed-queues naperian vs rawr type-level-sets vs distributive naperian vs DrIFT type-level-sets vs permutation naperian vs EdisonAPI type-level-sets vs selections