Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

  1. cmmEqType_ignoring_ptrhood :: CmmType -> CmmType -> Bool

    ghc GHC.Cmm.Type

    No documentation available.

  2. cmmEqWord :: Platform -> CmmExpr -> CmmExpr -> CmmExpr

    ghc GHC.Cmm.Utils

    No documentation available.

  3. sequenceTop :: Instruction instr => NcgImpl statics instr jumpDest -> Maybe CFG -> NatCmmDecl statics instr -> UniqSM (NatCmmDecl statics instr)

    ghc GHC.CmmToAsm.BlockLayout

    No documentation available.

  4. WasmEq :: forall (t :: WasmType) (a :: WasmType) (pre :: [WasmType]) . WasmTypeTag t -> WasmInstr a (t ': (t ': pre)) (a ': pre)

    ghc GHC.CmmToAsm.Wasm.Types

    No documentation available.

  5. WasmSeq :: forall a b (c :: [WasmType]) (mid :: [WasmType]) (d :: [WasmType]) . WasmControl a b c mid -> WasmControl a b mid d -> WasmControl a b c d

    ghc GHC.CmmToAsm.Wasm.Types

    No documentation available.

  6. data TyFamEqnValidityInfo

    ghc GHC.Core.Class

    Information about a type family equation, used for validity checking of closed type family equations and associated type family default equations. This type exists to delay validity-checking after typechecking type declaration groups, to avoid cyclic evaluation inside the typechecking knot. See Note [Type-checking default assoc decls] in GHC.Tc.TyCl.

  7. mkNomPrimEqPred :: Kind -> Type -> Type -> Type

    ghc GHC.Core.Coercion

    Creates a primitive nominal type equality predicate with an explicit (but homogeneous) kind: (~#) k k ty1 ty2

  8. mkPrimEqPred :: Type -> Type -> Type

    ghc GHC.Core.Coercion

    Creates a primitive nominal type equality predicate. t1 ~# t2 Invariant: the types are not Coercions

  9. mkPrimEqPredRole :: Role -> Type -> Type -> PredType

    ghc GHC.Core.Coercion

    Makes a lifted equality predicate at the given role

  10. mkReprPrimEqPred :: Type -> Type -> Type

    ghc GHC.Core.Coercion

    Creates a primitive representational type equality predicate. t1 ~R# t2 Invariant: the types are not Coercions

Page 195 of many | Previous | Next