Data.Promotion.Prelude.Bool

Defines promoted functions and datatypes relating to Bool, including a promoted version of all the definitions in Data.Bool.

Because many of these definitions are produced by Template Haskell, it is not possible to create proper Haddock documentation. Please look up the corresponding operation in Data.Bool. Also, please excuse the apparent repeated variable names. This is due to an interaction between Template Haskell and Haddock.

Documentation

type family If cond tru fls :: k

Type-level If. If True a b ==> a; If False a b ==> b

Equations

If k True tru fls = tru

If k False tru fls = fls

Promoted functions from Data.Bool

type family Bool_ a a a :: a

Equations

Bool_ fls _tru False = fls

Bool_ _fls tru True = tru

bool_ :: forall a. a -> a -> Bool -> a

The preceding two definitions are derived from the function bool in Data.Bool. The extra underscore is to avoid name clashes with the type Bool.

type family Not a :: Bool

Equations

Not False = TrueSym0

Not True = FalseSym0

type family a :&& a :: Bool

Equations

False :&& z = FalseSym0

True :&& x = x

type family a :|| a :: Bool

Equations

False :|| x = x

True :|| z = TrueSym0

type Otherwise = (TrueSym0 :: Bool)

Defunctionalization symbols

type TrueSym0 = True

type FalseSym0 = False

data NotSym0 l

Instances

SuppressUnusedWarnings (TyFun Bool Bool -> *) NotSym0

type Apply Bool Bool NotSym0 l0 = NotSym1 l0

type NotSym1 t = Not t

data (:&&$) l

Instances

SuppressUnusedWarnings (TyFun Bool (TyFun Bool Bool -> *) -> *) (:&&$)

type Apply (TyFun Bool Bool -> *) Bool (:&&$) l0 = (:&&$$) l0

data l :&&$$ l

Instances

SuppressUnusedWarnings (Bool -> TyFun Bool Bool -> *) (:&&$$)

type Apply Bool Bool ((:&&$$) l1) l0 = (:&&$$$) l1 l0

type (:&&$$$) t t = (:&&) t t

data (:||$) l

Instances

SuppressUnusedWarnings (TyFun Bool (TyFun Bool Bool -> *) -> *) (:||$)

type Apply (TyFun Bool Bool -> *) Bool (:||$) l0 = (:||$$) l0

data l :||$$ l

Instances

SuppressUnusedWarnings (Bool -> TyFun Bool Bool -> *) (:||$$)

type Apply Bool Bool ((:||$$) l1) l0 = (:||$$$) l1 l0

type (:||$$$) t t = (:||) t t

data Bool_Sym0 l

Instances

SuppressUnusedWarnings (TyFun k (TyFun k (TyFun Bool k -> *) -> *) -> *) (Bool_Sym0 k)

type Apply (TyFun k (TyFun Bool k -> *) -> *) k (Bool_Sym0 k) l0 = Bool_Sym1 k l0

data Bool_Sym1 l l

Instances

SuppressUnusedWarnings (k -> TyFun k (TyFun Bool k -> *) -> *) (Bool_Sym1 k)

type Apply (TyFun Bool k -> *) k (Bool_Sym1 k l1) l0 = Bool_Sym2 k l1 l0

data Bool_Sym2 l l l

Instances

SuppressUnusedWarnings (k -> k -> TyFun Bool k -> *) (Bool_Sym2 k)

type Apply k Bool (Bool_Sym2 k l1 l2) l0 = Bool_Sym3 k l1 l2 l0

type Bool_Sym3 t t t = Bool_ t t t

type OtherwiseSym0 = Otherwise