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).
Downloads
- trivial-constraint-0.5.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 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] |
| License | GPL-3.0-only |
| Author | Justus Sagemüller |
| Maintainer | jsag@hvl.no |
| Category | Constraints |
| Home page | https://github.com/leftaroundabout/trivial-constraint |
| Source repo | head: git clone git://github.com/leftaroundabout/trivial-constraint.git |
| Uploaded | by leftaroundabout at 2019-06-03T09:24:04Z |
| Distributions | LTSHaskell:0.7.0.0, NixOS:0.7.0.0, Stackage:0.7.0.0 |
| Reverse Dependencies | 5 direct, 7 indirect [details] |
| Downloads | 7679 total (1 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2019-06-03 [all 1 reports] |