instance-map VS agda-snippets

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

instance-map

Haskell dependent types the ugly and brute force way (by litxio)

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
  • SonarQube - Static code analysis for 29 languages.
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • SaaSHub - Software Alternatives and Reviews
instance-map agda-snippets
0 0
2 6
- -
0.0 0.0
5 months ago about 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.

instance-map

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

We haven't tracked posts mentioning instance-map 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 instance-map and agda-snippets you can also consider the following projects:

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

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

list-witnesses - Inductive dependently-typed witnesses for working with type-level lists.

cubical - Implementation of Univalence in Cubical Sets

open-typerep - Open type representations and dynamic types

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

decidable - Combinators for manipulating dependently-typed predicates.

singletons - Fake dependent types in Haskell using singletons

helf - Haskell implementation of the Edinburgh Logical Framework

eliminators - Dependently typed elimination functions using singletons