hoq VS naperian

Compare hoq vs naperian and see what are their differences.

hoq

A language based on homotopy type theory with an interval (by valis)

naperian

Efficient representable functors (by aaronvargo)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
hoq naperian
- -
82 5
- -
0.0 0.0
about 9 years ago over 5 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.

naperian

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

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

What are some alternatives?

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

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

justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.

eliminators - Dependently typed elimination functions using singletons

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

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

hamtmap

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

rawr - Anonymous extensible records and variant types

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

DrIFT - A mirror of DrIFT.

monadic-arrays - MArray instances for monad transformers

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