open-typerep VS agda-snippets

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


Open type representations and dynamic types (by emilaxelsson)


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
  • InfluxDB - Access the most powerful time series database as a service
  • SonarQube - Static code analysis for 29 languages.
  • SaaSHub - Software Alternatives and Reviews
open-typerep agda-snippets
1 0
4 8
- -
0.0 0.0
almost 7 years ago over 5 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.


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 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 open-typerep and agda-snippets 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

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

cubical - Implementation of Univalence in Cubical Sets

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

eliminators - Dependently typed elimination functions using singletons

singletons - Fake dependent types in Haskell using singletons

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

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