eqT -is:exact

eqT :: (EqF f, Foldable f, Functor f, Monad m) => TermT m f -> TermT m f -> m Bool
compdata Data.Comp.Thunk
This function decides equality of terms with thunks.
type family EQT x y
tfp Type.Data.Ord
eqTypeRep :: forall k1 k2 (a :: k1) (b :: k2) . TypeRep a -> TypeRep b -> Maybe (a :~~: b)
base Type.Reflection
Type equality
eqTag_RDR :: RdrName
ghc GHC.Builtin.Names, ghc-lib-parser GHC.Builtin.Names
eqTyConKey :: Unique
ghc GHC.Builtin.Names, ghc-lib-parser GHC.Builtin.Names
eqTyCon :: TyCon
ghc GHC.Builtin.Types, ghc-lib-parser GHC.Builtin.Types
eqTyConName :: Name
ghc GHC.Builtin.Types, ghc-lib-parser GHC.Builtin.Types
eqTyCon_RDR :: RdrName
ghc GHC.Builtin.Types, ghc-lib-parser GHC.Builtin.Types
eqType :: HasCallStack => Type -> Type -> Bool
ghc GHC.Core.TyCo.Compare GHC.Tc.Utils.TcType
Type equality comparing both visible and invisible arguments, expanding synonyms and respecting multiplicities.
eqTypeIgnoringMultiplicity :: Type -> Type -> Bool
ghc GHC.Core.TyCo.Compare
eqTypeX :: HasCallStack => RnEnv2 -> Type -> Type -> Bool
ghc GHC.Core.TyCo.Compare GHC.Tc.Utils.TcType
Compare types with respect to a (presumably) non-empty RnEnv2.
eqTypes :: [Type] -> [Type] -> Bool
ghc GHC.Core.TyCo.Compare GHC.Tc.Utils.TcType
Type equality on lists of types, looking through type synonyms
eqTriangle :: (InSpace V2 n t, TrailLike t) => n -> t
diagrams-lib Diagrams.TwoD Diagrams.TwoD.Shapes
A synonym for triangle, provided for backwards compatibility.
eqTagged :: forall tag f a . EqTag tag f => tag a -> tag a -> f a -> f a -> Bool
dependent-sum Data.Dependent.Sum
eqTaggedPrec :: forall tag f a . (GEq tag, Has' Eq tag f) => tag a -> tag a -> f a -> f a -> Bool
dependent-sum Data.Dependent.Sum
eqTypeName :: Name
deriving-compat Data.Deriving.Internal
eqThreadId :: ThreadId -> ThreadId -> Bool
effectful-core Effectful.Internal.Utils
eqType :: Type -> Type -> Bool
ghc-lib-parser GHC.Core.TyCo.Compare GHC.Tc.Utils.TcType
Type equality on source types. Does not look through newtypes, PredTypes or type families, but it does look through type synonyms. This first checks that the kinds of the types are equal and then checks whether the types are equal, ignoring casts and coercions. (The kind check is a recursive call, but since all kinds have type Type, there is no need to check the types of kinds.) See also Note [Non-trivial definitional equality] in GHC.Core.TyCo.Rep.
eqTypeX :: RnEnv2 -> Type -> Type -> Bool
ghc-lib-parser GHC.Core.TyCo.Compare GHC.Tc.Utils.TcType
Compare types with respect to a (presumably) non-empty RnEnv2.
eqTypes :: [Type] -> [Type] -> Bool
ghc-lib-parser GHC.Core.TyCo.Compare GHC.Tc.Utils.TcType
Type equality on lists of types, looking through type synonyms but not newtypes.
eqtLhs :: EqualityView -> Arg Term
Agda Agda.Syntax.Internal
eqtName :: EqualityView -> QName
Agda Agda.Syntax.Internal
eqtParams :: EqualityView -> Args
Agda Agda.Syntax.Internal
eqtRhs :: EqualityView -> Arg Term
Agda Agda.Syntax.Internal
eqtSort :: EqualityView -> Sort
Agda Agda.Syntax.Internal