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.

  1. ReprEqReason :: CtIrredReason

    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

  2. canEqLHSKind :: CanEqLHS -> TcKind

    ghc GHC.Tc.Types.Constraint

    Retrieve the kind of a CanEqLHS

  3. canEqLHSType :: CanEqLHS -> TcType

    ghc GHC.Tc.Types.Constraint

    Convert a CanEqLHS back into a Type

  4. canEqLHS_maybe :: Xi -> Maybe CanEqLHS

    ghc 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.

  5. canTyFamEqLHS_maybe :: Xi -> Maybe CanEqLHS

    ghc GHC.Tc.Types.Constraint

    No documentation available.

  6. ctEqRel :: Ct -> EqRel

    ghc GHC.Tc.Types.Constraint

    Get the equality relation for the given Ct

  7. ctEvEqRel :: CtEvidence -> EqRel

    ghc GHC.Tc.Types.Constraint

    Get the equality relation relevant for a CtEvidence

  8. ic_given_eqs :: Implication -> HasGivenEqs

    ghc GHC.Tc.Types.Constraint

    No documentation available.

  9. mkKindEqLoc :: TcType -> TcType -> CtLoc -> CtLoc

    ghc GHC.Tc.Types.Constraint

    No documentation available.

  10. mkTcEqPredLikeEv :: CtEvidence -> TcType -> TcType -> TcType

    ghc GHC.Tc.Types.Constraint

    Makes a new equality predicate with the same role as the given evidence.

Page 220 of many | Previous | Next