Hoogle Search
Within LTS Haskell 24.50 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
ghc GHC.Tc.Types.Constraint A CanEqLHS is a type that can appear on the left of a canonical equality: a type variable or exactly-saturated type family application.
-
ghc GHC.Tc.Types.Constraint An individual problem that might be logged in a CheckTyEqResult
-
ghc GHC.Tc.Types.Constraint A set of problems in checking the validity of a type equality. See checkTypeEq.
-
ghc GHC.Tc.Types.Constraint No documentation available.
-
ghc GHC.Tc.Types.Constraint No documentation available.
-
ghc GHC.Tc.Types.Constraint No documentation available.
-
ghc GHC.Tc.Types.Constraint No documentation available.
-
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