Data.Comp.Multi.Equality

This module defines equality for (higher-order) signatures, which lifts to equality for (higher-order) terms and contexts. All definitions are generalised versions of those in Data.Comp.Equality.

Documentation

class EqHF f where

Signature equality. An instance EqHF f gives rise to an instance KEq (HTerm f).

Minimal complete definition

eqHF

Methods

eqHF :: KEq g => f g i -> f g j -> Bool

Instances

EqHF f => EqHF (Cxt h f)

Methods

eqHF :: KEq g => Cxt h f g i -> Cxt h f g j -> Bool

(EqHF f, EqHF g) => EqHF ((:+:) * f g)

EqF is propagated through sums.

Methods

eqHF :: KEq g => (* :+: f) g g i -> (* :+: f) g g j -> Bool

class KEq f where

Minimal complete definition

keq

Methods

keq :: f i -> f j -> Bool

Instances

Eq a => KEq (K a)

Methods

keq :: K a i -> K a j -> Bool

(EqHF f, KEq a) => KEq (Cxt h f a)

Methods

keq :: Cxt h f a i -> Cxt h f a j -> Bool

heqMod :: (EqHF f, HFunctor f, HFoldable f) => f a i -> f b i -> Maybe [(E a, E b)]

This function implements equality of values of type f a modulo the equality of a itself. If two functorial values are equal in this sense, eqMod returns a Just value containing a list of pairs consisting of corresponding components of the two functorial values.

Orphan instances

KEq a => Eq (E a)

Methods

(==) :: E a -> E a -> Bool

(/=) :: E a -> E a -> Bool

(EqHF f, KEq a) => Eq (Cxt h f a i)

From an EqF functor an Eq instance of the corresponding term type can be derived.

Methods

(==) :: Cxt h f a i -> Cxt h f a i -> Bool

(/=) :: Cxt h f a i -> Cxt h f a i -> Bool