distributive VS type-level-sets

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

type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations) (by dorchard)
Our great sponsors
  • OPS - Build and Run Open Source Unikernels
  • Scout APM - Less time debugging, more time building
  • SonarLint - Deliver Cleaner and Safer Code - Right in Your IDE of Choice!
distributive type-level-sets
2 0
40 60
- -
8.2 5.7
5 months ago 19 days 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.

distributive

Posts with mentions or reviews of distributive. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-11-02.

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

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

parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.

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

hevm - Dapp, Seth, Hevm, and more

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

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

fgl - A Functional Graph Library for Haskell

permutation - git import of patrick perry permutations lib from darcs

clafer - Clafer is a lightweight modeling language

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)