Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. data CheckTyEqProblem

   ghc	GHC.Tc.Types.Constraint

   An individual problem that might be logged in a CheckTyEqResult

2. data CheckTyEqResult

   ghc	GHC.Tc.Types.Constraint

   A set of problems in checking the validity of a type equality. See checkTypeEq.

3. data HasGivenEqs

   ghc	GHC.Tc.Types.Constraint

   No documentation available.

4. LocalGivenEqs :: HasGivenEqs

   ghc	GHC.Tc.Types.Constraint

   No documentation available.

5. MaybeGivenEqs :: HasGivenEqs

   ghc	GHC.Tc.Types.Constraint

   No documentation available.

6. NoGivenEqs :: HasGivenEqs

   ghc	GHC.Tc.Types.Constraint

   No documentation available.

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

8. canEqLHSKind :: CanEqLHS -> TcKind

   ghc	GHC.Tc.Types.Constraint

   Retrieve the kind of a CanEqLHS

9. canEqLHSType :: CanEqLHS -> TcType

   ghc	GHC.Tc.Types.Constraint

   Convert a CanEqLHS back into a Type

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

Page 219 of many | Previous | Next