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.

  1. dataConFieldType_maybe :: DataCon -> FieldLabelString -> Maybe (FieldLabel, Type)

    ghc-lib-parser GHC.Core.DataCon

    Extract the label and type for any given labelled field of the DataCon, or return Nothing if the field does not belong to it

  2. dataConWrapId_maybe :: DataCon -> Maybe Id

    ghc-lib-parser GHC.Core.DataCon

    Get the Id of the DataCon wrapper: a function that wraps the "actual" constructor so it has the type visible in the source program: c.f. dataConWorkId. Returns Nothing if there is no wrapper, which occurs for an algebraic data constructor and also for a newtype (whose constructor is inlined compulsorily)

  3. splitDataProductType_maybe :: Type -> Maybe (TyCon, [Type], DataCon, [Scaled Type])

    ghc-lib-parser GHC.Core.DataCon

    Extract the type constructor, type argument, data constructor and it's representation argument types from a type if it is a product type. Precisely, we return Just for any data type that is all of:

    • Concrete (i.e. constructors visible)
    • Single-constructor
    • ... which has no existentials
    Whether the type is a data type or a newtype.

  4. famInstRepTyCon_maybe :: FamInst -> Maybe TyCon

    ghc-lib-parser GHC.Core.FamInstEnv

    No documentation available.

  5. reduceTyFamApp_maybe :: FamInstEnvs -> Role -> TyCon -> [Type] -> Maybe Reduction

    ghc-lib-parser GHC.Core.FamInstEnv

    No documentation available.

  6. topNormaliseType_maybe :: FamInstEnvs -> Type -> Maybe Reduction

    ghc-lib-parser GHC.Core.FamInstEnv

    Get rid of *outermost* (or toplevel) * type function redex * data family redex * newtypes returning an appropriate Representational coercion. Specifically, if topNormaliseType_maybe env ty = Just (co, ty') then (a) co :: ty ~R ty' (b) ty' is not a newtype, and is not a type-family or data-family redex However, ty' can be something like (Maybe (F ty)), where (F ty) is a redex. Always operates homogeneously: the returned type has the same kind as the original type, and the returned coercion is always homogeneous.

  7. topReduceTyFamApp_maybe :: FamInstEnvs -> TyCon -> [Type] -> Maybe HetReduction

    ghc-lib-parser GHC.Core.FamInstEnv

    Try to simplify a type-family application, by *one* step If topReduceTyFamApp_maybe env r F tys = Just (HetReduction (Reduction co rhs) res_co) then co :: F tys ~R# rhs res_co :: typeKind(F tys) ~ typeKind(rhs) Type families and data families; always Representational role

  8. setOverlapModeMaybe :: OverlapFlag -> Maybe OverlapMode -> OverlapFlag

    ghc-lib-parser GHC.Core.InstEnv

    No documentation available.

  9. arityTypeBotSigs_maybe :: ArityType -> Maybe (Arity, DmdSig, CprSig)

    ghc-lib-parser GHC.Core.Opt.Arity

    No documentation available.

  10. exprBotStrictness_maybe :: CoreExpr -> Maybe (Arity, DmdSig, CprSig)

    ghc-lib-parser GHC.Core.Opt.Arity

    No documentation available.

Page 191 of many | Previous | Next