decidable: Combinators for manipulating dependently-typed predicates.

[ bsd3, dependent-types, library ] [ Propose Tags ] [ Report a vulnerability ]

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.


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.3.1, 0.1.4.0, 0.1.5.0, 0.2.0.0, 0.2.1.0, 0.3.0.0, 0.3.1.0, 0.3.1.1 (info)
Change log CHANGELOG.md
Dependencies base (>=4.16 && <5), functor-products (>=0.1.2), microlens, singletons (>=3.0), singletons-base, vinyl [details]
Tested with ghc >=9.2
License BSD-3-Clause
Copyright (c) Justin Le 2018
Author Justin Le
Maintainer justin@jle.im
Category Dependent Types
Home page https://github.com/mstksg/decidable#readme
Bug tracker https://github.com/mstksg/decidable/issues
Source repo head: git clone https://github.com/mstksg/decidable
Uploaded by jle at 2024-02-28T01:25:15Z
Distributions LTSHaskell:0.3.1.1, Stackage:0.3.1.1
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 4686 total (18 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2024-02-28 [all 1 reports]

Readme for decidable-0.3.1.1

[back to package description]

decidable

decidable on Hackage Build Status

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.