agda-snippets VS instance-map

Compare agda-snippets vs instance-map 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)

instance-map

Haskell dependent types the ugly and brute force way (by litxio)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
agda-snippets instance-map
- -
8 2
- -
0.0 0.0
over 6 years ago over 1 year 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.

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.

What are some alternatives?

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

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

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

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

decidable - Combinators for manipulating dependently-typed predicates.

cubical - Implementation of Univalence in Cubical Sets

open-typerep - Open type representations and dynamic types

ral-optics

helf - Haskell implementation of the Edinburgh Logical Framework

eliminators - Dependently typed elimination functions using singletons

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