permutation VS hoq

Compare permutation vs hoq 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

hoq

A language based on homotopy type theory with an interval (by valis)
Data structures Dependent Types
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 hoq
- -
8 82
- -
0.0 0.0
about 6 years ago about 9 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License GNU General Public License v2.0 only
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.

hoq

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

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

What are some alternatives?

When comparing permutation and hoq you can also consider the following projects:

multiset - multiset haskell package

Sit - Prototypical type checker for Type Theory with Sized Natural Numbers

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

eliminators - Dependently typed elimination functions using singletons

type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)

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

singletons - Fake dependent types in Haskell using singletons

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

nonempty-containers - Efficient non-empty variants of containers data types, with full API

psqueues - Priority Search Queues in three different flavors for Haskell

monadic-arrays - MArray instances for monad transformers

permutation vs multiset hoq vs Sit permutation vs Agda hoq vs eliminators permutation vs type-level-sets hoq vs miso permutation vs singletons hoq vs Agda permutation vs repa-array hoq vs nonempty-containers permutation vs psqueues hoq vs monadic-arrays