trivial-constraint: Constraints that any type, resp. no type fulfills

[ constraints, gpl, library ] [ Propose Tags ]

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).

Modules

[Index]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

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 sagemueller@geo.uni-koeln.de
Revised Revision 1 made by leftaroundabout at 2015-02-27T12:16:39Z
Category Constraints
Home page https://github.com/leftaroundabout/trivial-constraint
Uploaded by leftaroundabout at 2014-06-03T15:43:16Z
Distributions LTSHaskell:0.7.0.0, NixOS:0.7.0.0, Stackage:0.7.0.0
Reverse Dependencies 5 direct, 7 indirect [details]
Downloads 7361 total (28 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]