Data.Singletons.Prelude.Eq

Defines the SEq singleton version of the Eq type class.

Documentation

class PEq a

The promoted analogue of Eq. If you supply no definition for (==), then it defaults to a use of DefaultEq.

Associated Types

type (x :: a) == (y :: a) :: Bool infix 4

type (x :: a) == (y :: a) = x `DefaultEq` y

type (x :: a) /= (y :: a) :: Bool infix 4

type (x :: a) /= (y :: a) = Not (x == y)

Instances

PEq Bool

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq Ordering

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq Nat

Defined in Data.Singletons.TypeLits.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq Symbol

Defined in Data.Singletons.TypeLits.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq ()

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq Void

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq All

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq Any

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq [a]

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Maybe a)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (TYPE rep)

Defined in Data.Singletons.TypeRepTYPE

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Min a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Max a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (First a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Last a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (WrappedMonoid m)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Option a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Identity a)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (First a)

Defined in Data.Singletons.Prelude.Monoid

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Last a)

Defined in Data.Singletons.Prelude.Monoid

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Dual a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Sum a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Product a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Down a)

Defined in Data.Singletons.Prelude.Ord

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (NonEmpty a)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Either a b)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (a, b)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Arg a b)

Defined in Data.Singletons.Prelude.Semigroup

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Proxy s)

Defined in Data.Singletons.Prelude.Proxy

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (a, b, c)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (Const a b)

Defined in Data.Singletons.Prelude.Const

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (a, b, c, d)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (a, b, c, d, e)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (a, b, c, d, e, f)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

PEq (a, b, c, d, e, f, g)

Defined in Data.Singletons.Prelude.Eq

Associated Types

type x == y :: Bool

type x /= y :: Bool

class SEq k where

The singleton analogue of Eq. Unlike the definition for Eq, it is required that instances define a body for (%==). You may also supply a body for (%/=).

Minimal complete definition

(%==)

Methods

(%==) :: forall (a :: k) (b :: k). Sing a -> Sing b -> Sing (a == b) infix 4

Boolean equality on singletons

(%/=) :: forall (a :: k) (b :: k). Sing a -> Sing b -> Sing (a /= b) infix 4

Boolean disequality on singletons

default (%/=) :: forall (a :: k) (b :: k). (a /= b) ~ Not (a == b) => Sing a -> Sing b -> Sing (a /= b)

Instances

SEq Bool

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: Bool) (b :: Bool). Sing a -> Sing b -> Sing (a /= b)

SEq Ordering

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a :: Ordering) (b :: Ordering). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: Ordering) (b :: Ordering). Sing a -> Sing b -> Sing (a /= b)

SEq Nat

Defined in Data.Singletons.TypeLits.Internal

Methods

(%==) :: forall (a :: Nat) (b :: Nat). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: Nat) (b :: Nat). Sing a -> Sing b -> Sing (a /= b)

SEq Symbol

Defined in Data.Singletons.TypeLits.Internal

Methods

(%==) :: forall (a :: Symbol) (b :: Symbol). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: Symbol) (b :: Symbol). Sing a -> Sing b -> Sing (a /= b)

SEq ()

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a :: ()) (b :: ()). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: ()) (b :: ()). Sing a -> Sing b -> Sing (a /= b)

SEq Void

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a :: Void) (b :: Void). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: Void) (b :: Void). Sing a -> Sing b -> Sing (a /= b)

SEq Bool => SEq All

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a :: All) (b :: All). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: All) (b :: All). Sing a -> Sing b -> Sing (a /= b)

SEq Bool => SEq Any

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a :: Any) (b :: Any). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: Any) (b :: Any). Sing a -> Sing b -> Sing (a /= b)

(SEq a, SEq [a]) => SEq [a]

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: [a]) (b :: [a]). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: [a]) (b :: [a]). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (Maybe a)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Maybe a) (b :: Maybe a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq (TYPE rep)

Defined in Data.Singletons.TypeRepTYPE

Methods

(%==) :: forall (a :: TYPE rep) (b :: TYPE rep). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: TYPE rep) (b :: TYPE rep). Sing a -> Sing b -> Sing (a /= b)

SEq a => SEq (Min a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a0 :: Min a) (b :: Min a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Min a) (b :: Min a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (Max a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a0 :: Max a) (b :: Max a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Max a) (b :: Max a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (First a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (Last a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq m => SEq (WrappedMonoid m)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a :: WrappedMonoid m) (b :: WrappedMonoid m). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: WrappedMonoid m) (b :: WrappedMonoid m). Sing a -> Sing b -> Sing (a /= b)

SEq (Maybe a) => SEq (Option a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a0 :: Option a) (b :: Option a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Option a) (b :: Option a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (Identity a)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: Identity a) (b :: Identity a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Identity a) (b :: Identity a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq (Maybe a) => SEq (First a)

Defined in Data.Singletons.Prelude.Monoid

Methods

(%==) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: First a) (b :: First a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq (Maybe a) => SEq (Last a)

Defined in Data.Singletons.Prelude.Monoid

Methods

(%==) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Last a) (b :: Last a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (Dual a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a0 :: Dual a) (b :: Dual a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Dual a) (b :: Dual a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (Sum a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a0 :: Sum a) (b :: Sum a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Sum a) (b :: Sum a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (Product a)

Defined in Data.Singletons.Prelude.Semigroup.Internal

Methods

(%==) :: forall (a0 :: Product a) (b :: Product a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Product a) (b :: Product a). Sing a0 -> Sing b -> Sing (a0 /= b)

SEq a => SEq (Down a)

Defined in Data.Singletons.Prelude.Ord

Methods

(%==) :: forall (a0 :: Down a) (b :: Down a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: Down a) (b :: Down a). Sing a0 -> Sing b -> Sing (a0 /= b)

(SEq a, SEq [a]) => SEq (NonEmpty a)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: NonEmpty a) (b :: NonEmpty a). Sing a0 -> Sing b -> Sing (a0 == b)

(%/=) :: forall (a0 :: NonEmpty a) (b :: NonEmpty a). Sing a0 -> Sing b -> Sing (a0 /= b)

(SEq a, SEq b) => SEq (Either a b)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: Either a b) (b0 :: Either a b). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: Either a b) (b0 :: Either a b). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

(SEq a, SEq b) => SEq (a, b)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: (a, b)) (b0 :: (a, b)). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: (a, b)) (b0 :: (a, b)). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

SEq a => SEq (Arg a b)

Defined in Data.Singletons.Prelude.Semigroup

Methods

(%==) :: forall (a0 :: Arg a b) (b0 :: Arg a b). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: Arg a b) (b0 :: Arg a b). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

SEq (Proxy s)

Defined in Data.Singletons.Prelude.Proxy

Methods

(%==) :: forall (a :: Proxy s) (b :: Proxy s). Sing a -> Sing b -> Sing (a == b)

(%/=) :: forall (a :: Proxy s) (b :: Proxy s). Sing a -> Sing b -> Sing (a /= b)

(SEq a, SEq b, SEq c) => SEq (a, b, c)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: (a, b, c)) (b0 :: (a, b, c)). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: (a, b, c)) (b0 :: (a, b, c)). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

SEq a => SEq (Const a b)

Defined in Data.Singletons.Prelude.Const

Methods

(%==) :: forall (a0 :: Const a b) (b0 :: Const a b). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: Const a b) (b0 :: Const a b). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

(SEq a, SEq b, SEq c, SEq d) => SEq (a, b, c, d)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: (a, b, c, d)) (b0 :: (a, b, c, d)). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: (a, b, c, d)) (b0 :: (a, b, c, d)). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

(SEq a, SEq b, SEq c, SEq d, SEq e) => SEq (a, b, c, d, e)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: (a, b, c, d, e)) (b0 :: (a, b, c, d, e)). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: (a, b, c, d, e)) (b0 :: (a, b, c, d, e)). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

(SEq a, SEq b, SEq c, SEq d, SEq e, SEq f) => SEq (a, b, c, d, e, f)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: (a, b, c, d, e, f)) (b0 :: (a, b, c, d, e, f)). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: (a, b, c, d, e, f)) (b0 :: (a, b, c, d, e, f)). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

(SEq a, SEq b, SEq c, SEq d, SEq e, SEq f, SEq g) => SEq (a, b, c, d, e, f, g)

Defined in Data.Singletons.Prelude.Eq

Methods

(%==) :: forall (a0 :: (a, b, c, d, e, f, g)) (b0 :: (a, b, c, d, e, f, g)). Sing a0 -> Sing b0 -> Sing (a0 == b0)

(%/=) :: forall (a0 :: (a, b, c, d, e, f, g)) (b0 :: (a, b, c, d, e, f, g)). Sing a0 -> Sing b0 -> Sing (a0 /= b0)

type family DefaultEq a b where ...

A sensible way to compute Boolean equality for types of any kind. Note that this definition is slightly different from the (==) type family from Data.Type.Equality in base, as (==) attempts to distinguish applications of type constructors from other types. As a result, a == a does not reduce to True for every a, but DefaultEq a a does reduce to True for every a. The latter behavior is more desirable for singletons' purposes, so we use it instead of (==).

Equations

DefaultEq a a = 'True

DefaultEq a b = 'False

Defunctionalization symbols

data (==@#@$) a6989586621679370055 infix 4

Instances

SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

sing :: Sing (==@#@$)

SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

suppressUnusedWarnings :: ()

type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679370055 :: a)

Defined in Data.Singletons.Prelude.Eq

type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679370055 :: a) = (==@#@$$) a6989586621679370055

data a6989586621679370055 ==@#@$$ a6989586621679370056 infix 4

Instances

(SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

sing :: Sing ((==@#@$$) x)

SuppressUnusedWarnings ((==@#@$$) a6989586621679370055 :: TyFun a Bool -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

suppressUnusedWarnings :: ()

type Apply ((==@#@$$) a6989586621679370055 :: TyFun a Bool -> Type) (a6989586621679370056 :: a)

Defined in Data.Singletons.Prelude.Eq

type Apply ((==@#@$$) a6989586621679370055 :: TyFun a Bool -> Type) (a6989586621679370056 :: a) = a6989586621679370055 ==@#@$$$ a6989586621679370056

type (==@#@$$$) (a6989586621679370055 :: a) (a6989586621679370056 :: a) = (==) a6989586621679370055 a6989586621679370056 :: Bool infix 4

data (/=@#@$) a6989586621679370058 infix 4

Instances

SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

sing :: Sing (/=@#@$)

SuppressUnusedWarnings ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

suppressUnusedWarnings :: ()

type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679370058 :: a)

Defined in Data.Singletons.Prelude.Eq

type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679370058 :: a) = (/=@#@$$) a6989586621679370058

data a6989586621679370058 /=@#@$$ a6989586621679370059 infix 4

Instances

(SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

sing :: Sing ((/=@#@$$) x)

SuppressUnusedWarnings ((/=@#@$$) a6989586621679370058 :: TyFun a Bool -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

suppressUnusedWarnings :: ()

type Apply ((/=@#@$$) a6989586621679370058 :: TyFun a Bool -> Type) (a6989586621679370059 :: a)

Defined in Data.Singletons.Prelude.Eq

type Apply ((/=@#@$$) a6989586621679370058 :: TyFun a Bool -> Type) (a6989586621679370059 :: a) = a6989586621679370058 /=@#@$$$ a6989586621679370059

type (/=@#@$$$) (a6989586621679370058 :: a) (a6989586621679370059 :: a) = (/=) a6989586621679370058 a6989586621679370059 :: Bool infix 4

data DefaultEqSym0 a6989586621679370061

Instances

SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

suppressUnusedWarnings :: ()

type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679370061 :: k)

Defined in Data.Singletons.Prelude.Eq

type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679370061 :: k) = DefaultEqSym1 a6989586621679370061

data DefaultEqSym1 a6989586621679370061 a6989586621679370062

Instances

SuppressUnusedWarnings (DefaultEqSym1 a6989586621679370061 :: TyFun k Bool -> Type)

Defined in Data.Singletons.Prelude.Eq

Methods

suppressUnusedWarnings :: ()

type Apply (DefaultEqSym1 a6989586621679370061 :: TyFun k Bool -> Type) (a6989586621679370062 :: k)

Defined in Data.Singletons.Prelude.Eq

type Apply (DefaultEqSym1 a6989586621679370061 :: TyFun k Bool -> Type) (a6989586621679370062 :: k) = DefaultEqSym2 a6989586621679370061 a6989586621679370062

type DefaultEqSym2 (a6989586621679370061 :: k) (a6989586621679370062 :: k) = DefaultEq a6989586621679370061 a6989586621679370062 :: Bool