constraints
constraints copied to clipboard
ekmett
Tools for programming with ConstraintKinds in GHC
The axiom ```haskell powMonotone2 :: forall a b c . (b
These might be useful for `Data.Constraint.Nat` ``` plusMonotone1' :: forall a b c. (a + c
* We can implement `Forall` using `QuantifiedConstraints`, avoiding `unsafeCoerce` for `inst`. We end up needing `magicDict` for `forall`, unfortunately. I hope my implementation is correct. The new implementation should, I...
Hello there. So here's a neat little thing that possibly demonstrates `Dict` being one half of an adjunction between the Heyting algebra of constraints and the CCC of types and...
Seems like this is a recurring request on StackOverflow and Reddit, and `constraints` looks to me like the place where it might belong: ``` data Exists c where Exists ::...
* More constraint tuple instances, because we can. * A nice default definition for never-satisfiable constraints, and a stupidly boring always-satisfiable one for symmetry.
This package could provide various `Constraint`building blocks, names / fixity from [`Control.Constraint.Combine`](http://hackage.haskell.org/package/exists-0.2/src/Control/Constraint/Combine.hs) ```haskell class (c a, d a) => (c :&: d) a instance (c a, d a) => (c...
Hope it's going well, do we want lift instances for `Dict` here? ```haskell instance Lift (Dict cls) where lift :: Dict cls -> Q Exp lift Dict = [| Dict...
[`Data.Constraint.Class1`](https://hackage.haskell.org/package/free-functors-0.7.2/docs/Data-Constraint-Class1.html) looks like an implementation of implication constraints (`ImplicationConstraints`) and allows implementing (from [`HHFree`](https://hackage.haskell.org/package/free-functors-0.7.2/docs/src/Data-Functor-HHFree.html)) ```haskell type f ~~> g = forall a b. f a b -> g a b...