perfect-hash-generator VS hoq

Compare perfect-hash-generator vs hoq and see what are their differences.

perfect-hash-generator

Perfect minimal hashing implementation in native Haskell (by kostmo)

hoq

A language based on homotopy type theory with an interval (by valis)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
perfect-hash-generator hoq
0 0
2 81
- -
0.0 0.0
over 1 year ago almost 9 years ago
C Haskell
Apache License 2.0 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.

perfect-hash-generator

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

We haven't tracked posts mentioning perfect-hash-generator 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 perfect-hash-generator and hoq you can also consider the following projects:

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

eliminators - Dependently typed elimination functions using singletons

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

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

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

monadic-arrays - MArray instances for monad transformers

adjunctions - Simple adjunctions

cubical - Implementation of Univalence in Cubical Sets

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

open-typerep - Open type representations and dynamic types

singletons - Fake dependent types in Haskell using singletons

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