decidable VS agda-snippets

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

decidable

Combinators for manipulating dependently-typed predicates. (by mstksg)

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
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
decidable agda-snippets
0 0
12 8
- -
5.2 0.0
about 1 month ago over 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.

decidable

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

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

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

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

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

helf - Haskell implementation of the Edinburgh Logical Framework

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

instance-map - Haskell dependent types the ugly and brute force way

eliminators - Dependently typed elimination functions using singletons

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