permutation VS type-level-sets

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

permutation

git import of patrick perry permutations lib from darcs (by spacekitteh)
Data structures
Source Code
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
permutation type-level-sets
- -
8 65
- -
0.0 0.0
about 6 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.

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.

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 permutation and type-level-sets you can also consider the following projects:

multiset - multiset haskell package

EdisonAPI - Edison: A Library of Efficient Data Structures

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

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

singletons - Fake dependent types in Haskell using singletons

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

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

distributive - Dual Traversable

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

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

psqueues - Priority Search Queues in three different flavors for Haskell

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