eliminators VS hoq

Compare eliminators vs hoq and see what are their differences.

eliminators

Dependently typed elimination functions using singletons (by RyanGlScott)

hoq

A language based on homotopy type theory with an interval (by valis)
Our great sponsors
  • SonarLint - Clean code begins in your IDE with SonarLint
  • InfluxDB - Access the most powerful time series database as a service
  • SaaSHub - Software Alternatives and Reviews
eliminators hoq
0 0
28 79
- -
3.2 0.0
3 months ago about 8 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.

eliminators

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

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

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

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

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

open-typerep - Open type representations and dynamic types

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

cubical - Implementation of Univalence in Cubical Sets

helf - Haskell implementation of the Edinburgh Logical Framework

singletons - Fake dependent types in Haskell using singletons

naperian - Efficient representable functors