trivial-constraint: Constraints that any type, resp. no type fulfills
Since GHC 7.4, constraints are first-class: we have the constraint kind, and thus type-classes have a kind such as
* -> Constraint.
These can be used as parameters to data types. They also can be combined quite nicely,
type NewConstraint a = (Constraint1 a, Constraint2 a)
however you always need to start with a plain old type class when building constraints.
This library provides a type class that is not really a constraint at all, so you can "start from zero" with building up a custom constraint. Also its opposite (a constraint that no type can ever fulfill).
|Versions [RSS] [faq]||0.1.0.0, 0.2.0.0, 0.3.0.0, 0.4.0.0, 0.5.0.0, 0.5.1.0, 0.6.0.0, 0.7.0.0|
|Dependencies||base (>=4.5 && <5) [details]|
|Uploaded||by leftaroundabout at 2016-01-23T00:18:44Z|
|Distributions||LTSHaskell:0.7.0.0, NixOS:0.7.0.0, Stackage:0.7.0.0|
|Downloads||6444 total (49 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]