igraph VS hoq

Compare igraph vs hoq and see what are their differences.

igraph

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

hoq

A language based on homotopy type theory with an interval (by valis)
Our great sponsors
  • Scout APM - Less time debugging, more time building
  • SonarLint - Clean code begins in your IDE with SonarLint
  • SaaSHub - Software Alternatives and Reviews
igraph hoq
0 0
7 78
- -
0.0 0.0
over 9 years ago over 7 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.

igraph

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

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

containers - Assorted concrete container types

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

hevm - Dapp, Seth, Hevm, and more

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

ethereum-client-haskell

vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.

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

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

distributive - Dual Traversable

adjunctions - Simple adjunctions

singletons - Fake dependent types in Haskell using singletons

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