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.9 0.0 decidable VS lens-typelevel

Type-level lenses using singletons because why not
agda2lagda

5.1 3.3 decidable VS agda2lagda

Simple conversion from Agda text to literate Agda text.

Static code analysis for 29 languages.

Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

Promo www.sonarqube.org

agda-unused

4.0 0.0 decidable VS agda-unused

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

3.8 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.5 0.0 decidable VS instance-map

Haskell dependent types the ugly and brute force way
list-witnesses

2.6 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