Data.Promotion.Prelude.Eq

Provided promoted definitions related to type-level equality.

Documentation

class (kproxy ~ KProxy) => PEq kproxy

The promoted analogue of Eq. If you supply no definition for '(:==)' under GHC 7.8+, then it defaults to a use of '(==)', from Data.Type.Equality.

Associated Types

type x :== y :: Bool

type x :/= y :: Bool

Instances

PEq Bool (KProxy Bool)

PEq Ordering (KProxy Ordering)

PEq * (KProxy *)

PEq Nat (KProxy Nat)

PEq Symbol (KProxy Symbol)

PEq () (KProxy ())

PEq [k] (KProxy [k])

PEq (Maybe k) (KProxy (Maybe k))

PEq (Either k k) (KProxy (Either k k))

PEq ((,) k k) (KProxy ((,) k k))

PEq ((,,) k k k) (KProxy ((,,) k k k))

PEq ((,,,) k k k k) (KProxy ((,,,) k k k k))

PEq ((,,,,) k k k k k) (KProxy ((,,,,) k k k k k))

PEq ((,,,,,) k k k k k k) (KProxy ((,,,,,) k k k k k k))

PEq ((,,,,,,) k k k k k k k) (KProxy ((,,,,,,) k k k k k k k))

data (:==$) l

Instances

SuppressUnusedWarnings (TyFun k (TyFun k Bool -> *) -> *) ((:==$) k)

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

data l :==$$ l

Instances

SuppressUnusedWarnings (k -> TyFun k Bool -> *) ((:==$$) k)

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

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

data (:/=$) l

Instances

SuppressUnusedWarnings (TyFun k (TyFun k Bool -> *) -> *) ((:/=$) k)

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

data l :/=$$ l

Instances

SuppressUnusedWarnings (k -> TyFun k Bool -> *) ((:/=$$) k)

type Apply Bool k ((:/=$$) k l1) l0 = (:/=$$$) k l1 l0

type (:/=$$$) t t = (:/=) t t