agda-snippets VS eliminators

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

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)
Data structures Dependent Types
Source Code
Suggest alternative
Edit details

eliminators

Dependently typed elimination functions using singletons (by RyanGlScott)
Data structures Dependent Types
Source Code
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
agda-snippets eliminators
- -
8 27
- -
0.0 4.5
over 6 years ago about 1 month 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.

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.

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.

What are some alternatives?

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

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

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

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

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

cubical - Implementation of Univalence in Cubical Sets

open-typerep - Open type representations and dynamic types

helf - Haskell implementation of the Edinburgh Logical Framework

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

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

agda-snippets vs lens-typelevel eliminators vs Agda agda-snippets vs agda2lagda eliminators vs hoq agda-snippets vs cubical eliminators vs open-typerep agda-snippets vs open-typerep eliminators vs helf agda-snippets vs helf eliminators vs Sit agda-snippets vs Sit eliminators vs miso