Safe Haskell	None
Language	Haskell2010

Barbies.Constraints

Contents

Description

Support for operating on Barbie-types with constrained functions.

Synopsis

data Dict (c :: k -> Constraint) (a :: k) where
- Dict :: forall {k} (c :: k -> Constraint) (a :: k). c a => Dict c a
requiringDict :: forall {k} c (a :: k) r. (c a => r) -> Dict c a -> r
type AllBF (c :: k -> Constraint) (f :: k1 -> k) (b :: (k1 -> Type) -> Type) = AllB (ClassF c f) b
class c (f a) => ClassF (c :: k -> Constraint) (f :: k1 -> k) (a :: k1)
class c (f a) (g a) => ClassFG (c :: k -> k1 -> Constraint) (f :: k2 -> k) (g :: k2 -> k1) (a :: k2)
class (c a, d a) => ((c :: k -> Constraint) & (d :: k -> Constraint)) (a :: k)

Instance dictionaries

data Dict (c :: k -> Constraint) (a :: k) where Source #

Dict c a is evidence that there exists an instance of c a.

It is essentially equivalent to Dict (c a) from the constraints package, but because of its kind, it allows us to define things like Dict Show.

Constructors

Dict :: forall {k} (c :: k -> Constraint) (a :: k). c a => Dict c a

Instances details

Show1 (Dict c) Source #
Instance details Defined in Barbies.Internal.Dicts Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Dict c a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Dict c a] -> ShowS #
Show (Dict c a) Source #
Instance details Defined in Barbies.Internal.Dicts Methods showsPrec :: Int -> Dict c a -> ShowS # show :: Dict c a -> String # showList :: [Dict c a] -> ShowS #
Eq (Dict c a) Source #
Instance details Defined in Barbies.Internal.Dicts Methods (==) :: Dict c a -> Dict c a -> Bool # (/=) :: Dict c a -> Dict c a -> Bool #

requiringDict :: forall {k} c (a :: k) r. (c a => r) -> Dict c a -> r Source #

Turn a constrained-function into an unconstrained one that uses the packed instance dictionary instead.

Getting constraints

type AllBF (c :: k -> Constraint) (f :: k1 -> k) (b :: (k1 -> Type) -> Type) = AllB (ClassF c f) b Source #

Similar to AllB but will put the functor argument f between the constraint c and the type a. For example:

  AllB  Show   Person ~ (Show    String,  Show    Int)
  AllBF Show f Person ~ (Show (f String), Show (f Int))

class c (f a) => ClassF (c :: k -> Constraint) (f :: k1 -> k) (a :: k1) Source #

ClassF has one universal instance that makes ClassF c f a equivalent to c (f a). However, we have

'ClassF c f :: k -> Constraint

This is useful since it allows to define constraint-constructors like ClassF Monoid Maybe

Instances details

c (f a) => ClassF (c :: k1 -> Constraint) (f :: k2 -> k1) (a :: k2) Source #
Instance details Defined in Barbies.Internal.Dicts

class c (f a) (g a) => ClassFG (c :: k -> k1 -> Constraint) (f :: k2 -> k) (g :: k2 -> k1) (a :: k2) Source #

Like ClassF but for binary relations.

Instances details

c (f a) (g a) => ClassFG (c :: k1 -> k2 -> Constraint) (f :: k3 -> k1) (g :: k3 -> k2) (a :: k3) Source #
Instance details Defined in Barbies.Internal.Dicts

class (c a, d a) => ((c :: k -> Constraint) & (d :: k -> Constraint)) (a :: k) Source #

Instances details

(c a, d a) => ((c :: k -> Constraint) & (d :: k -> Constraint)) (a :: k) Source #
Instance details Defined in Barbies.Internal.ConstraintsB