type-level-sets VS permutation

Compare type-level-sets vs permutation 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

permutation

git import of patrick perry permutations lib from darcs (by spacekitteh)
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 permutation
- -
65 8
- -
0.0 0.0
4 months ago almost 6 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.

permutation

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

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

What are some alternatives?

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

EdisonAPI - Edison: A Library of Efficient Data Structures

multiset - multiset haskell package

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

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

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

singletons - Fake dependent types in Haskell using singletons

distributive - Dual Traversable

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

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

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

psqueues - Priority Search Queues in three different flavors for Haskell

type-level-sets vs EdisonAPI permutation vs multiset type-level-sets vs type-level-bst permutation vs Agda type-level-sets vs type-indexed-queues permutation vs singletons type-level-sets vs distributive permutation vs repa-array type-level-sets vs selections permutation vs miso type-level-sets vs miso permutation vs psqueues