agda-unused VS agda2lagda

Compare agda-unused vs agda2lagda and see what are their differences.

agda-unused

Check for unused code in an Agda project. (by msuperdock)

agda2lagda

Simple conversion from Agda text to literate Agda text. (by andreasabel)
Our great sponsors
  • Scout APM - Less time debugging, more time building
  • talent.io - Download talent.io’s Tech Salary Report
  • SonarQube - Static code analysis for 29 languages.
agda-unused agda2lagda
0 0
6 12
- -
0.0 3.9
9 days ago about 2 months ago
Haskell Haskell
MIT License LicenseRef-PublicDomain
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-unused

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

We haven't tracked posts mentioning agda-unused yet.
Tracking mentions began in Dec 2020.

agda2lagda

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

We haven't tracked posts mentioning agda2lagda yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing agda-unused and agda2lagda you can also consider the following projects:

decidable - Combinators for manipulating dependently-typed predicates.

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

agda-snippets - Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.

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

ral-optics

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

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