decidable alternatives and similar packages

Based on the "Dependent Types" category.
Alternatively, view decidable alternatives based on common mentions on social networks and blogs.

lens-typelevel

5.8 0.0 decidable VS lens-typelevel

Type-level lenses using singletons because why not
agda2lagda

5.3 7.0 decidable VS agda2lagda

Simple conversion from Agda text to literate Agda text.

Scout APM: A developer's best friend. Try free for 14-days

Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

Promo scoutapm.com

agda-snippets-hakyll

3.9 0.0 decidable VS agda-snippets-hakyll

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

3.8 0.0 decidable VS instance-map

Haskell dependent types the ugly and brute force way
agda-unused

2.3 1.6 decidable VS agda-unused

Check for unused code in an Agda project.
list-witnesses

2.0 0.0 decidable VS list-witnesses

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

- - decidable VS ral-optics

Length-indexed random access lists

Do you think we are missing an alternative of decidable or a related project?

Add another 'Dependent Types' Package

README

decidable

This library provides combinators and typeclasses for working and manipulating type-level predicates in Haskell, which are represented as matchable type-level functions k ~> Type from the singletons library. See Data.Type.Predicate for a good starting point, and the documentation for Predicate on how to define predicates.

decidable

Combinators for manipulating dependently-typed predicates.

decidable alternatives and similar packages

README