helf VS void

Compare helf vs void and see what are their differences.

helf

Haskell implementation of the Edinburgh Logical Framework (by andreasabel)

void

Provides Data.Void, which is in base since ghc 7.8 or so (by ekmett)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
helf void
- -
25 19
- -
3.3 0.0
29 days ago about 2 years ago
Haskell Haskell
MIT License 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.

helf

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

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

void

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

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

What are some alternatives?

When comparing helf and void you can also consider the following projects:

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

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

singletons - Fake dependent types in Haskell using singletons

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

open-typerep - Open type representations and dynamic types

cubical - Implementation of Univalence in Cubical Sets

map-syntax - Syntax sugar and explicit semantics for statically defined maps

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

naperian - Efficient representable functors

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

hoq - A language based on homotopy type theory with an interval