hoq VS permutation

Compare hoq vs permutation and see what are their differences.

hoq

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

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.

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

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

multiset - multiset haskell package

eliminators - Dependently typed elimination functions using singletons

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

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

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

singletons - Fake dependent types in Haskell using singletons

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

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

monadic-arrays - MArray instances for monad transformers

psqueues - Priority Search Queues in three different flavors for Haskell

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