open-typerep VS eliminators

Compare open-typerep vs eliminators and see what are their differences.


Open type representations and dynamic types (by emilaxelsson)


Dependently typed elimination functions using singletons (by RyanGlScott)
Our great sponsors
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • SonarLint - Clean code begins in your IDE with SonarLint
  • SaaSHub - Software Alternatives and Reviews
open-typerep eliminators
1 0
4 27
- -
0.0 3.6
over 6 years ago 5 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" 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.


Posts with mentions or reviews of open-typerep. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-12-28.


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.

What are some alternatives?

When comparing open-typerep and eliminators you can also consider the following projects:

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

helf - Haskell implementation of the Edinburgh Logical Framework

cubical - Implementation of Univalence in Cubical Sets

singletons - Fake dependent types in Haskell using singletons

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

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

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