eliminators VS agda-snippets

Compare eliminators vs agda-snippets and see what are their differences.

eliminators

Dependently typed elimination functions using singletons (by RyanGlScott)

agda-snippets

Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched. (by liamoc)
Our great sponsors
  • Onboard AI - Learn any GitHub repo in 59 seconds
  • InfluxDB - Collect and Analyze Billions of Data Points in Real Time
  • SaaSHub - Software Alternatives and Reviews
eliminators agda-snippets
0 0
27 8
- -
0.0 0.0
about 2 months ago about 6 years 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.

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.

agda-snippets

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

We haven't tracked posts mentioning agda-snippets yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing eliminators and agda-snippets you can also consider the following projects:

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

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

agda2lagda - Simple conversion from Agda text to literate Agda text.

lens-typelevel - Type-level lenses using singletons because why not

open-typerep - Open type representations and dynamic types

cubical - Implementation of Univalence in Cubical Sets

helf - Haskell implementation of the Edinburgh Logical Framework

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

agda-unused - Check for unused code in an Agda project.

singletons - Fake dependent types in Haskell using singletons