decidable

Combinators for manipulating dependently-typed predicates.

https://github.com/mstksg/decidable#readme

Version on this page:0.1.1.0
LTS Haskell 14.27:0.1.5.0
Stackage Nightly 2019-09-21:0.2.1.0
Latest on Hackage:0.3.1.1

See all snapshots decidable appears in

BSD-3-Clause licensed by Justin Le
Maintained by [email protected]
This version can be pinned in stack with:decidable-0.1.1.0@sha256:bf015a046f1a8ef94fc4476d63c0ccf60a77dee4501d69485183f0e8e850a537,1382

Module documentation for 0.1.1.0

Depends on 2 packages(full list with versions):
base, singletons

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.

Changes

Changelog

Version 0.1.1.0

October 12, 2018

https://github.com/mstksg/decidable/releases/tag/v0.1.1.0

  • flipDecision, forgetDisproof, forgetProof, isProved, and isDisproved added to Data.Type.Predicate module.
  • ProvableTC, DeccidableTC, proveTC, and decideTC helper functions and constraints
  • Data.Type.Predicate.Auto module, for generating witnesses at compile-time.
  • Instances for injection and projection out of &&& and |||, with some tricks to prevent overlapping instance issues.

Version 0.1.0.0

October 10, 2018

https://github.com/mstksg/decidable/releases/tag/v0.1.0.0

  • Initial release.