eliminators VS helf

Compare eliminators vs helf and see what are their differences.

eliminators

Dependently typed elimination functions using singletons (by RyanGlScott)
Data structures Dependent Types
Source Code
Suggest alternative
Edit details

helf

Haskell implementation of the Edinburgh Logical Framework (by andreasabel)
Data structures Dependent Types Logical Framework lf Haskell twelf
Source Code
www2.tcs.ifi.lmu.de
Suggest alternative
Edit details
InfluxDB
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
eliminators helf
- -
27 25
- -
4.5 3.3
about 1 month ago about 1 month ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License MIT 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.

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.

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.

What are some alternatives?

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

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

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

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

singletons - Fake dependent types in Haskell using singletons

open-typerep - Open type representations and dynamic types

agda-snippets - Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.

cubical - Implementation of Univalence in Cubical Sets

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

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

eliminators vs Agda helf vs miso eliminators vs hoq helf vs singletons eliminators vs open-typerep helf vs open-typerep eliminators vs agda-snippets helf vs cubical eliminators vs Sit helf vs Agda eliminators vs nonempty-containers helf vs Sit