Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
ghc GHC.Tc.Types.Constraint An equality that cannot be decomposed because it is representational. Example: a b ~R# Int. These might still be solved later. INVARIANT: The constraint is a representational equality constraint
canEqLHSKind :: CanEqLHS -> TcKindghc GHC.Tc.Types.Constraint Retrieve the kind of a CanEqLHS
canEqLHSType :: CanEqLHS -> TcTypeghc GHC.Tc.Types.Constraint canEqLHS_maybe :: Xi -> Maybe CanEqLHSghc GHC.Tc.Types.Constraint Is a type a canonical LHS? That is, is it a tyvar or an exactly-saturated type family application? Does not look through type synonyms.
canTyFamEqLHS_maybe :: Xi -> Maybe CanEqLHSghc GHC.Tc.Types.Constraint No documentation available.
-
ghc GHC.Tc.Types.Constraint Get the equality relation for the given Ct
ctEvEqRel :: CtEvidence -> EqRelghc GHC.Tc.Types.Constraint Get the equality relation relevant for a CtEvidence
ic_given_eqs :: Implication -> HasGivenEqsghc GHC.Tc.Types.Constraint No documentation available.
mkKindEqLoc :: TcType -> TcType -> CtLoc -> CtLocghc GHC.Tc.Types.Constraint No documentation available.
mkTcEqPredLikeEv :: CtEvidence -> TcType -> TcType -> TcTypeghc GHC.Tc.Types.Constraint Makes a new equality predicate with the same role as the given evidence.