Liquid.GHC.API

This module re-exports all identifiers that LH needs from the GHC API.

The intended use of this module is to provide a quick look of what GHC API features LH depends upon.

The transitive dependencies of this module shouldn't contain modules from Language.Haskell.Liquid.* or other non-boot libraries. This makes it easy to discover breaking changes in the GHC API.

Documentation

data Plugin

Plugin is the compiler plugin data type. Try to avoid constructing one of these directly, and just modify some fields of defaultPlugin instead: this is to try and preserve source-code compatibility when we add fields to this.

Nonetheless, this API is preliminary and highly likely to change in the future.

Constructors

Plugin

Fields

• installCoreToDos :: CorePlugin

  Modify the Core pipeline that will be used for compilation. This is called as the Core pipeline is built for every module being compiled, and plugins get the opportunity to modify the pipeline in a nondeterministic order.

• tcPlugin :: TcPlugin

  An optional typechecker plugin, which may modify the behaviour of the constraint solver.

• holeFitPlugin :: HoleFitPlugin

  An optional plugin to handle hole fits, which may re-order or change the list of valid hole fits and refinement hole fits.

• driverPlugin :: [CommandLineOption] -> HscEnv -> IO HscEnv

  An optional plugin to update HscEnv, right after plugin loading. This can be used to register hooks or tweak any field of DynFlags before doing actual work on a module.

  Since: ghc-8.10.1

• pluginRecompile :: [CommandLineOption] -> IO PluginRecompile

  Specify how the plugin should affect recompilation.

• parsedResultAction :: [CommandLineOption] -> ModSummary -> HsParsedModule -> Hsc HsParsedModule

  Modify the module when it is parsed. This is called by GHC.Driver.Main when the parsing is successful.

• renamedResultAction :: [CommandLineOption] -> TcGblEnv -> HsGroup GhcRn -> TcM (TcGblEnv, HsGroup GhcRn)

  Modify each group after it is renamed. This is called after each HsGroup has been renamed.

• typeCheckResultAction :: [CommandLineOption] -> ModSummary -> TcGblEnv -> TcM TcGblEnv

  Modify the module when it is type checked. This is called at the very end of typechecking.

• spliceRunAction :: [CommandLineOption] -> LHsExpr GhcTc -> TcM (LHsExpr GhcTc)

  Modify the TH splice or quasiqoute before it is run.

• interfaceLoadAction :: forall lcl. [CommandLineOption] -> ModIface -> IfM lcl ModIface

  Modify an interface that have been loaded. This is called by GHC.Iface.Load when an interface is successfully loaded. Not applied to the loading of the plugin interface. Tools that rely on information from modules other than the currently compiled one should implement this function.

liftIO :: MonadIO m => IO a -> m a

Lift a computation from the IO monad. This allows us to run IO computations in any monadic stack, so long as it supports these kinds of operations (i.e. IO is the base monad for the stack).

Example

import Control.Monad.Trans.State -- from the "transformers" library

printState :: Show s => StateT s IO ()
printState = do
  state <- get
  liftIO $ print state

Had we omitted liftIO, we would have ended up with this error:

• Couldn't match type ‘IO’ with ‘StateT s IO’
 Expected type: StateT s IO ()
   Actual type: IO ()

The important part here is the mismatch between StateT s IO () and IO ().

Luckily, we know of a function that takes an IO a and returns an (m a): liftIO, enabling us to run the program and see the expected results:

> evalStateT printState "hello"
"hello"

> evalStateT printState 3
3

deserializeWithData :: Data a => [Word8] -> a

Use a Data instance to implement a deserialization scheme dual to that of serializeWithData

fromSerialized :: Typeable a => ([Word8] -> a) -> Serialized -> Maybe a

If the Serialized value contains something of the given type, then use the specified deserializer to return Just that. Otherwise return Nothing.

toSerialized :: Typeable a => (a -> [Word8]) -> a -> Serialized

Put a Typeable value that we are able to actually turn into bytes into a Serialized value ready for deserialization later

data TypecheckedModule

The result of successful typechecking. It also contains the parser result.

Instances

ParsedMod TypecheckedModule

Defined in GHC

Methods

modSummary :: TypecheckedModule -> ModSummary

parsedSource :: TypecheckedModule -> ParsedSource

TypecheckedMod TypecheckedModule

Defined in GHC

Methods

renamedSource :: TypecheckedModule -> Maybe RenamedSource

typecheckedSource :: TypecheckedModule -> TypecheckedSource

moduleInfo :: TypecheckedModule -> ModuleInfo

tm_internals :: TypecheckedModule -> (TcGblEnv, ModDetails)

data ParsedModule

The result of successful parsing.

Instances

ParsedMod ParsedModule

Defined in GHC

Methods

modSummary :: ParsedModule -> ModSummary

parsedSource :: ParsedModule -> ParsedSource

data DesugaredModule

The result of successful desugaring (i.e., translation to core). Also contains all the information of a typechecked module.

Constructors

DesugaredModule

Fields

• dm_typechecked_module :: TypecheckedModule
• dm_core_module :: ModGuts

Instances

DesugaredMod DesugaredModule

Defined in GHC

Methods

coreModule :: DesugaredModule -> ModGuts

ParsedMod DesugaredModule

Defined in GHC

Methods

modSummary :: DesugaredModule -> ModSummary

parsedSource :: DesugaredModule -> ParsedSource

TypecheckedMod DesugaredModule

Defined in GHC

Methods

renamedSource :: DesugaredModule -> Maybe RenamedSource

typecheckedSource :: DesugaredModule -> TypecheckedSource

moduleInfo :: DesugaredModule -> ModuleInfo

tm_internals :: DesugaredModule -> (TcGblEnv, ModDetails)

modInfoTopLevelScope :: ModuleInfo -> Maybe [Name]

isDictonaryId :: Id -> Bool

compileFile :: HscEnv -> Phase -> (FilePath, Maybe Phase) -> IO FilePath

hscTcRcLookupName :: HscEnv -> Name -> IO (Maybe TyThing)

hscDesugar :: HscEnv -> ModSummary -> TcGblEnv -> IO ModGuts

Convert a typechecked module to Core

tcRnLookupRdrName :: HscEnv -> LocatedN RdrName -> IO (Messages DecoratedSDoc, Maybe [Name])

Find all the Names that this RdrName could mean, in GHCi

getModuleInterface :: HscEnv -> Module -> IO (Messages DecoratedSDoc, Maybe ModIface)

ASSUMES that the module is either in the HomePackageTable or is a package module with an interface on disk. If neither of these is true, then the result will be an error indicating the interface could not be found.

dsLExpr :: LHsExpr GhcTc -> DsM CoreExpr

Replace the body of the function with this block to test the hsExprType function in GHC.Tc.Utils.Zonk: putSrcSpanDs loc $ do { core_expr <- dsExpr e ; if debugIsOn && not ( exprType core_expr eqType hsExprType e -- ) then (assertPprPanic "compiler.GHCHsToCoreExpr.hs" 249 ( ppr e + dcolon + ppr (hsExprType e) $$ -- ppr core_expr + dcolon + ppr (exprType core_expr) )) else return ()

initDsWithModGuts :: HscEnv -> ModGuts -> DsM a -> IO (Messages DecoratedSDoc, Maybe a)

Run a DsM action in the context of an existing ModGuts

initDsTc :: DsM a -> TcM a

Run a DsM action inside the TcM monad.

type DsM = TcRnIf DsGblEnv DsLclEnv

Desugaring monad. See also TcM.

tcInferSigma :: Bool -> LHsExpr GhcRn -> TcM TcSigmaType

tcValBinds :: TopLevelFlag -> [(RecFlag, LHsBinds GhcRn)] -> [LSig GhcRn] -> TcM thing -> TcM ([(RecFlag, LHsBinds GhcTc)], thing)

data InferMode

How should we choose which constraints to quantify over?

Constructors

NoRestrictions

Quantify over any constraint that satisfies pickQuantifiablePreds

Instances

Outputable InferMode

Defined in GHC.Tc.Solver

Methods

ppr :: InferMode -> SDoc

simplifyInteractive :: WantedConstraints -> TcM (Bag EvBind)

simplifyInfer :: TcLevel -> InferMode -> [TcIdSigInst] -> [(Name, TcTauType)] -> WantedConstraints -> TcM ([TcTyVar], [EvVar], TcEvBinds, Bool)

captureTopConstraints :: TcM a -> TcM (a, WantedConstraints)

zonkTopLExpr :: LHsExpr GhcTc -> TcM (LHsExpr GhcTc)

loadInterface :: SDoc -> Module -> WhereFrom -> IfM lcl (MaybeErr SDoc ModIface)

cannotFindModule :: HscEnv -> ModuleName -> FindResult -> SDoc

type CommandLineOption = String

Command line options gathered from the -PModule.Name:stuff syntax are given to you as this type

purePlugin :: [CommandLineOption] -> IO PluginRecompile

defaultPlugin :: Plugin

Default plugin: does nothing at all, except for marking that safe inference has failed unless -fplugin-trustworthy is passed. For compatibility reason you should base all your plugin definitions on this default value.

rnLExpr :: LHsExpr GhcPs -> RnM (LHsExpr GhcRn, FreeVars)

tcInferRho :: LHsExpr GhcRn -> TcM (LHsExpr GhcTc, TcRhoType)

reportErrors :: [MsgEnvelope DecoratedSDoc] -> TcM ()

reportError :: MsgEnvelope DecoratedSDoc -> TcRn ()

pushTcLevelM :: TcM a -> TcM (TcLevel, a)

newUnique :: TcRnIf gbl lcl Unique

mkLongErrAt :: SrcSpan -> SDoc -> SDoc -> TcRn (MsgEnvelope DecoratedSDoc)

initIfaceTcRn :: IfG a -> TcRn a

Run an IfG (top-level interface monad) computation inside an existing TcRn (typecheck-renaming monad) computation by initializing an IfGblEnv based on TcGblEnv.

failWithTc :: SDoc -> TcM a

failIfErrsM :: TcRn ()

discardConstraints :: TcM a -> TcM a

Throw out any constraints emitted by the thing_inside

captureConstraints :: TcM a -> TcM (a, WantedConstraints)

data WhereFrom

Constructors

ImportBySystem

Instances

Outputable WhereFrom

Defined in GHC.Tc.Types

Methods

ppr :: WhereFrom -> SDoc

type TcRn = TcRnIf TcGblEnv TcLclEnv

type TcM = TcRn

Historical "type-checking monad" (now it's just TcRn).

data TcGblEnv

TcGblEnv describes the top-level of the module at the point at which the typechecker is finished work. It is this structure that is handed on to the desugarer For state that needs to be updated during the typechecking phase and returned at end, use a TcRef (= IORef).

Instances

ContainsModule TcGblEnv

Defined in GHC.Tc.Types

Methods

extractModule :: TcGblEnv -> Module

data Env gbl lcl

Instances

ContainsHooks (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractHooks :: Env gbl lcl -> Hooks

ContainsDynFlags (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractDynFlags :: Env gbl lcl -> DynFlags

ContainsModule gbl => ContainsModule (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractModule :: Env gbl lcl -> Module

ContainsLogger (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractLogger :: Env gbl lcl -> Logger

getSession :: GhcMonad m => m HscEnv

data Ghc a

A minimal implementation of a GhcMonad. If you need a custom monad, e.g., to maintain additional state consider wrapping this monad or using GhcT.

Instances

MonadFix Ghc

Defined in GHC.Driver.Monad

Methods

mfix :: (a -> Ghc a) -> Ghc a

MonadIO Ghc

Defined in GHC.Driver.Monad

Methods

liftIO :: IO a -> Ghc a

Applicative Ghc

Defined in GHC.Driver.Monad

Methods

pure :: a -> Ghc a

(<*>) :: Ghc (a -> b) -> Ghc a -> Ghc b

liftA2 :: (a -> b -> c) -> Ghc a -> Ghc b -> Ghc c

(*>) :: Ghc a -> Ghc b -> Ghc b

(<*) :: Ghc a -> Ghc b -> Ghc a

Functor Ghc

Defined in GHC.Driver.Monad

Methods

fmap :: (a -> b) -> Ghc a -> Ghc b

(<$) :: a -> Ghc b -> Ghc a

Monad Ghc

Defined in GHC.Driver.Monad

Methods

(>>=) :: Ghc a -> (a -> Ghc b) -> Ghc b

(>>) :: Ghc a -> Ghc b -> Ghc b

return :: a -> Ghc a

MonadCatch Ghc

Defined in GHC.Driver.Monad

Methods

catch :: Exception e => Ghc a -> (e -> Ghc a) -> Ghc a

MonadMask Ghc

Defined in GHC.Driver.Monad

Methods

mask :: ((forall a. Ghc a -> Ghc a) -> Ghc b) -> Ghc b

uninterruptibleMask :: ((forall a. Ghc a -> Ghc a) -> Ghc b) -> Ghc b

generalBracket :: Ghc a -> (a -> ExitCase b -> Ghc c) -> (a -> Ghc b) -> Ghc (b, c)

MonadThrow Ghc

Defined in GHC.Driver.Monad

Methods

throwM :: Exception e => e -> Ghc a

GhcMonad Ghc

Defined in GHC.Driver.Monad

Methods

getSession :: Ghc HscEnv

setSession :: HscEnv -> Ghc ()

HasDynFlags Ghc

Defined in GHC.Driver.Monad

Methods

getDynFlags :: Ghc DynFlags

HasLogger Ghc

Defined in GHC.Driver.Monad

Methods

getLogger :: Ghc Logger

withSession :: GhcMonad m => (HscEnv -> m a) -> m a

Call the argument with the current session.

findImportedModule :: HscEnv -> ModuleName -> Maybe FastString -> IO FindResult

Locate a module that was imported by the user. We have the module's name, and possibly a package name. Without a package name, this function will use the search path and the known exposed packages to find the module, if a package is specified then only that package is searched for the module.

findExposedPackageModule :: HscEnv -> ModuleName -> Maybe FastString -> IO FindResult

data HscEnv

HscEnv is like Session, except that some of the fields are immutable. An HscEnv is used to compile a single module from plain Haskell source code (after preprocessing) to either C, assembly or C--. It's also used to store the dynamic linker state to allow for multiple linkers in the same address space. Things like the module graph don't change during a single compilation.

Historical note: "hsc" used to be the name of the compiler binary, when there was a separate driver and compiler. To compile a single module, the driver would invoke hsc on the source code... so nowadays we think of hsc as the layer of the compiler that deals with compiling a single module.

isNumericClass :: Class -> Bool

lexprCtOrigin :: LHsExpr GhcRn -> CtOrigin

Extract a suitable CtOrigin from a HsExpr

data ModGuts

A ModGuts is carried through the compiler, accumulating stuff as it goes There is only one ModGuts at any time, the one for the module being compiled right now. Once it is compiled, a ModIface and ModDetails are extracted and the ModGuts is discarded.

data ExternalPackageState

Information about other packages that we have slurped in by reading their interface files

type HomePackageTable = DModuleNameEnv HomeModInfo

Helps us find information about modules in the home package

data HomeModInfo

Information about modules in the package being compiled

lookupHpt :: HomePackageTable -> ModuleName -> Maybe HomeModInfo

data ModIface_ (phase :: ModIfacePhase)

A ModIface_ plus a ModDetails summarises everything we know about a compiled module. The ModIface_ is the stuff *before* linking, and can be written out to an interface file. The 'ModDetails is after linking and can be completely recovered from just the ModIface_.

When we read an interface file, we also construct a ModIface_ from it, except that we explicitly make the mi_decls and a few other fields empty; as when reading we consolidate the declarations etc. into a number of indexed maps and environments in the ExternalPackageState.

Instances

Binary ModIface

Defined in GHC.Unit.Module.ModIface

Methods

put_ :: BinHandle -> ModIface -> IO ()

put :: BinHandle -> ModIface -> IO (Bin ModIface)

get :: BinHandle -> IO ModIface

(NFData (IfaceBackendExts phase), NFData (IfaceDeclExts phase)) => NFData (ModIface_ phase)

Defined in GHC.Unit.Module.ModIface

Methods

rnf :: ModIface_ phase -> ()

data ModSummary

Data for a module node in a ModuleGraph. Module nodes of the module graph are one of:

• A regular Haskell source module
• A hi-boot source module

Instances

Outputable ModSummary

Defined in GHC.Unit.Module.ModSummary

Methods

ppr :: ModSummary -> SDoc

ms_mod_name :: ModSummary -> ModuleName

data HsModule

Haskell Module

All we actually declare here is the top-level structure for a module.

Instances

Data HsModule

Defined in GHC.Hs

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsModule -> c HsModule

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsModule

toConstr :: HsModule -> Constr

dataTypeOf :: HsModule -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsModule)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsModule)

gmapT :: (forall b. Data b => b -> b) -> HsModule -> HsModule

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsModule -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsModule -> r

gmapQ :: (forall d. Data d => d -> u) -> HsModule -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsModule -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

Outputable HsModule

Defined in GHC.Hs

Methods

ppr :: HsModule -> SDoc

pAT_ERROR_ID :: Id

mkCoreLets :: [CoreBind] -> CoreExpr -> CoreExpr

Bind a list of binding groups over an expression. The leftmost binding group becomes the outermost group in the resulting expression

mkCoreLams :: [CoreBndr] -> CoreExpr -> CoreExpr

Create a lambda where the given expression has a number of variables bound over it. The leftmost binder is that bound by the outermost lambda in the result

mkCoreConApps :: DataCon -> [CoreExpr] -> CoreExpr

Construct an expression which represents the application of a number of expressions to that of a data constructor expression. The leftmost expression in the list is applied first

mkCoreApps :: CoreExpr -> [CoreExpr] -> CoreExpr infixl 4

Construct an expression which represents the application of a number of expressions to another. The leftmost expression in the list is applied first Respects the let/app invariant by building a case expression where necessary See Note [Core let/app invariant] in GHC.Core

nlVarPat :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LPat (GhcPass p)

nlList :: [LHsExpr GhcPs] -> LHsExpr GhcPs

nlHsVar :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LHsExpr (GhcPass p)

nlHsTyVar :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LHsType (GhcPass p)

nlHsTyConApp :: forall (p :: Pass) a. IsSrcSpanAnn p a => LexicalFixity -> IdP (GhcPass p) -> [LHsTypeArg (GhcPass p)] -> LHsType (GhcPass p)

nlHsIf :: LHsExpr GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs

nlHsFunTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

nlHsAppTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

mkHsLam :: forall (p :: Pass). (IsPass p, XMG (GhcPass p) (LHsExpr (GhcPass p)) ~ NoExtField) => [LPat (GhcPass p)] -> LHsExpr (GhcPass p) -> LHsExpr (GhcPass p)

mkHsIntegral :: IntegralLit -> HsOverLit GhcPs

mkHsFractional :: FractionalLit -> HsOverLit GhcPs

mkHsDictLet :: TcEvBinds -> LHsExpr GhcTc -> LHsExpr GhcTc

mkHsApp :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

hsTypeToHsSigWcType :: LHsType GhcPs -> LHsSigWcType GhcPs

Convert an LHsType to an LHsSigWcType.

hsTypeToHsSigType :: LHsType GhcPs -> LHsSigType GhcPs

Convert an LHsType to an LHsSigType.

mkHsForAllInvisTele :: forall (p :: Pass). EpAnnForallTy -> [LHsTyVarBndr Specificity (GhcPass p)] -> HsForAllTelescope (GhcPass p)

type LHsDecl p

Arguments

 = XRec p (HsDecl p)

When in a list this may have

• AnnKeywordId : AnnSemi

data HsDecl p

A Haskell Declaration

Constructors

SigD (XSigD p) (Sig p)

Signature declaration

Instances

type Anno (HsDecl (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA

data Sig pass

Signatures and pragmas

Constructors

TypeSig (XTypeSig pass) [LIdP pass] (LHsSigWcType pass)

An ordinary type signature

f :: Num a => a -> a

After renaming, this list of Names contains the named wildcards brought into scope by this signature. For a signature _ -> _a -> Bool, the renamer will leave the unnamed wildcard _ untouched, and the named wildcard _a is then replaced with fresh meta vars in the type. Their names are stored in the type signature that brought them into scope, in this third field to be more specific.

• AnnKeywordId : AnnDcolon, AnnComma

FixSig (XFixSig pass) (FixitySig pass)

An ordinary fixity declaration

    infixl 8 ***

• AnnKeywordId : AnnInfix, AnnVal

InlineSig (XInlineSig pass) (LIdP pass) InlinePragma

An inline pragma

{#- INLINE f #-}

• AnnKeywordId : AnnOpen '{-# INLINE' and '[', AnnClose,AnnOpen, AnnVal,AnnTilde, AnnClose

Instances

type Anno (Sig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (Sig (GhcPass p)) = SrcSpanAnnA

data FixitySig pass

Fixity Signature

Constructors

FixitySig (XFixitySig pass) [LIdP pass] Fixity

Instances

type Anno (FixitySig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA

type LHsType pass

Arguments

 = XRec pass (HsType pass)

May have AnnKeywordId : AnnComma when in a list

Located Haskell Type

data HsWildCardBndrs pass thing

Haskell Wildcard Binders

Constructors

HsWC (XHsWC pass thing) thing

data HsType pass

Haskell Type

Constructors

HsForAllTy (XForAllTy pass) (HsForAllTelescope pass) (LHsType pass)

• AnnKeywordId : AnnForall, AnnDot,AnnDarrow For details on above see note [exact print annotations] in GHC.Parser.Annotation

HsQualTy (XQualTy pass) (Maybe (LHsContext pass)) (LHsType pass)

HsTyVar (XTyVar pass) PromotionFlag (LIdP pass)

• AnnKeywordId : None

HsAppTy (XAppTy pass) (LHsType pass) (LHsType pass)

• AnnKeywordId : None

HsWildCardTy (XWildCardTy pass)

• AnnKeywordId : None

Instances

DisambTD (HsType GhcPs)

Defined in GHC.Parser.PostProcess

Methods

mkHsAppTyHeadPV :: LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkHsAppTyPV :: LocatedA (HsType GhcPs) -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkHsAppKindTyPV :: LocatedA (HsType GhcPs) -> SrcSpan -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkHsOpTyPV :: LHsType GhcPs -> LocatedN RdrName -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkUnpackednessPV :: Located UnpackednessPragma -> LocatedA (HsType GhcPs) -> PV (LocatedA (HsType GhcPs))

type Anno (BangType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (BangType (GhcPass p)) = SrcSpanAnnA

type Anno (HsKind (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsKind (GhcPass p)) = SrcSpanAnnA

type Anno (HsType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsType (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

data HsTyVarBndr flag pass

Haskell Type Variable Binder The flag annotates the binder. It is Specificity in places where explicit specificity is allowed (e.g. x :: forall {a} b. ...) or () in other places.

Constructors

UserTyVar (XUserTyVar pass) flag (LIdP pass)

Instances

type Anno (HsTyVarBndr _flag (GhcPass _1))

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcPs)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcRn)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcTc)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA

data HsSigType pass

A type signature that obeys the forall-or-nothing rule. In other words, an LHsType that uses an HsOuterSigTyVarBndrs to represent its outermost type variable quantification. See Note [Representing type signatures].

Constructors

HsSig (XHsSig pass) (HsOuterSigTyVarBndrs pass) (LHsType pass)

Instances

type Anno (HsSigType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA

data HsOuterTyVarBndrs flag pass

The outermost type variables in a type that obeys the forall-or-nothing rule. See Note [forall-or-nothing rule].

Constructors

HsOuterImplicit (XHsOuterImplicit pass)

Implicit forall, e.g., f :: a -> b -> b

Instances

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))

Defined in GHC.Hs.Type

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA

data HsArg tm ty

Constructors

HsValArg tm

Instances

(Outputable tm, Outputable ty) => Outputable (HsArg tm ty)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsArg tm ty -> SDoc

type LImportDecl pass

Arguments

 = XRec pass (ImportDecl pass)

When in a list this may have

• AnnKeywordId : AnnSemi

Located Import Declaration

ideclAs :: ImportDecl pass -> Maybe (XRec pass ModuleName)

as Module

ideclName :: ImportDecl pass -> XRec pass ModuleName

Module name.

type GhcRn = GhcPass 'Renamed

type GhcPs = GhcPass 'Parsed

occurAnalysePgm :: Module -> (Id -> Bool) -> (Activation -> Bool) -> [CoreRule] -> CoreProgram -> CoreProgram

substExpr :: HasDebugCallStack => Subst -> CoreExpr -> CoreExpr

substExpr applies a substitution to an entire CoreExpr. Remember, you may only apply the substitution once: See Note [Substitutions apply only once] in GHC.Core.TyCo.Subst

Do *not* attempt to short-cut in the case of an empty substitution! See Note [Extending the Subst]

extendIdSubst :: Subst -> Id -> CoreExpr -> Subst

Add a substitution for an Id to the Subst: you must ensure that the in-scope set is such that TyCoSubst Note [The substitution invariant] holds after extending the substitution like this

extendCvSubst :: Subst -> CoVar -> Coercion -> Subst

Add a substitution from a CoVar to a Expr to the Subst: you must ensure that the in-scope set satisfies GHC.Core.TyCo.Subst Note [The substitution invariant] after extending the substitution like this

emptySubst :: Subst

deShadowBinds :: CoreProgram -> CoreProgram

De-shadowing the program is sometimes a useful pre-pass. It can be done simply by running over the bindings with an empty substitution, because substitution returns a result that has no-shadowing guaranteed.

(Actually, within a single type there might still be shadowing, because substTy is a no-op for the empty substitution, but that's probably OK.)

Aug 09

This function is not used in GHC at the moment, but seems so short and simple that I'm going to leave it here

exprType :: CoreExpr -> Type

Recover the type of a well-typed Core expression. Fails when applied to the actual Type expression as it cannot really be said to have a type

data TcEvBinds

Constructors

EvBinds (Bag EvBind)

Instances

Data TcEvBinds

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TcEvBinds -> c TcEvBinds

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TcEvBinds

toConstr :: TcEvBinds -> Constr

dataTypeOf :: TcEvBinds -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TcEvBinds)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TcEvBinds)

gmapT :: (forall b. Data b => b -> b) -> TcEvBinds -> TcEvBinds

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TcEvBinds -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TcEvBinds -> r

gmapQ :: (forall d. Data d => d -> u) -> TcEvBinds -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TcEvBinds -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds

Outputable TcEvBinds

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: TcEvBinds -> SDoc

data ClsInst

A type-class instance. Note that there is some tricky laziness at work here. See Note [ClsInst laziness and the rough-match fields] for more details.

Instances

Data ClsInst

Defined in GHC.Core.InstEnv

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ClsInst -> c ClsInst

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ClsInst

toConstr :: ClsInst -> Constr

dataTypeOf :: ClsInst -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ClsInst)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ClsInst)

gmapT :: (forall b. Data b => b -> b) -> ClsInst -> ClsInst

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ClsInst -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ClsInst -> r

gmapQ :: (forall d. Data d => d -> u) -> ClsInst -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ClsInst -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ClsInst -> m ClsInst

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ClsInst -> m ClsInst

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ClsInst -> m ClsInst

NamedThing ClsInst

Defined in GHC.Core.InstEnv

Methods

getOccName :: ClsInst -> OccName

getName :: ClsInst -> Name

Outputable ClsInst

Defined in GHC.Core.InstEnv

Methods

ppr :: ClsInst -> SDoc

instanceSig :: ClsInst -> ([TyVar], [Type], Class, [Type])

instanceDFunId :: ClsInst -> DFunId

instEnvElts :: InstEnv -> [ClsInst]

tcSplitMethodTy :: Type -> ([TyVar], PredType, Type)

tcSplitDFunTy :: Type -> ([TyVar], [Type], Class, [Type])

exprFreeVarsList :: CoreExpr -> [Var]

Find all locally-defined free Ids or type variables in an expression returning a deterministically ordered list.

data IfaceAnnotation

Instances

NFData IfaceAnnotation

Defined in GHC.Iface.Syntax

Methods

rnf :: IfaceAnnotation -> ()

Binary IfaceAnnotation

Defined in GHC.Iface.Syntax

Methods

put_ :: BinHandle -> IfaceAnnotation -> IO ()

put :: BinHandle -> IfaceAnnotation -> IO (Bin IfaceAnnotation)

get :: BinHandle -> IO IfaceAnnotation

Outputable IfaceAnnotation

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceAnnotation -> SDoc

true_RDR :: RdrName

trueDataConId :: Id

trueDataCon :: DataCon

stringTy :: Type

nilDataCon :: DataCon

listTyConName :: Name

intTyConName :: Name

intTyCon :: TyCon

intTy :: Type

intDataCon :: DataCon

falseDataConId :: Id

falseDataCon :: DataCon

consDataCon :: DataCon

charTyCon :: TyCon

charDataCon :: DataCon

boolTyConName :: Name

boolTyCon :: TyCon

boolTy :: Type

anyTy :: Type

setIdInfo :: Id -> IdInfo -> Id

realIdUnfolding :: Id -> Unfolding

modifyIdInfo :: HasDebugCallStack => (IdInfo -> IdInfo) -> Id -> Id

mkUserLocal :: OccName -> Unique -> Mult -> Type -> SrcSpan -> Id

Create a user local Id. These are local Ids (see GHC.Types.Var) with a name and location that the user might recognize

mkExportedLocalId :: IdDetails -> Name -> Type -> Id

Create a local Id that is marked as exported. This prevents things attached to it from being removed as dead code. See Note [Exported LocalIds]

isRecordSelector :: Id -> Bool

isDFunId :: Id -> Bool

isConLikeId :: Id -> Bool

isClassOpId_maybe :: Id -> Maybe Class

idType :: Id -> Kind

idOccInfo :: Id -> OccInfo

idDataCon :: Id -> DataCon

Get from either the worker or the wrapper Id to the DataCon. Currently used only in the desugarer.

INVARIANT: idDataCon (dataConWrapId d) = d: remember, dataConWrapId can return either the wrapper or the worker

data CafInfo

Constant applicative form Information

Records whether an Id makes Constant Applicative Form references

Constructors

NoCafRefs

A function or static constructor that refers to no CAFs.

Instances

Outputable CafInfo

Defined in GHC.Types.Id.Info

Methods

ppr :: CafInfo -> SDoc

Eq CafInfo

Defined in GHC.Types.Id.Info

Methods

(==) :: CafInfo -> CafInfo -> Bool

(/=) :: CafInfo -> CafInfo -> Bool

Ord CafInfo

Defined in GHC.Types.Id.Info

Methods

compare :: CafInfo -> CafInfo -> Ordering

(<) :: CafInfo -> CafInfo -> Bool

(<=) :: CafInfo -> CafInfo -> Bool

(>) :: CafInfo -> CafInfo -> Bool

(>=) :: CafInfo -> CafInfo -> Bool

max :: CafInfo -> CafInfo -> CafInfo

min :: CafInfo -> CafInfo -> CafInfo

setOccInfo :: IdInfo -> OccInfo -> IdInfo infixl 1

setCafInfo :: IdInfo -> CafInfo -> IdInfo infixl 1

mayHaveCafRefs :: CafInfo -> Bool

cafInfo :: IdInfo -> CafInfo

Id CAF info

data Unfolding

Records the unfolding of an identifier, which is approximately the form the identifier would have if we substituted its definition in for the identifier. This type should be treated as abstract everywhere except in GHC.Core.Unfold

Constructors

DFunUnfolding [Var] DataCon [CoreExpr]

CoreUnfolding CoreExpr UnfoldingSource Bool Bool Bool Bool Bool UnfoldingGuidance

An unfolding with redundant cached information. Parameters:

uf_tmpl: Template used to perform unfolding; NB: Occurrence info is guaranteed correct: see Note [OccInfo in unfoldings and rules]

uf_is_top: Is this a top level binding?

uf_is_value: exprIsHNF template (cached); it is ok to discard a seq on this variable

uf_is_work_free: Does this waste only a little work if we expand it inside an inlining? Basically this is a cached version of exprIsWorkFree

uf_guidance: Tells us about the size of the unfolding template

data Expr b

This is the data type that represents GHCs core intermediate language. Currently GHC uses System FC https://www.microsoft.com/en-us/research/publication/system-f-with-type-equality-coercions/ for this purpose, which is closely related to the simpler and better known System F http://en.wikipedia.org/wiki/System_F.

We get from Haskell source to this Core language in a number of stages:

1. The source code is parsed into an abstract syntax tree, which is represented by the data type HsExpr with the names being RdrNames
2. This syntax tree is renamed, which attaches a Unique to every RdrName (yielding a Name) to disambiguate identifiers which are lexically identical. For example, this program:

     f x = let f x = x + 1
           in f (x - 2)

Would be renamed by having Uniques attached so it looked something like this:

     f_1 x_2 = let f_3 x_4 = x_4 + 1
               in f_3 (x_2 - 2)

But see Note [Shadowing] below.

1. The resulting syntax tree undergoes type checking (which also deals with instantiating type class arguments) to yield a HsExpr type that has Id as it's names.
2. Finally the syntax tree is desugared from the expressive HsExpr type into this Expr type, which has far fewer constructors and hence is easier to perform optimization, analysis and code generation on.

The type parameter b is for the type of binders in the expression tree.

The language consists of the following elements:

• Variables See Note [Variable occurrences in Core]
• Primitive literals
• Applications: note that the argument may be a Expr. See Note [Core let/app invariant] See Note [Levity polymorphism invariants]
• Lambda abstraction See Note [Levity polymorphism invariants]
• Recursive and non recursive lets. Operationally this corresponds to allocating a thunk for the things bound and then executing the sub-expression.

See Note [Core letrec invariant] See Note [Core let/app invariant] See Note [Levity polymorphism invariants] See Note [Core type and coercion invariant]

• Case expression. Operationally this corresponds to evaluating the scrutinee (expression examined) to weak head normal form and then examining at most one level of resulting constructor (i.e. you cannot do nested pattern matching directly with this).

The binder gets bound to the value of the scrutinee, and the Expr must be that of all the case alternatives

IMPORTANT: see Note [Case expression invariants]

• Cast an expression to a particular type. This is used to implement newtypes (a newtype constructor or destructor just becomes a Cast in Core) and GADTs.
• Ticks. These are used to represent all the source annotation we support: profiling SCCs, HPC ticks, and GHCi breakpoints.
• A type: this should only show up at the top level of an Arg
• A coercion

Constructors

Var Id

Lit Literal

App (Expr b) (Arg b) infixl 4

Lam b (Expr b)

Let (Bind b) (Expr b)

Case (Expr b) b Type [Alt b]

Cast (Expr b) CoercionR

Tick CoreTickish (Expr b)

Type Type

Coercion Coercion

Instances

Show CoreExpr

Defined in Language.Haskell.Liquid.Transforms.CoreToLogic

Methods

showsPrec :: Int -> CoreExpr -> ShowS

show :: CoreExpr -> String

showList :: [CoreExpr] -> ShowS

Subable CoreExpr

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> CoreExpr -> CoreExpr

subTy :: HashMap TyVar Type -> CoreExpr -> CoreExpr

Data b => Data (Expr b)

Defined in GHC.Core

Methods

gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Expr b -> c (Expr b)

gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Expr b)

toConstr :: Expr b -> Constr

dataTypeOf :: Expr b -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Expr b))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Expr b))

gmapT :: (forall b0. Data b0 => b0 -> b0) -> Expr b -> Expr b

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Expr b -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Expr b -> r

gmapQ :: (forall d. Data d => d -> u) -> Expr b -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Expr b -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Expr b -> m (Expr b)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Expr b -> m (Expr b)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Expr b -> m (Expr b)

PPrint (Expr Var)

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> Expr Var -> Doc

pprintPrec :: Int -> Tidy -> Expr Var -> Doc

CBVisitable (Expr Var)

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> Expr Var -> [Var]

readVars :: Expr Var -> [Var]

letVars :: Expr Var -> [Var]

literals :: Expr Var -> [Literal]

Show (Axiom Var Type CoreExpr)

Defined in Language.Haskell.Liquid.Types.Types

Methods

showsPrec :: Int -> Axiom Var Type CoreExpr -> ShowS

show :: Axiom Var Type CoreExpr -> String

showList :: [Axiom Var Type CoreExpr] -> ShowS

type CoreProgram = [CoreBind]

type CoreExpr = Expr CoreBndr

Expressions where binders are CoreBndrs

type CoreBndr = Var

The common case for the type of binders and variables when we are manipulating the Core language within GHC

type CoreBind = Bind CoreBndr

Binding groups where binders are CoreBndrs

type CoreArg = Arg CoreBndr

Argument expressions where binders are CoreBndrs

type CoreAlt = Alt CoreBndr

Case alternatives where binders are CoreBndrs

data Bind b

Binding, used for top level bindings in a module and local bindings in a let.

Constructors

NonRec b (Expr b)

Rec [(b, Expr b)]

Instances

CBVisitable CoreBind

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> CoreBind -> [Var]

readVars :: CoreBind -> [Var]

letVars :: CoreBind -> [Var]

literals :: CoreBind -> [Literal]

Data b => Data (Bind b)

Defined in GHC.Core

Methods

gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Bind b -> c (Bind b)

gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Bind b)

toConstr :: Bind b -> Constr

dataTypeOf :: Bind b -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Bind b))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Bind b))

gmapT :: (forall b0. Data b0 => b0 -> b0) -> Bind b -> Bind b

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bind b -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bind b -> r

gmapQ :: (forall d. Data d => d -> u) -> Bind b -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Bind b -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bind b -> m (Bind b)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bind b -> m (Bind b)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bind b -> m (Bind b)

PPrint (Bind Var)

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> Bind Var -> Doc

pprintPrec :: Int -> Tidy -> Bind Var -> Doc

Subable (Bind Var)

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> Bind Var -> Bind Var

subTy :: HashMap TyVar Type -> Bind Var -> Bind Var

CBVisitable [CoreBind]

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> [CoreBind] -> [Var]

readVars :: [CoreBind] -> [Var]

letVars :: [CoreBind] -> [Var]

literals :: [CoreBind] -> [Literal]

type Arg b = Expr b

Type synonym for expressions that occur in function argument positions. Only Arg should contain a Expr at top level, general Expr should not

data AltCon

A case alternative constructor (i.e. pattern match)

Constructors

DataAlt DataCon

LitAlt Literal

A literal: case e of { 1 -> ... } Invariant: always an *unlifted* literal See Note [Literal alternatives]

DEFAULT

Trivial alternative: case e of { _ -> ... }

Instances

Data AltCon

Defined in GHC.Core

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AltCon -> c AltCon

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AltCon

toConstr :: AltCon -> Constr

dataTypeOf :: AltCon -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AltCon)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AltCon)

gmapT :: (forall b. Data b => b -> b) -> AltCon -> AltCon

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AltCon -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AltCon -> r

gmapQ :: (forall d. Data d => d -> u) -> AltCon -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AltCon -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AltCon -> m AltCon

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AltCon -> m AltCon

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AltCon -> m AltCon

Outputable AltCon

Defined in GHC.Core

Methods

ppr :: AltCon -> SDoc

Eq AltCon

Defined in GHC.Core

Methods

(==) :: AltCon -> AltCon -> Bool

(/=) :: AltCon -> AltCon -> Bool

Ord AltCon

Defined in GHC.Core

Methods

compare :: AltCon -> AltCon -> Ordering

(<) :: AltCon -> AltCon -> Bool

(<=) :: AltCon -> AltCon -> Bool

(>) :: AltCon -> AltCon -> Bool

(>=) :: AltCon -> AltCon -> Bool

max :: AltCon -> AltCon -> AltCon

min :: AltCon -> AltCon -> AltCon

CBVisitable AltCon

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> AltCon -> [Var]

readVars :: AltCon -> [Var]

letVars :: AltCon -> [Var]

literals :: AltCon -> [Literal]

data Alt b

A case split alternative. Consists of the constructor leading to the alternative, the variables bound from the constructor, and the expression to be executed given that binding. The default alternative is (DEFAULT, [], rhs)

Constructors

Alt AltCon [b] (Expr b)

Instances

Data b => Data (Alt b)

Defined in GHC.Core

Methods

gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Alt b -> c (Alt b)

gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Alt b)

toConstr :: Alt b -> Constr

dataTypeOf :: Alt b -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Alt b))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Alt b))

gmapT :: (forall b0. Data b0 => b0 -> b0) -> Alt b -> Alt b

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Alt b -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Alt b -> r

gmapQ :: (forall d. Data d => d -> u) -> Alt b -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Alt b -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Alt b -> m (Alt b)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Alt b -> m (Alt b)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Alt b -> m (Alt b)

Subable (Alt Var)

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> Alt Var -> Alt Var

subTy :: HashMap TyVar Type -> Alt Var -> Alt Var

CBVisitable (Alt Var)

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> Alt Var -> [Var]

readVars :: Alt Var -> [Var]

letVars :: Alt Var -> [Var]

literals :: Alt Var -> [Literal]

mkTyArg :: Type -> Expr b

mkTyApps :: Expr b -> [Type] -> Expr b infixl 4

Apply a list of type argument expressions to a function expression in a nested fashion

mkLams :: [b] -> Expr b -> Expr b

Bind all supplied binders over an expression in a nested lambda expression. Prefer to use mkCoreLams if possible

mkApps :: Expr b -> [Arg b] -> Expr b infixl 4

Apply a list of argument expressions to a function expression in a nested fashion. Prefer to use mkCoreApps if possible

maybeUnfoldingTemplate :: Unfolding -> Maybe CoreExpr

Retrieves the template of an unfolding if possible maybeUnfoldingTemplate is used mainly wnen specialising, and we do want to specialise DFuns, so it's important to return a template for DFunUnfoldings

isTypeArg :: Expr b -> Bool

Returns True iff the expression is a Expr expression at its top level. Note this does NOT include Exprs.

flattenBinds :: [Bind b] -> [(b, Expr b)]

Collapse all the bindings in the supplied groups into a single list of lhs/rhs pairs suitable for binding in a Rec binding group

collectTyBinders :: CoreExpr -> ([TyVar], CoreExpr)

collectTyAndValBinders :: CoreExpr -> ([TyVar], [Id], CoreExpr)

collectBinders :: Expr b -> ([b], Expr b)

We often want to strip off leading lambdas before getting down to business. Variants are collectTyBinders, collectValBinders, and collectTyAndValBinders

collectArgs :: Expr b -> (Expr b, [Arg b])

Takes a nested application expression and returns the function being applied and the arguments to which it is applied

cmpAlt :: Alt a -> Alt a -> Ordering

bindersOf :: Bind b -> [b]

Extract every variable by this group

data GenTickish (pass :: TickishPass)

Constructors

ProfNote

An {-# SCC #-} profiling annotation, either automatically added by the desugarer as a result of -auto-all, or added by the user.

Fields

• profNoteCC :: CostCentre

  the cost centre

• profNoteCount :: !Bool

  bump the entry count?

• profNoteScope :: !Bool

  scopes over the enclosed expression (i.e. not just a tick)

HpcTick

A "tick" used by HPC to track the execution of each subexpression in the original source code.

Fields

• tickModule :: Module
• tickId :: !Int

Breakpoint

A breakpoint for the GHCi debugger. This behaves like an HPC tick, but has a list of free variables which will be available for inspection in GHCi when the program stops at the breakpoint.

NB. we must take account of these Ids when (a) counting free variables, and (b) substituting (don't substitute for them)

Fields

• breakpointExt :: XBreakpoint pass
• breakpointId :: !Int
• breakpointFVs :: [XTickishId pass]

  the order of this list is important: it matches the order of the lists in the appropriate entry in ModBreaks.

  Careful about substitution! See Note [substTickish] in GHC.Core.Subst.

SourceNote

A source note.

Source notes are pure annotations: Their presence should neither influence compilation nor execution. The semantics are given by causality: The presence of a source note means that a local change in the referenced source code span will possibly provoke the generated code to change. On the flip-side, the functionality of annotated code *must* be invariant against changes to all source code *except* the spans referenced in the source notes (see "Causality of optimized Haskell" paper for details).

Therefore extending the scope of any given source note is always valid. Note that it is still undesirable though, as this reduces their usefulness for debugging and profiling. Therefore we will generally try only to make use of this property where it is necessary to enable optimizations.

Fields

• sourceSpan :: RealSrcSpan

  Source covered

• sourceName :: String

  Name for source location (uses same names as CCs)

Instances

Data (GenTickish 'TickishPassCmm)

Defined in GHC.Types.Tickish

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenTickish 'TickishPassCmm -> c (GenTickish 'TickishPassCmm)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GenTickish 'TickishPassCmm)

toConstr :: GenTickish 'TickishPassCmm -> Constr

dataTypeOf :: GenTickish 'TickishPassCmm -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GenTickish 'TickishPassCmm))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GenTickish 'TickishPassCmm))

gmapT :: (forall b. Data b => b -> b) -> GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenTickish 'TickishPassCmm -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenTickish 'TickishPassCmm -> r

gmapQ :: (forall d. Data d => d -> u) -> GenTickish 'TickishPassCmm -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GenTickish 'TickishPassCmm -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassCmm -> m (GenTickish 'TickishPassCmm)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassCmm -> m (GenTickish 'TickishPassCmm)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassCmm -> m (GenTickish 'TickishPassCmm)

Data (GenTickish 'TickishPassCore)

Defined in GHC.Types.Tickish

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenTickish 'TickishPassCore -> c (GenTickish 'TickishPassCore)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GenTickish 'TickishPassCore)

toConstr :: GenTickish 'TickishPassCore -> Constr

dataTypeOf :: GenTickish 'TickishPassCore -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GenTickish 'TickishPassCore))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GenTickish 'TickishPassCore))

gmapT :: (forall b. Data b => b -> b) -> GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenTickish 'TickishPassCore -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenTickish 'TickishPassCore -> r

gmapQ :: (forall d. Data d => d -> u) -> GenTickish 'TickishPassCore -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GenTickish 'TickishPassCore -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassCore -> m (GenTickish 'TickishPassCore)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassCore -> m (GenTickish 'TickishPassCore)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassCore -> m (GenTickish 'TickishPassCore)

Data (GenTickish 'TickishPassStg)

Defined in GHC.Types.Tickish

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenTickish 'TickishPassStg -> c (GenTickish 'TickishPassStg)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GenTickish 'TickishPassStg)

toConstr :: GenTickish 'TickishPassStg -> Constr

dataTypeOf :: GenTickish 'TickishPassStg -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GenTickish 'TickishPassStg))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GenTickish 'TickishPassStg))

gmapT :: (forall b. Data b => b -> b) -> GenTickish 'TickishPassStg -> GenTickish 'TickishPassStg

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenTickish 'TickishPassStg -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenTickish 'TickishPassStg -> r

gmapQ :: (forall d. Data d => d -> u) -> GenTickish 'TickishPassStg -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GenTickish 'TickishPassStg -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassStg -> m (GenTickish 'TickishPassStg)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassStg -> m (GenTickish 'TickishPassStg)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenTickish 'TickishPassStg -> m (GenTickish 'TickishPassStg)

Eq (GenTickish 'TickishPassCmm)

Defined in GHC.Types.Tickish

Methods

(==) :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> Bool

(/=) :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> Bool

Eq (GenTickish 'TickishPassCore)

Defined in GHC.Types.Tickish

Methods

(==) :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> Bool

(/=) :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> Bool

Ord (GenTickish 'TickishPassCmm)

Defined in GHC.Types.Tickish

Methods

compare :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> Ordering

(<) :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> Bool

(<=) :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> Bool

(>) :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> Bool

(>=) :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> Bool

max :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm

min :: GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm -> GenTickish 'TickishPassCmm

Ord (GenTickish 'TickishPassCore)

Defined in GHC.Types.Tickish

Methods

compare :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> Ordering

(<) :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> Bool

(<=) :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> Bool

(>) :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> Bool

(>=) :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> Bool

max :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore

min :: GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore -> GenTickish 'TickishPassCore

type CoreTickish = GenTickish 'TickishPassCore

type LHsExpr p

Arguments

 = XRec p (HsExpr p)

May have AnnKeywordId : AnnComma when in a list

Located Haskell Expression

data HsExpr p

A Haskell expression.

Constructors

HsVar (XVar p) (LIdP p)

Variable See Note [Located RdrNames]

HsOverLit (XOverLitE p) (HsOverLit p)

Overloaded literals

ExprWithTySig (XExprWithTySig p) (LHsExpr p) (LHsSigWcType (NoGhcTc p))

Expression with an explicit type signature. e :: type

• AnnKeywordId : AnnDcolon

Instances

DisambECP (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

Associated Types

type Body (HsExpr GhcPs) :: Type -> Type

type InfixOp (HsExpr GhcPs)

type FunArg (HsExpr GhcPs)

Methods

ecpFromCmd' :: LHsCmd GhcPs -> PV (LocatedA (HsExpr GhcPs))

ecpFromExp' :: LHsExpr GhcPs -> PV (LocatedA (HsExpr GhcPs))

mkHsProjUpdatePV :: SrcSpan -> Located [Located (HsFieldLabel GhcPs)] -> LocatedA (HsExpr GhcPs) -> Bool -> [AddEpAnn] -> PV (LHsRecProj GhcPs (LocatedA (HsExpr GhcPs)))

mkHsLamPV :: SrcSpan -> (EpAnnComments -> MatchGroup GhcPs (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs))

mkHsLetPV :: SrcSpan -> HsLocalBinds GhcPs -> LocatedA (HsExpr GhcPs) -> AnnsLet -> PV (LocatedA (HsExpr GhcPs))

superInfixOp :: (DisambInfixOp (InfixOp (HsExpr GhcPs)) => PV (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs))

mkHsOpAppPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> LocatedN (InfixOp (HsExpr GhcPs)) -> LocatedA (HsExpr GhcPs) -> PV (LocatedA (HsExpr GhcPs))

mkHsCasePV :: SrcSpan -> LHsExpr GhcPs -> LocatedL [LMatch GhcPs (LocatedA (HsExpr GhcPs))] -> EpAnnHsCase -> PV (LocatedA (HsExpr GhcPs))

mkHsLamCasePV :: SrcSpan -> LocatedL [LMatch GhcPs (LocatedA (HsExpr GhcPs))] -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

superFunArg :: (DisambECP (FunArg (HsExpr GhcPs)) => PV (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs))

mkHsAppPV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LocatedA (FunArg (HsExpr GhcPs)) -> PV (LocatedA (HsExpr GhcPs))

mkHsAppTypePV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> SrcSpan -> LHsType GhcPs -> PV (LocatedA (HsExpr GhcPs))

mkHsIfPV :: SrcSpan -> LHsExpr GhcPs -> Bool -> LocatedA (HsExpr GhcPs) -> Bool -> LocatedA (HsExpr GhcPs) -> AnnsIf -> PV (LocatedA (HsExpr GhcPs))

mkHsDoPV :: SrcSpan -> Maybe ModuleName -> LocatedL [LStmt GhcPs (LocatedA (HsExpr GhcPs))] -> AnnList -> PV (LocatedA (HsExpr GhcPs))

mkHsParPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> AnnParen -> PV (LocatedA (HsExpr GhcPs))

mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsExpr GhcPs))

mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsOverLitPV :: Located (HsOverLit GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsWildCardPV :: SrcSpan -> PV (Located (HsExpr GhcPs))

mkHsTySigPV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LHsType GhcPs -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsExplicitListPV :: SrcSpan -> [LocatedA (HsExpr GhcPs)] -> AnnList -> PV (LocatedA (HsExpr GhcPs))

mkHsSplicePV :: Located (HsSplice GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsRecordPV :: Bool -> SrcSpan -> SrcSpan -> LocatedA (HsExpr GhcPs) -> ([Fbind (HsExpr GhcPs)], Maybe SrcSpan) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsNegAppPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsSectionR_PV :: SrcSpan -> LocatedA (InfixOp (HsExpr GhcPs)) -> LocatedA (HsExpr GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsViewPatPV :: SrcSpan -> LHsExpr GhcPs -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsAsPatPV :: SrcSpan -> LocatedN RdrName -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsLazyPatPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsBangPatPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkSumOrTuplePV :: SrcSpanAnnA -> Boxity -> SumOrTuple (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

rejectPragmaPV :: LocatedA (HsExpr GhcPs) -> PV ()

DisambInfixOp (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

Methods

mkHsVarOpPV :: LocatedN RdrName -> PV (LocatedN (HsExpr GhcPs))

mkHsConOpPV :: LocatedN RdrName -> PV (LocatedN (HsExpr GhcPs))

mkHsInfixHolePV :: SrcSpan -> (EpAnnComments -> EpAnn EpAnnUnboundVar) -> PV (Located (HsExpr GhcPs))

type Body (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type Body (HsExpr GhcPs) = HsExpr

type FunArg (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type FunArg (HsExpr GhcPs) = HsExpr GhcPs

type InfixOp (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type InfixOp (HsExpr GhcPs) = HsExpr GhcPs

type Anno (HsExpr (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type family IdP p

Maps the "normal" id type for a given pass

Instances

type IdP (GhcPass p)

Defined in GHC.Hs.Extension

type IdP (GhcPass p) = IdGhcP p

noExtField :: NoExtField

Used when constructing a term with an unused extension point.

getEnv :: IOEnv env env

failM :: IOEnv env a

data FindResult

The result of searching for an imported module.

NB: FindResult manages both user source-import lookups (which can result in Module) as well as direct imports for interfaces (which always result in InstalledModule).

Constructors

Found ModLocation Module

The module was found

NoPackage Unit

The requested unit was not found

FoundMultiple [(Module, ModuleOrigin)]

_Error_: both in multiple packages

NotFound [FilePath] (Maybe Unit) [Unit] [Unit] [(Unit, UnusableUnitReason)] [ModuleSuggestion]

Not found

withTiming

Arguments

:: MonadIO m

=> Logger

-> DynFlags

DynFlags

-> SDoc

The name of the phase

-> (a -> ())

A function to force the result (often either const () or rnf)

-> m a

The body of the phase to be timed

-> m a

Time a compilation phase.

When timings are enabled (e.g. with the -v2 flag), the allocations and CPU time used by the phase will be reported to stderr. Consider a typical usage: withTiming getDynFlags (text "simplify") force PrintTimings pass. When timings are enabled the following costs are included in the produced accounting,

• The cost of executing pass to a result r in WHNF
• The cost of evaluating force r to WHNF (e.g. ())

The choice of the force function depends upon the amount of forcing desired; the goal here is to ensure that the cost of evaluating the result is, to the greatest extent possible, included in the accounting provided by withTiming. Often the pass already sufficiently forces its result during construction; in this case const () is a reasonable choice. In other cases, it is necessary to evaluate the result to normal form, in which case something like Control.DeepSeq.rnf is appropriate.

To avoid adversely affecting compiler performance when timings are not requested, the result is only forced when timings are enabled.

See Note [withTiming] for more.

data Logger

getLogger :: HasLogger m => m Logger

putLogMsg :: Logger -> LogAction

Log something

getDynFlags :: HasDynFlags m => m DynFlags

data GhcMode

The GhcMode tells us whether we're doing multi-module compilation (controlled via the GHC API) or one-shot (single-module) compilation. This makes a difference primarily to the GHC.Unit.Finder: in one-shot mode we look for interface files for imported modules, but in multi-module mode we look for source files in order to check whether they need to be recompiled.

Constructors

CompManager

--make, GHCi, etc.

Instances

Outputable GhcMode

Defined in GHC.Driver.Session

Methods

ppr :: GhcMode -> SDoc

Eq GhcMode

Defined in GHC.Driver.Session

Methods

(==) :: GhcMode -> GhcMode -> Bool

(/=) :: GhcMode -> GhcMode -> Bool

data GhcLink

What to do in the link step, if there is one.

Constructors

LinkInMemory

Use the in-memory dynamic linker (works for both bytecode and object code).

Instances

Show GhcLink

Defined in GHC.Driver.Session

Methods

showsPrec :: Int -> GhcLink -> ShowS

show :: GhcLink -> String

showList :: [GhcLink] -> ShowS

Eq GhcLink

Defined in GHC.Driver.Session

Methods

(==) :: GhcLink -> GhcLink -> Bool

(/=) :: GhcLink -> GhcLink -> Bool

xopt_set :: DynFlags -> Extension -> DynFlags

Set a Extension

updOptLevel :: Int -> DynFlags -> DynFlags

Sets the DynFlags to be appropriate to the optimisation level

gopt_set :: DynFlags -> GeneralFlag -> DynFlags

Set a GeneralFlag

gopt :: GeneralFlag -> DynFlags -> Bool

Test whether a GeneralFlag is set

Note that dynamicNow (i.e., dynamic objects built with `-dynamic-too`) always implicitly enables Opt_PIC, Opt_ExternalDynamicRefs, and disables Opt_SplitSections.

data SourceError

A source error is an error that is caused by one or more errors in the source code. A SourceError is thrown by many functions in the compilation pipeline. Inside GHC these errors are merely printed via log_action, but API clients may treat them differently, for example, insert them into a list box. If you want the default behaviour, use the idiom:

handleSourceError printExceptionAndWarnings $ do
  ... api calls that may fail ...

The SourceErrors error messages can be accessed via srcErrorMessages. This list may be empty if the compiler failed due to -Werror (Opt_WarnIsError).

See printExceptionAndWarnings for more information on what to take care of when writing a custom error handler.

Instances

Exception SourceError

Defined in GHC.Types.SourceError

Methods

toException :: SourceError -> SomeException

fromException :: SomeException -> Maybe SourceError

displayException :: SourceError -> String

Show SourceError

Defined in GHC.Types.SourceError

Methods

showsPrec :: Int -> SourceError -> ShowS

show :: SourceError -> String

showList :: [SourceError] -> ShowS

PPrint SourceError

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> SourceError -> Doc

pprintPrec :: Int -> Tidy -> SourceError -> Doc

Result SourceError

Defined in Language.Haskell.Liquid.GHC.Interface

Methods

result :: SourceError -> FixResult UserError

srcErrorMessages :: SourceError -> ErrorMessages

data Severity

Constructors

SevWarning

Instances

Show Severity

Defined in GHC.Types.Error

Methods

showsPrec :: Int -> Severity -> ShowS

show :: Severity -> String

showList :: [Severity] -> ShowS

ToJson Severity

Defined in GHC.Types.Error

Methods

json :: Severity -> JsonDoc

Eq Severity

Defined in GHC.Types.Error

Methods

(==) :: Severity -> Severity -> Bool

(/=) :: Severity -> Severity -> Bool

data MsgEnvelope e

An envelope for GHC's facts about a running program, parameterised over the domain-specific (i.e. parsing, typecheck-renaming, etc) diagnostics.

To say things differently, GHC emits diagnostics about the running program, each of which is wrapped into a MsgEnvelope that carries specific information like where the error happened, its severity, etc. Finally, multiple MsgEnvelopes are aggregated into Messages that are returned to the user.

Instances

Functor MsgEnvelope

Defined in GHC.Types.Error

Methods

fmap :: (a -> b) -> MsgEnvelope a -> MsgEnvelope b

(<$) :: a -> MsgEnvelope b -> MsgEnvelope a

Show (MsgEnvelope DecoratedSDoc)

Defined in GHC.Types.Error

Methods

showsPrec :: Int -> MsgEnvelope DecoratedSDoc -> ShowS

show :: MsgEnvelope DecoratedSDoc -> String

showList :: [MsgEnvelope DecoratedSDoc] -> ShowS

PPrint (MsgEnvelope DecoratedSDoc)

A whole bunch of PPrint instances follow ----------------------------------

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> MsgEnvelope DecoratedSDoc -> Doc

pprintPrec :: Int -> Tidy -> MsgEnvelope DecoratedSDoc -> Doc

data Messages e

A collection of messages emitted by GHC during error reporting. A diagnostic message is typically a warning or an error. See Note [Messages].

Instances

Functor Messages

Defined in GHC.Types.Error

Methods

fmap :: (a -> b) -> Messages a -> Messages b

(<$) :: a -> Messages b -> Messages a

data DecoratedSDoc

A DecoratedSDoc is isomorphic to a '[SDoc]' but it carries the invariant that the input '[SDoc]' needs to be rendered decorated into its final form, where the typical case would be adding bullets between each elements of the list. The type of decoration depends on the formatting function used, but in practice GHC uses the formatBulleted.

Instances

RenderableDiagnostic DecoratedSDoc

Defined in GHC.Types.Error

Methods

renderDiagnostic :: DecoratedSDoc -> DecoratedSDoc

Show (MsgEnvelope DecoratedSDoc)

Defined in GHC.Types.Error

Methods

showsPrec :: Int -> MsgEnvelope DecoratedSDoc -> ShowS

show :: MsgEnvelope DecoratedSDoc -> String

showList :: [MsgEnvelope DecoratedSDoc] -> ShowS

PPrint (MsgEnvelope DecoratedSDoc)

A whole bunch of PPrint instances follow ----------------------------------

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> MsgEnvelope DecoratedSDoc -> Doc

pprintPrec :: Int -> Tidy -> MsgEnvelope DecoratedSDoc -> Doc

data ConLike

A constructor-like thing

Constructors

RealDataCon DataCon

Instances

Data ConLike

Defined in GHC.Core.ConLike

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ConLike -> c ConLike

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ConLike

toConstr :: ConLike -> Constr

dataTypeOf :: ConLike -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ConLike)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ConLike)

gmapT :: (forall b. Data b => b -> b) -> ConLike -> ConLike

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ConLike -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ConLike -> r

gmapQ :: (forall d. Data d => d -> u) -> ConLike -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ConLike -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ConLike -> m ConLike

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ConLike -> m ConLike

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ConLike -> m ConLike

NamedThing ConLike

Defined in GHC.Core.ConLike

Methods

getOccName :: ConLike -> OccName

getName :: ConLike -> Name

Uniquable ConLike

Defined in GHC.Core.ConLike

Methods

getUnique :: ConLike -> Unique

Outputable ConLike

Defined in GHC.Core.ConLike

Methods

ppr :: ConLike -> SDoc

OutputableBndr ConLike

Defined in GHC.Core.ConLike

Methods

pprBndr :: BindingSite -> ConLike -> SDoc

pprPrefixOcc :: ConLike -> SDoc

pprInfixOcc :: ConLike -> SDoc

bndrIsJoin_maybe :: ConLike -> Maybe Int

Eq ConLike

Defined in GHC.Core.ConLike

Methods

(==) :: ConLike -> ConLike -> Bool

(/=) :: ConLike -> ConLike -> Bool

type Anno ConLike

Defined in GHC.Hs.Pat

type Anno ConLike = SrcSpanAnnN

data StrictnessMark

Instances

Outputable StrictnessMark

Defined in GHC.Core.DataCon

Methods

ppr :: StrictnessMark -> SDoc

isVanillaDataCon :: DataCon -> Bool

Vanilla DataCons are those that are nice boring Haskell 98 constructors

isTupleDataCon :: DataCon -> Bool

dataConWrapperType :: DataCon -> Type

The user-declared type of the data constructor in the nice-to-read form:

T :: forall a b. a -> b -> T [a]

rather than:

T :: forall a c. forall b. (c~[a]) => a -> b -> T c

The type variables are quantified in the order that the user wrote them. See Note [DataCon user type variable binders].

NB: If the constructor is part of a data instance, the result type mentions the family tycon, not the internal one.

dataConWrapId_maybe :: DataCon -> Maybe Id

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)

dataConUnivTyVars :: DataCon -> [TyVar]

The universally-quantified type variables of the constructor

dataConTheta :: DataCon -> ThetaType

The *full* constraints on the constructor type, including dependent GADT equalities.

dataConRepType :: DataCon -> Type

The representation type of the data constructor, i.e. the sort type that will represent values of this type at runtime

dataConRepStrictness :: DataCon -> [StrictnessMark]

Give the demands on the arguments of a Core constructor application (Con dc args)

dataConRepArgTys :: DataCon -> [Scaled Type]

Returns the arg types of the worker, including *all* non-dependent evidence, after any flattening has been done and without substituting for any type variables

dataConOrigArgTys :: DataCon -> [Scaled Type]

Returns the argument types of the wrapper, excluding all dictionary arguments and without substituting for any type variables

dataConInstArgTys

Arguments

:: DataCon

A datacon with no existentials or equality constraints However, it can have a dcTheta (notably it can be a class dictionary, with superclasses)

-> [Type]

Instantiated at these types

-> [Scaled Type]

Finds the instantiated types of the arguments required to construct a DataCon representation NB: these INCLUDE any dictionary args but EXCLUDE the data-declaration context, which is discarded It's all post-flattening etc; this is a representation type

dataConImplicitTyThings :: DataCon -> [TyThing]

Find all the Ids implicitly brought into scope by the data constructor. Currently, the union of the dataConWorkId and the dataConWrapId

classDataCon :: Class -> DataCon

type FamInstEnvs = (FamInstEnv, FamInstEnv)

type FamInstEnv = UniqDFM TyCon FamilyInstEnv

data FamInst

Constructors

FamInst (CoAxiom Unbranched) FamFlavor Name [RoughMatchTc] [TyVar] [CoVar] [Type] Type

Instances

NamedThing FamInst

Defined in GHC.Core.FamInstEnv

Methods

getOccName :: FamInst -> OccName

getName :: FamInst -> Name

Outputable FamInst

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamInst -> SDoc

data FamFlavor

Constructors

DataFamilyInst TyCon

topNormaliseType_maybe :: FamInstEnvs -> Type -> Maybe (Coercion, Type)

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.

famInstEnvElts :: FamInstEnv -> [FamInst]

emptyFamInstEnv :: FamInstEnv

tcUnifyTy :: Type -> Type -> Maybe TCvSubst

Simple unification of two types; all type variables are bindable Precondition: the kinds are already equal

ruleMatchTyKiX

Arguments

:: TyCoVarSet

template variables

-> RnEnv2

-> TvSubstEnv

type substitution to extend

-> Type

Template

-> Type

Target

-> Maybe TvSubstEnv

This one is called from the expression matcher, which already has a MatchEnv in hand

mkClassPred :: Class -> [Type] -> PredType

isEvVarType :: Type -> Bool

isEqPrimPred :: PredType -> Bool

isEqPred :: PredType -> Bool

isDictId :: Id -> Bool

isClassPred :: PredType -> Bool

getClassPredTys_maybe :: PredType -> Maybe (Class, [Type])

getClassPredTys :: HasDebugCallStack => PredType -> (Class, [Type])

mkRepReflCo :: Type -> Coercion

Make a representational reflexive coercion

data Literal

So-called Literals are one of:

• An unboxed numeric literal or floating-point literal which is presumed to be surrounded by appropriate constructors (Int#, etc.), so that the overall thing makes sense.

We maintain the invariant that the Integer in the LitNumber constructor is actually in the (possibly target-dependent) range. The mkLit{Int,Word}*Wrap smart constructors ensure this by applying the target machine's wrapping semantics. Use these in situations where you know the wrapping semantics are correct.

• The literal derived from the label mentioned in a "foreign label" declaration (LitLabel)
• A LitRubbish to be used in place of values of PrimRep (i.e. MutVar#) when the value is never used.
• A character
• A string
• The NULL pointer

Constructors

LitChar Char

Char# - at least 31 bits. Create with mkLitChar

LitNumber !LitNumType !Integer

Any numeric literal that can be internally represented with an Integer.

LitString !ByteString

A string-literal: stored and emitted UTF-8 encoded, we'll arrange to decode it at runtime. Also emitted with a '\0' terminator. Create with mkLitString

LitFloat Rational

Float#. Create with mkLitFloat

LitDouble Rational

Double#. Create with mkLitDouble

Instances

Data Literal

Defined in GHC.Types.Literal

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Literal -> c Literal

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Literal

toConstr :: Literal -> Constr

dataTypeOf :: Literal -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Literal)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Literal)

gmapT :: (forall b. Data b => b -> b) -> Literal -> Literal

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Literal -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Literal -> r

gmapQ :: (forall d. Data d => d -> u) -> Literal -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Literal -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Literal -> m Literal

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Literal -> m Literal

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Literal -> m Literal

Binary Literal

Defined in GHC.Types.Literal

Methods

put_ :: BinHandle -> Literal -> IO ()

put :: BinHandle -> Literal -> IO (Bin Literal)

get :: BinHandle -> IO Literal

Outputable Literal

Defined in GHC.Types.Literal

Methods

ppr :: Literal -> SDoc

Eq Literal

Defined in GHC.Types.Literal

Methods

(==) :: Literal -> Literal -> Bool

(/=) :: Literal -> Literal -> Bool

Ord Literal

Needed for the Ord instance of AltCon, which in turn is needed in CoreMap.

Defined in GHC.Types.Literal

Methods

compare :: Literal -> Literal -> Ordering

(<) :: Literal -> Literal -> Bool

(<=) :: Literal -> Literal -> Bool

(>) :: Literal -> Literal -> Bool

(>=) :: Literal -> Literal -> Bool

max :: Literal -> Literal -> Literal

min :: Literal -> Literal -> Literal

data LitNumType

Numeric literal type

Constructors

LitNumInt

Int# - according to target machine

Instances

Data LitNumType

Defined in GHC.Types.Literal

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LitNumType -> c LitNumType

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LitNumType

toConstr :: LitNumType -> Constr

dataTypeOf :: LitNumType -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LitNumType)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LitNumType)

gmapT :: (forall b. Data b => b -> b) -> LitNumType -> LitNumType

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LitNumType -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LitNumType -> r

gmapQ :: (forall d. Data d => d -> u) -> LitNumType -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> LitNumType -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> LitNumType -> m LitNumType

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LitNumType -> m LitNumType

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LitNumType -> m LitNumType

Enum LitNumType

Defined in GHC.Types.Literal

Methods

succ :: LitNumType -> LitNumType

pred :: LitNumType -> LitNumType

toEnum :: Int -> LitNumType

fromEnum :: LitNumType -> Int

enumFrom :: LitNumType -> [LitNumType]

enumFromThen :: LitNumType -> LitNumType -> [LitNumType]

enumFromTo :: LitNumType -> LitNumType -> [LitNumType]

enumFromThenTo :: LitNumType -> LitNumType -> LitNumType -> [LitNumType]

Binary LitNumType

Defined in GHC.Types.Literal

Methods

put_ :: BinHandle -> LitNumType -> IO ()

put :: BinHandle -> LitNumType -> IO (Bin LitNumType)

get :: BinHandle -> IO LitNumType

Eq LitNumType

Defined in GHC.Types.Literal

Methods

(==) :: LitNumType -> LitNumType -> Bool

(/=) :: LitNumType -> LitNumType -> Bool

Ord LitNumType

Defined in GHC.Types.Literal

Methods

compare :: LitNumType -> LitNumType -> Ordering

(<) :: LitNumType -> LitNumType -> Bool

(<=) :: LitNumType -> LitNumType -> Bool

(>) :: LitNumType -> LitNumType -> Bool

(>=) :: LitNumType -> LitNumType -> Bool

max :: LitNumType -> LitNumType -> LitNumType

min :: LitNumType -> LitNumType -> LitNumType

literalType :: Literal -> Type

Find the Haskell Type the literal occupies

tyConAppArgs_maybe :: Type -> Maybe [Type]

The same as snd . splitTyConApp

splitTyConApp :: Type -> (TyCon, [Type])

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor. Panics if that is not possible. See also splitTyConApp_maybe

splitFunTys :: Type -> ([Scaled Type], Type)

splitFunTy_maybe :: Type -> Maybe (Mult, Type, Type)

Attempts to extract the multiplicity, argument and result types from a type

splitForAllTyCoVars :: Type -> ([TyCoVar], Type)

Take a ForAllTy apart, returning the list of tycovars and the result type. This always succeeds, even if it returns only an empty list. Note that the result type returned may have free variables that were bound by a forall.

splitAppTys :: Type -> (Type, [Type])

Recursively splits a type as far as is possible, leaving a residual type being applied to and the type arguments applied to it. Never fails, even if that means returning an empty list of type applications.

piResultTys :: HasDebugCallStack => Type -> [Type] -> Type

(piResultTys f_ty [ty1, .., tyn]) gives the type of (f ty1 .. tyn) where f :: f_ty piResultTys is interesting because: 1. f_ty may have more for-alls than there are args 2. Less obviously, it may have fewer for-alls For case 2. think of: piResultTys (forall a.a) [forall b.b, Int] This really can happen, but only (I think) in situations involving undefined. For example: undefined :: forall a. a Term: undefined (forall b. b->b) Int This term should have type (Int -> Int), but notice that there are more type args than foralls in undefineds type.

nonDetCmpType :: Type -> Type -> Ordering

newTyConInstRhs :: TyCon -> [Type] -> Type

Unwrap one layer of newtype on a type constructor and its arguments, using an eta-reduced version of the newtype if possible. This requires tys to have at least newTyConInstArity tycon elements.

isTyVarTy :: Type -> Bool

isFunTy :: Type -> Bool

Is this a function?

irrelevantMult :: Scaled a -> a

expandTypeSynonyms :: Type -> Type

Expand out all type synonyms. Actually, it'd suffice to expand out just the ones that discard type variables (e.g. type Funny a = Int) But we don't know which those are currently, so we just expand all.

expandTypeSynonyms only expands out type synonyms mentioned in the type, not in the kinds of any TyCon or TyVar mentioned in the type.

Keep this synchronized with synonymTyConsOfType

eqType :: Type -> Type -> Bool

Type equality on source types. Does not look through newtypes or PredTypes, but it does look through type synonyms. This first checks that the kinds of the types are equal and then checks whether the types are equal, ignoring casts and coercions. (The kind check is a recursive call, but since all kinds have type Type, there is no need to check the types of kinds.) See also Note [Non-trivial definitional equality] in GHC.Core.TyCo.Rep.

dropForAlls :: Type -> Type

Drops all ForAllTys

classifiesTypeWithValues :: Kind -> Bool

Does this classify a type allowed to have values? Responds True to things like *, #, TYPE Lifted, TYPE v, Constraint.

True of any sub-kind of OpenTypeKind

pattern Many :: Mult

primTyCons :: [TyCon]

eqReprPrimTyCon :: TyCon

eqPrimTyCon :: TyCon

substTyWith :: HasCallStack => [TyVar] -> [Type] -> Type -> Type

Type substitution, see zipTvSubst

substTy :: HasCallStack => TCvSubst -> Type -> Type

Substitute within a Type The substitution has to satisfy the invariants described in Note [The substitution invariant].

mkTvSubstPrs :: [(TyVar, Type)] -> TCvSubst

Generates the in-scope set for the TCvSubst from the types in the incoming environment. No CoVars, please!

emptyTvSubstEnv :: TvSubstEnv

mkTyVarTys :: [TyVar] -> [Type]

mkTyVarTy :: TyVar -> Type

mkFunTy :: AnonArgFlag -> Mult -> Type -> Type -> Type infixr 3

mkForAllTys :: [TyCoVarBinder] -> Type -> Type

Wraps foralls over the type using the provided TyCoVars from left to right

data TyConBndrVis

Constructors

AnonTCB AnonArgFlag

Instances

Binary TyConBndrVis

Defined in GHC.Core.TyCon

Methods

put_ :: BinHandle -> TyConBndrVis -> IO ()

put :: BinHandle -> TyConBndrVis -> IO (Bin TyConBndrVis)

get :: BinHandle -> IO TyConBndrVis

Outputable TyConBndrVis

Defined in GHC.Core.TyCon

Methods

ppr :: TyConBndrVis -> SDoc

OutputableBndr tv => Outputable (VarBndr tv TyConBndrVis)

Defined in GHC.Core.TyCon

Methods

ppr :: VarBndr tv TyConBndrVis -> SDoc

type TyConBinder = VarBndr TyVar TyConBndrVis

tyConSingleDataCon_maybe :: TyCon -> Maybe DataCon

If the given TyCon has a single data constructor, i.e. it is a data type with one alternative, a tuple type or a newtype then that constructor is returned. If the TyCon has more than one constructor, or represents a primitive or function type constructor then Nothing is returned.

tyConFamInst_maybe :: TyCon -> Maybe (TyCon, [Type])

If this TyCon is that of a data family instance, return the family in question and the instance types. Otherwise, return Nothing

tyConDataCons_maybe :: TyCon -> Maybe [DataCon]

Determine the DataCons originating from the given TyCon, if the TyCon is the sort that can have any constructors (note: this does not include abstract algebraic types)

tyConDataCons :: TyCon -> [DataCon]

As tyConDataCons_maybe, but returns the empty list of constructors if no constructors could be found

tyConClass_maybe :: TyCon -> Maybe Class

If this TyCon is that for a class instance, return the class it is for. Otherwise returns Nothing

synTyConRhs_maybe :: TyCon -> Maybe Type

Extract the information pertaining to the right hand side of a type synonym (type) declaration.

synTyConDefn_maybe :: TyCon -> Maybe ([TyVar], Type)

Extract the TyVars bound by a vanilla type synonym and the corresponding (unsubstituted) right hand side.

newTyConRhs :: TyCon -> ([TyVar], Type)

Extract the bound type variables and type expansion of a type synonym TyCon. Panics if the TyCon is not a synonym

mkKindTyCon

Arguments

:: Name

-> [TyConBinder]

-> Kind

result kind

-> [Role]

-> Name

-> TyCon

Kind constructors

isVanillaAlgTyCon :: TyCon -> Bool

Returns True for vanilla AlgTyCons -- that is, those created with a data or newtype declaration.

isTypeSynonymTyCon :: TyCon -> Bool

Is this a TyCon representing a regular H98 type synonym (type)?

isPromotedDataCon :: TyCon -> Bool

Is this a PromotedDataCon?

isPrimTyCon :: TyCon -> Bool

Does this TyCon represent something that cannot be defined in Haskell?

isNewTyCon :: TyCon -> Bool

Is this TyCon that for a newtype

isGadtSyntaxTyCon :: TyCon -> Bool

Is this an algebraic TyCon declared with the GADT syntax?

isFamilyTyCon :: TyCon -> Bool

Is this a TyCon, synonym or otherwise, that defines a family?

isFamInstTyCon :: TyCon -> Bool

Is this TyCon that for a data family instance?

isClassTyCon :: TyCon -> Bool

Is this TyCon that for a class instance?

isBoxedTupleTyCon :: TyCon -> Bool

Is this the TyCon for a boxed tuple?

isAlgTyCon :: TyCon -> Bool

Returns True if the supplied TyCon resulted from either a data or newtype declaration

varQual_RDR :: Module -> FastString -> RdrName

times_RDR :: RdrName

plus_RDR :: RdrName

ordClassName :: Name

ordClassKey :: Unique

numericClassKeys :: [Unique]

not_RDR :: RdrName

negateName :: Name

minus_RDR :: RdrName

lt_RDR :: RdrName

le_RDR :: RdrName

itName :: Unique -> SrcSpan -> Name

isStringClassName :: Name

gt_RDR :: RdrName

ge_RDR :: RdrName

gHC_REAL :: Module

fractionalClassKeys :: [Unique]

fractionalClassKey :: Unique

eqClassName :: Name

eqClassKey :: Unique

dollarIdKey :: Unique

dATA_FOLDABLE :: Module

bindMName :: Name

and_RDR :: RdrName

data Class

Instances

Data Class

Defined in GHC.Core.Class

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Class -> c Class

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Class

toConstr :: Class -> Constr

dataTypeOf :: Class -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Class)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Class)

gmapT :: (forall b. Data b => b -> b) -> Class -> Class

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Class -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Class -> r

gmapQ :: (forall d. Data d => d -> u) -> Class -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Class -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Class -> m Class

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Class -> m Class

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Class -> m Class

Show Class

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

showsPrec :: Int -> Class -> ShowS

show :: Class -> String

showList :: [Class] -> ShowS

NFData Class

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

rnf :: Class -> ()

NamedThing Class

Defined in GHC.Core.Class

Methods

getOccName :: Class -> OccName

getName :: Class -> Name

Uniquable Class

Defined in GHC.Core.Class

Methods

getUnique :: Class -> Unique

Outputable Class

Defined in GHC.Core.Class

Methods

ppr :: Class -> SDoc

Eq Class

Defined in GHC.Core.Class

Methods

(==) :: Class -> Class -> Bool

(/=) :: Class -> Class -> Bool

Hashable Class

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

hashWithSalt :: Int -> Class -> Int

hash :: Class -> Int

Symbolic Class

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

symbol :: Class -> Symbol

Fixpoint Class

Defined in Language.Haskell.Liquid.Types.RefType

Methods

toFix :: Class -> Doc

simplify :: Class -> Class

PPrint Class

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> Class -> Doc

pprintPrec :: Int -> Tidy -> Class -> Doc

classSCTheta :: Class -> [PredType]

classSCSelIds :: Class -> [Id]

classMethods :: Class -> [Id]

classBigSig :: Class -> ([TyVar], [PredType], [Id], [ClassOpItem])

classAllSelIds :: Class -> [Id]

coercionKind :: Coercion -> Pair Type

If it is the case that

c :: (t1 ~ t2)

i.e. the kind of c relates t1 and t2, then coercionKind c = Pair t1 t2.

data Role

Instances

Data Role

Defined in GHC.Core.Coercion.Axiom

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Role -> c Role

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Role

toConstr :: Role -> Constr

dataTypeOf :: Role -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Role)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Role)

gmapT :: (forall b. Data b => b -> b) -> Role -> Role

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r

gmapQ :: (forall d. Data d => d -> u) -> Role -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Role -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Role -> m Role

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role

Binary Role

Defined in GHC.Core.Coercion.Axiom

Methods

put_ :: BinHandle -> Role -> IO ()

put :: BinHandle -> Role -> IO (Bin Role)

get :: BinHandle -> IO Role

Outputable Role

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: Role -> SDoc

Eq Role

Defined in GHC.Core.Coercion.Axiom

Methods

(==) :: Role -> Role -> Bool

(/=) :: Role -> Role -> Bool

Ord Role

Defined in GHC.Core.Coercion.Axiom

Methods

compare :: Role -> Role -> Ordering

(<) :: Role -> Role -> Bool

(<=) :: Role -> Role -> Bool

(>) :: Role -> Role -> Bool

(>=) :: Role -> Role -> Bool

max :: Role -> Role -> Role

min :: Role -> Role -> Role

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

data CoAxiomRule

For now, we work only with nominal equality.

Constructors

CoAxiomRule FastString [Role] Role ([TypeEqn] -> Maybe TypeEqn)

Instances

Data CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CoAxiomRule -> c CoAxiomRule

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CoAxiomRule

toConstr :: CoAxiomRule -> Constr

dataTypeOf :: CoAxiomRule -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CoAxiomRule)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CoAxiomRule)

gmapT :: (forall b. Data b => b -> b) -> CoAxiomRule -> CoAxiomRule

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CoAxiomRule -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CoAxiomRule -> r

gmapQ :: (forall d. Data d => d -> u) -> CoAxiomRule -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CoAxiomRule -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CoAxiomRule -> m CoAxiomRule

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CoAxiomRule -> m CoAxiomRule

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CoAxiomRule -> m CoAxiomRule

Uniquable CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

getUnique :: CoAxiomRule -> Unique

Outputable CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: CoAxiomRule -> SDoc

Eq CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

(==) :: CoAxiomRule -> CoAxiomRule -> Bool

(/=) :: CoAxiomRule -> CoAxiomRule -> Bool

Ord CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

compare :: CoAxiomRule -> CoAxiomRule -> Ordering

(<) :: CoAxiomRule -> CoAxiomRule -> Bool

(<=) :: CoAxiomRule -> CoAxiomRule -> Bool

(>) :: CoAxiomRule -> CoAxiomRule -> Bool

(>=) :: CoAxiomRule -> CoAxiomRule -> Bool

max :: CoAxiomRule -> CoAxiomRule -> CoAxiomRule

min :: CoAxiomRule -> CoAxiomRule -> CoAxiomRule

data CoAxiom (br :: BranchFlag)

A CoAxiom is a "coercion constructor", i.e. a named equality axiom.

Instances

Typeable br => Data (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CoAxiom br -> c (CoAxiom br)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (CoAxiom br)

toConstr :: CoAxiom br -> Constr

dataTypeOf :: CoAxiom br -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (CoAxiom br))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CoAxiom br))

gmapT :: (forall b. Data b => b -> b) -> CoAxiom br -> CoAxiom br

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CoAxiom br -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CoAxiom br -> r

gmapQ :: (forall d. Data d => d -> u) -> CoAxiom br -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CoAxiom br -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CoAxiom br -> m (CoAxiom br)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CoAxiom br -> m (CoAxiom br)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CoAxiom br -> m (CoAxiom br)

NamedThing (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

getOccName :: CoAxiom br -> OccName

getName :: CoAxiom br -> Name

Uniquable (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

getUnique :: CoAxiom br -> Unique

Outputable (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: CoAxiom br -> SDoc

Eq (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

(==) :: CoAxiom br -> CoAxiom br -> Bool

(/=) :: CoAxiom br -> CoAxiom br -> Bool

type Branched = 'Branched

coAxiomTyCon :: forall (br :: BranchFlag). CoAxiom br -> TyCon

type LocatedN = GenLocated SrcSpanAnnN

noLocA :: a -> LocatedAn an a

noAnnSrcSpan :: SrcSpan -> SrcAnn ann

noAnn :: EpAnn a

Short form for EpAnnNotUsed

getLocA :: GenLocated (SrcSpanAnn' a) e -> SrcSpan

data Annotation

Represents an annotation after it has been sufficiently desugared from it's initial form of AnnDecl

Constructors

Annotation

Fields

• ann_target :: CoreAnnTarget

  The target of the annotation

• ann_value :: AnnPayload

Instances

Outputable Annotation

Defined in GHC.Types.Annotations

Methods

ppr :: Annotation -> SDoc

data AnnTarget name

An annotation target

Constructors

ModuleTarget Module

We are annotating a particular module

Instances

Functor AnnTarget

Defined in GHC.Types.Annotations

Methods

fmap :: (a -> b) -> AnnTarget a -> AnnTarget b

(<$) :: a -> AnnTarget b -> AnnTarget a

Binary name => Binary (AnnTarget name)

Defined in GHC.Types.Annotations

Methods

put_ :: BinHandle -> AnnTarget name -> IO ()

put :: BinHandle -> AnnTarget name -> IO (Bin (AnnTarget name))

get :: BinHandle -> IO (AnnTarget name)

Outputable name => Outputable (AnnTarget name)

Defined in GHC.Types.Annotations

Methods

ppr :: AnnTarget name -> SDoc

type AnnPayload

Arguments

 = Serialized

The "payload" of an annotation allows recovery of its value at a given type, and can be persisted to an interface file

findAnns :: Typeable a => ([Word8] -> a) -> AnnEnv -> CoreAnnTarget -> [a]

Find the annotations attached to the given target as Typeable values of your choice. If no deserializer is specified, only transient annotations will be returned.

data RdrName

Reader Name

Do not use the data constructors of RdrName directly: prefer the family of functions that creates them, such as mkRdrUnqual

• Note: A Located RdrName will only have API Annotations if it is a compound one, e.g.

`bar`
( ~ )

• AnnKeywordId : AnnType, AnnOpen '(' or '[' or '[:', AnnClose ')' or ']' or ':]',, AnnBackquote '`', AnnVal AnnTilde,

Instances

Data RdrName

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RdrName -> c RdrName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RdrName

toConstr :: RdrName -> Constr

dataTypeOf :: RdrName -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RdrName)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RdrName)

gmapT :: (forall b. Data b => b -> b) -> RdrName -> RdrName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RdrName -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RdrName -> r

gmapQ :: (forall d. Data d => d -> u) -> RdrName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> RdrName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName

DisambInfixOp RdrName

Defined in GHC.Parser.PostProcess

Methods

mkHsVarOpPV :: LocatedN RdrName -> PV (LocatedN RdrName)

mkHsConOpPV :: LocatedN RdrName -> PV (LocatedN RdrName)

mkHsInfixHolePV :: SrcSpan -> (EpAnnComments -> EpAnn EpAnnUnboundVar) -> PV (Located RdrName)

HasOccName RdrName

Defined in GHC.Types.Name.Reader

Methods

occName :: RdrName -> OccName

Outputable RdrName

Defined in GHC.Types.Name.Reader

Methods

ppr :: RdrName -> SDoc

OutputableBndr RdrName

Defined in GHC.Types.Name.Reader

Methods

pprBndr :: BindingSite -> RdrName -> SDoc

pprPrefixOcc :: RdrName -> SDoc

pprInfixOcc :: RdrName -> SDoc

bndrIsJoin_maybe :: RdrName -> Maybe Int

Eq RdrName

Defined in GHC.Types.Name.Reader

Methods

(==) :: RdrName -> RdrName -> Bool

(/=) :: RdrName -> RdrName -> Bool

Ord RdrName

Defined in GHC.Types.Name.Reader

Methods

compare :: RdrName -> RdrName -> Ordering

(<) :: RdrName -> RdrName -> Bool

(<=) :: RdrName -> RdrName -> Bool

(>) :: RdrName -> RdrName -> Bool

(>=) :: RdrName -> RdrName -> Bool

max :: RdrName -> RdrName -> RdrName

min :: RdrName -> RdrName -> RdrName

type Anno RdrName

Defined in GHC.Hs.Extension

type Anno RdrName = SrcSpanAnnN

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

data ImportSpec

Import Specification

The ImportSpec of something says how it came to be imported It's quite elaborate so that we can give accurate unused-name warnings.

Constructors

ImpSpec ImpDeclSpec ImpItemSpec

Instances

Data ImportSpec

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportSpec -> c ImportSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImportSpec

toConstr :: ImportSpec -> Constr

dataTypeOf :: ImportSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImportSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImportSpec)

gmapT :: (forall b. Data b => b -> b) -> ImportSpec -> ImportSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> ImportSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

Outputable ImportSpec

Defined in GHC.Types.Name.Reader

Methods

ppr :: ImportSpec -> SDoc

Eq ImportSpec

Defined in GHC.Types.Name.Reader

Methods

(==) :: ImportSpec -> ImportSpec -> Bool

(/=) :: ImportSpec -> ImportSpec -> Bool

data ImpItemSpec

Import Item Specification

Describes import info a particular Name

Constructors

ImpAll

The import had no import list, or had a hiding list

Instances

Data ImpItemSpec

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImpItemSpec -> c ImpItemSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImpItemSpec

toConstr :: ImpItemSpec -> Constr

dataTypeOf :: ImpItemSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImpItemSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImpItemSpec)

gmapT :: (forall b. Data b => b -> b) -> ImpItemSpec -> ImpItemSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImpItemSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImpItemSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> ImpItemSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImpItemSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec

Eq ImpItemSpec

Defined in GHC.Types.Name.Reader

Methods

(==) :: ImpItemSpec -> ImpItemSpec -> Bool

(/=) :: ImpItemSpec -> ImpItemSpec -> Bool

data ImpDeclSpec

Import Declaration Specification

Describes a particular import declaration and is shared among all the Provenances for that decl

Constructors

ImpDeclSpec

Fields

• is_mod :: ModuleName

  Module imported, e.g. import Muggle Note the Muggle may well not be the defining module for this thing!

• is_as :: ModuleName

  Import alias, e.g. from as M (or Muggle if there is no as clause)

• is_qual :: Bool

  Was this import qualified?

• is_dloc :: SrcSpan

  The location of the entire import declaration

Instances

Data ImpDeclSpec

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImpDeclSpec -> c ImpDeclSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImpDeclSpec

toConstr :: ImpDeclSpec -> Constr

dataTypeOf :: ImpDeclSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImpDeclSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImpDeclSpec)

gmapT :: (forall b. Data b => b -> b) -> ImpDeclSpec -> ImpDeclSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImpDeclSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImpDeclSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> ImpDeclSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImpDeclSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

Eq ImpDeclSpec

Defined in GHC.Types.Name.Reader

Methods

(==) :: ImpDeclSpec -> ImpDeclSpec -> Bool

(/=) :: ImpDeclSpec -> ImpDeclSpec -> Bool

nameRdrName :: Name -> RdrName

mkVarUnqual :: FastString -> RdrName

mkUnqual :: NameSpace -> FastString -> RdrName

mkQual :: NameSpace -> (FastString, FastString) -> RdrName

Make a qualified RdrName in the given namespace and where the ModuleName and the OccName are taken from the first and second elements of the tuple respectively

mkGlobalRdrEnv :: [GlobalRdrElt] -> GlobalRdrEnv

lookupGRE_RdrName :: RdrName -> GlobalRdrEnv -> [GlobalRdrElt]

Look for this RdrName in the global environment. Omits record fields without selector functions (see Note [NoFieldSelectors] in GHC.Rename.Env).

gresFromAvails :: Maybe ImportSpec -> [AvailInfo] -> [GlobalRdrElt]

make a GlobalRdrEnv where all the elements point to the same Provenance (useful for "hiding" imports, or imports with no details).

greMangledName :: GlobalRdrElt -> Name

A Name for the GRE for internal use. Careful: the OccName of this Name is not necessarily the same as the greOccName (see Note [GreNames]).

globalRdrEnvElts :: GlobalRdrEnv -> [GlobalRdrElt]

getRdrName :: NamedThing thing => thing -> RdrName

data AvailInfo

Records what things are "available", i.e. in scope

Constructors

Avail GreName

An ordinary identifier in scope, or a field label without a parent type (see Note [Representing pattern synonym fields in AvailInfo]).

AvailTC

A type or class in scope

The AvailTC Invariant: If the type or class is itself to be in scope, it must be first in this list. Thus, typically:

AvailTC Eq [Eq, ==, \/=]

Fields

• Name

  The name of the type or class

• [GreName]

  The available pieces of type or class (see Note [Representing fields in AvailInfo]).

Instances

Data AvailInfo

Defined in GHC.Types.Avail

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AvailInfo -> c AvailInfo

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AvailInfo

toConstr :: AvailInfo -> Constr

dataTypeOf :: AvailInfo -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AvailInfo)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AvailInfo)

gmapT :: (forall b. Data b => b -> b) -> AvailInfo -> AvailInfo

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AvailInfo -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AvailInfo -> r

gmapQ :: (forall d. Data d => d -> u) -> AvailInfo -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AvailInfo -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo

Binary AvailInfo

Defined in GHC.Types.Avail

Methods

put_ :: BinHandle -> AvailInfo -> IO ()

put :: BinHandle -> AvailInfo -> IO (Bin AvailInfo)

get :: BinHandle -> IO AvailInfo

Outputable AvailInfo

Defined in GHC.Types.Avail

Methods

ppr :: AvailInfo -> SDoc

Eq AvailInfo

Used when deciding if the interface has changed

Defined in GHC.Types.Avail

Methods

(==) :: AvailInfo -> AvailInfo -> Bool

(/=) :: AvailInfo -> AvailInfo -> Bool

greNameMangledName :: GreName -> Name

A Name for internal use, but not for output to the user. For fields, the OccName will be the selector. See Note [GreNames] in GHC.Types.Name.Reader.

availNames :: AvailInfo -> [Name]

All names made available by the availability information (excluding overloaded selectors)

data CostCentre

A Cost Centre is a single {-# SCC #-} annotation.

Instances

Data CostCentre

Defined in GHC.Types.CostCentre

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CostCentre -> c CostCentre

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CostCentre

toConstr :: CostCentre -> Constr

dataTypeOf :: CostCentre -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CostCentre)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CostCentre)

gmapT :: (forall b. Data b => b -> b) -> CostCentre -> CostCentre

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CostCentre -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CostCentre -> r

gmapQ :: (forall d. Data d => d -> u) -> CostCentre -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CostCentre -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CostCentre -> m CostCentre

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CostCentre -> m CostCentre

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CostCentre -> m CostCentre

Binary CostCentre

Defined in GHC.Types.CostCentre

Methods

put_ :: BinHandle -> CostCentre -> IO ()

put :: BinHandle -> CostCentre -> IO (Bin CostCentre)

get :: BinHandle -> IO CostCentre

Outputable CostCentre

Defined in GHC.Types.CostCentre

Methods

ppr :: CostCentre -> SDoc

Eq CostCentre

Defined in GHC.Types.CostCentre

Methods

(==) :: CostCentre -> CostCentre -> Bool

(/=) :: CostCentre -> CostCentre -> Bool

Ord CostCentre

Defined in GHC.Types.CostCentre

Methods

compare :: CostCentre -> CostCentre -> Ordering

(<) :: CostCentre -> CostCentre -> Bool

(<=) :: CostCentre -> CostCentre -> Bool

(>) :: CostCentre -> CostCentre -> Bool

(>=) :: CostCentre -> CostCentre -> Bool

max :: CostCentre -> CostCentre -> CostCentre

min :: CostCentre -> CostCentre -> CostCentre

mkRnEnv2 :: InScopeSet -> RnEnv2

emptyInScopeSet :: InScopeSet

type VarSet = UniqSet Var

A non-deterministic Variable Set

A non-deterministic set of variables. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM for explanation why it's not deterministic and why it matters. Use DVarSet if the set eventually gets converted into a list or folded over in a way where the order changes the generated code, for example when abstracting variables.

unitVarSet :: Var -> VarSet

extendVarSetList :: VarSet -> [Var] -> VarSet

extendVarSet :: VarSet -> Var -> VarSet

emptyVarSet :: VarSet

elemVarSet :: Var -> VarSet -> Bool

stableNameCmp :: Name -> Name -> Ordering

Compare Names lexicographically This only works for Names that originate in the source code or have been tidied.

nameStableString :: Name -> String

Get a string representation of a Name that's unique and stable across recompilations. Used for deterministic generation of binds for derived instances. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal$String"

nameSrcSpan :: Name -> SrcSpan

nameSrcLoc :: Name -> SrcLoc

nameModule_maybe :: Name -> Maybe Module

nameModule :: HasDebugCallStack => Name -> Module

mkSystemName :: Unique -> OccName -> Name

Create a name brought into being by the compiler

mkInternalName :: Unique -> OccName -> SrcSpan -> Name

Create a name which is (for now at least) local to the current module and hence does not need a Module to disambiguate it from other Names

isSystemName :: Name -> Bool

isInternalName :: Name -> Bool

isExternalName :: Name -> Bool

getSrcSpan :: NamedThing a => a -> SrcSpan

getOccString :: NamedThing a => a -> String

mkVarOcc :: String -> OccName

mkTyVarOcc :: String -> OccName

mkTcOcc :: String -> OccName

type TyVarBinder = VarBndr TyVar ArgFlag

type DFunId = Id

Dictionary Function Identifier

varUnique :: Var -> Unique

tyVarKind :: TyVar -> Kind

setVarUnique :: Var -> Unique -> Var

setVarType :: Var -> Type -> Var

setVarName :: Var -> Name -> Var

mkTyVar :: Name -> Kind -> TyVar

mkLocalVar :: IdDetails -> Name -> Mult -> Type -> IdInfo -> Id

isTyVar :: Var -> Bool

Is this a type-level (i.e., computationally irrelevant, thus erasable) variable? Satisfies isTyVar = not . isId.

isLocalId :: Var -> Bool

isId :: Var -> Bool

Is this a value-level (i.e., computationally relevant) Varentifier? Satisfies isId = not . isTyVar.

isCoVar :: Var -> Bool

Is this a coercion variable? Satisfies isId v ==> isCoVar v == not (isNonCoVarId v).

idInfo :: HasDebugCallStack => Id -> IdInfo

idDetails :: Id -> IdDetails

binderVar :: VarBndr tv argf -> tv

typeSymbolKind :: Kind

tupleTyCon :: Boxity -> Arity -> TyCon

tupleDataCon :: Boxity -> Arity -> DataCon

naturalTy :: Type

listTyCon :: TyCon

liftedTypeKind :: Kind

data DataCon

A data constructor

• AnnKeywordId : AnnOpen, AnnClose,AnnComma

Instances

Data DataCon

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataCon -> c DataCon

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataCon

toConstr :: DataCon -> Constr

dataTypeOf :: DataCon -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DataCon)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DataCon)

gmapT :: (forall b. Data b => b -> b) -> DataCon -> DataCon

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataCon -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataCon -> r

gmapQ :: (forall d. Data d => d -> u) -> DataCon -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DataCon -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

Show DataCon

Defined in Language.Haskell.Liquid.Types.Types

Methods

showsPrec :: Int -> DataCon -> ShowS

show :: DataCon -> String

showList :: [DataCon] -> ShowS

NamedThing DataCon

Defined in GHC.Core.DataCon

Methods

getOccName :: DataCon -> OccName

getName :: DataCon -> Name

Uniquable DataCon

Defined in GHC.Core.DataCon

Methods

getUnique :: DataCon -> Unique

Outputable DataCon

Defined in GHC.Core.DataCon

Methods

ppr :: DataCon -> SDoc

Outputable OccurrenceMap

Defined in Language.Haskell.Liquid.GHC.Play

Methods

ppr :: OccurrenceMap -> SDoc

OutputableBndr DataCon

Defined in GHC.Core.DataCon

Methods

pprBndr :: BindingSite -> DataCon -> SDoc

pprPrefixOcc :: DataCon -> SDoc

pprInfixOcc :: DataCon -> SDoc

bndrIsJoin_maybe :: DataCon -> Maybe Int

Eq DataCon

Defined in GHC.Core.DataCon

Methods

(==) :: DataCon -> DataCon -> Bool

(/=) :: DataCon -> DataCon -> Bool

Ord DataCon

Defined in Language.Haskell.Liquid.Types.Types

Methods

compare :: DataCon -> DataCon -> Ordering

(<) :: DataCon -> DataCon -> Bool

(<=) :: DataCon -> DataCon -> Bool

(>) :: DataCon -> DataCon -> Bool

(>=) :: DataCon -> DataCon -> Bool

max :: DataCon -> DataCon -> DataCon

min :: DataCon -> DataCon -> DataCon

Hashable DataCon

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

hashWithSalt :: Int -> DataCon -> Int

hash :: DataCon -> Int

Symbolic DataCon

Defined in Language.Haskell.Liquid.Types.Types

Methods

symbol :: DataCon -> Symbol

PPrint DataCon

Defined in Language.Haskell.Liquid.Types.Types

Methods

pprintTidy :: Tidy -> DataCon -> Doc

pprintPrec :: Int -> Tidy -> DataCon -> Doc

ResolveSym DataCon

Defined in Language.Haskell.Liquid.Bare.Resolve

Methods

resolveLocSym :: Env -> ModName -> String -> LocSymbol -> Lookup DataCon

Qualify (Measure SpecType DataCon)

Defined in Language.Haskell.Liquid.Bare.Resolve

Methods

qualify :: Env -> ModName -> SourcePos -> [Symbol] -> Measure SpecType DataCon -> Measure SpecType DataCon

dataConWrapId :: DataCon -> Id

Returns an Id which looks like the Haskell-source constructor by using the wrapper if it exists (see dataConWrapId_maybe) and failing over to the worker (see dataConWorkId)

dataConWorkId :: DataCon -> Id

Get the Id of the DataCon worker: a function that is the "actual" constructor and has no top level binding in the program. The type may be different from the obvious one written in the source program. Panics if there is no such Id for this DataCon

dataConTyCon :: DataCon -> TyCon

The type constructor that we are building via this data constructor

dataConName :: DataCon -> Name

The Name of the DataCon, giving it a unique, rooted identification

dataConFullSig :: DataCon -> ([TyVar], [TyCoVar], [EqSpec], ThetaType, [Scaled Type], Type)

The "full signature" of the DataCon returns, in order:

1) The result of dataConUnivTyVars

2) The result of dataConExTyCoVars

3) The non-dependent GADT equalities. Dependent GADT equalities are implied by coercion variables in return value (2).

4) The other constraints of the data constructor type, excluding GADT equalities

5) The original argument types to the DataCon (i.e. before any change of the representation of the type) with linearity annotations

6) The original result type of the DataCon

dataConFieldLabels :: DataCon -> [FieldLabel]

The labels for the fields of this particular DataCon

dataConExTyCoVars :: DataCon -> [TyCoVar]

The existentially-quantified type/coercion variables of the constructor including dependent (kind-) GADT equalities

tyConAppTyCon_maybe :: Type -> Maybe TyCon

The same as fst . splitTyConApp

splitTyConApp_maybe :: HasDebugCallStack => Type -> Maybe (TyCon, [Type])

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor

mkTyConApp :: TyCon -> [Type] -> Type

A key function: builds a TyConApp or FunTy as appropriate to its arguments. Applies its arguments to the constructor from left to right.

data UnivCoProvenance

For simplicity, we have just one UnivCo that represents a coercion from some type to some other type, with (in general) no restrictions on the type. The UnivCoProvenance specifies more exactly what the coercion really is and why a program should (or shouldn't!) trust the coercion. It is reasonable to consider each constructor of UnivCoProvenance as a totally independent coercion form; their only commonality is that they don't tell you what types they coercion between. (That info is in the UnivCo constructor of Coercion.

Constructors

PhantomProv KindCoercion

See Note [Phantom coercions]. Only in Phantom roled coercions

ProofIrrelProv KindCoercion

From the fact that any two coercions are considered equivalent. See Note [ProofIrrelProv]. Can be used in Nominal or Representational coercions

Instances

Data UnivCoProvenance

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UnivCoProvenance -> c UnivCoProvenance

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UnivCoProvenance

toConstr :: UnivCoProvenance -> Constr

dataTypeOf :: UnivCoProvenance -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UnivCoProvenance)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UnivCoProvenance)

gmapT :: (forall b. Data b => b -> b) -> UnivCoProvenance -> UnivCoProvenance

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UnivCoProvenance -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UnivCoProvenance -> r

gmapQ :: (forall d. Data d => d -> u) -> UnivCoProvenance -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> UnivCoProvenance -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> UnivCoProvenance -> m UnivCoProvenance

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UnivCoProvenance -> m UnivCoProvenance

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UnivCoProvenance -> m UnivCoProvenance

Outputable UnivCoProvenance

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: UnivCoProvenance -> SDoc

data Type

Constructors

TyVarTy Var

Vanilla type or kind variable (*never* a coercion variable)

AppTy Type Type

Type application to something other than a TyCon. Parameters:

1) Function: must not be a TyConApp or CastTy, must be another AppTy, or TyVarTy See Note [Respecting definitional equality] (EQ1) about the no CastTy requirement

2) Argument type

TyConApp TyCon [KindOrType]

Application of a TyCon, including newtypes and synonyms. Invariant: saturated applications of FunTyCon must use FunTy and saturated synonyms must use their own constructors. However, unsaturated FunTyCons do appear as TyConApps. Parameters:

1) Type constructor being applied to.

2) Type arguments. Might not have enough type arguments here to saturate the constructor. Even type synonyms are not necessarily saturated; for example unsaturated type synonyms can appear as the right hand side of a type synonym.

ForAllTy !TyCoVarBinder Type

A Π type. INVARIANT: If the binder is a coercion variable, it must be mentioned in the Type. See Note [Unused coercion variable in ForAllTy]

FunTy AnonArgFlag Mult Type Type

FUN m t1 t2 Very common, so an important special case See Note [Function types]

LitTy TyLit

Type literals are similar to type constructors.

CastTy Type KindCoercion

A kind cast. The coercion is always nominal. INVARIANT: The cast is never reflexive (EQ2) INVARIANT: The Type is not a CastTy (use TransCo instead) (EQ3) INVARIANT: The Type is not a ForAllTy over a tyvar (EQ4) See Note [Respecting definitional equality]

CoercionTy Coercion

Injection of a Coercion into a type This should only ever be used in the RHS of an AppTy, in the list of a TyConApp, when applying a promoted GADT data constructor

Instances

Data Type

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Type -> c Type

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Type

toConstr :: Type -> Constr

dataTypeOf :: Type -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Type)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Type)

gmapT :: (forall b. Data b => b -> b) -> Type -> Type

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r

gmapQ :: (forall d. Data d => d -> u) -> Type -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Type -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Type -> m Type

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type

NFData Type

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

rnf :: Type -> ()

Outputable Type

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Type -> SDoc

Eq Type

Defined in Language.Haskell.Liquid.GHC.TypeRep

Methods

(==) :: Type -> Type -> Bool

(/=) :: Type -> Type -> Bool

Fixpoint Type

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

toFix :: Type -> Doc

simplify :: Type -> Type

PPrint Type

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> Type -> Doc

pprintPrec :: Int -> Tidy -> Type -> Doc

Subable Type

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> Type -> Type

subTy :: HashMap TyVar Type -> Type -> Type

SubsTy TyVar Type SpecType

Defined in Language.Haskell.Liquid.Types.RefType

Methods

subt :: (TyVar, Type) -> SpecType -> SpecType

Eq (DeBruijn Type)

Defined in GHC.Core.Map.Type

Methods

(==) :: DeBruijn Type -> DeBruijn Type -> Bool

(/=) :: DeBruijn Type -> DeBruijn Type -> Bool

Show (Axiom Var Type CoreExpr)

Defined in Language.Haskell.Liquid.Types.Types

Methods

showsPrec :: Int -> Axiom Var Type CoreExpr -> ShowS

show :: Axiom Var Type CoreExpr -> String

showList :: [Axiom Var Type CoreExpr] -> ShowS

data TyLit

Constructors

NumTyLit Integer

StrTyLit FastString

CharTyLit Char

Instances

Data TyLit

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyLit -> c TyLit

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TyLit

toConstr :: TyLit -> Constr

dataTypeOf :: TyLit -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TyLit)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TyLit)

gmapT :: (forall b. Data b => b -> b) -> TyLit -> TyLit

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyLit -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyLit -> r

gmapQ :: (forall d. Data d => d -> u) -> TyLit -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TyLit -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyLit -> m TyLit

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyLit -> m TyLit

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyLit -> m TyLit

Outputable TyLit

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: TyLit -> SDoc

Eq TyLit

Defined in GHC.Core.TyCo.Rep

Methods

(==) :: TyLit -> TyLit -> Bool

(/=) :: TyLit -> TyLit -> Bool

type PredType = Type

A type of the form p of constraint kind represents a value whose type is the Haskell predicate p, where a predicate is what occurs before the => in a Haskell type.

We use PredType as documentation to mark those types that we guarantee to have this kind.

It can be expanded into its representation, but:

• The type checker must treat it as opaque
• The rest of the compiler treats it as transparent

Consider these examples:

f :: (Eq a) => a -> Int
g :: (?x :: Int -> Int) => a -> Int
h :: (r\l) => {r} => {l::Int | r}

Here the Eq a and ?x :: Int -> Int and rl are all called "predicates"

type Kind = Type

The key type representing kinds in the compiler.

data Coercion

A Coercion is concrete evidence of the equality/convertibility of two types.

Constructors

TyConAppCo Role TyCon [Coercion]

AppCo Coercion CoercionN

ForAllCo TyCoVar KindCoercion Coercion

FunCo Role CoercionN Coercion Coercion

CoVarCo CoVar

AxiomInstCo (CoAxiom Branched) BranchIndex [Coercion]

AxiomRuleCo CoAxiomRule [Coercion]

UnivCo UnivCoProvenance Role Type Type

SymCo Coercion

TransCo Coercion Coercion

NthCo Role Int Coercion

LRCo LeftOrRight CoercionN

InstCo Coercion CoercionN

KindCo Coercion

SubCo CoercionN

Instances

Data Coercion

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Coercion -> c Coercion

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Coercion

toConstr :: Coercion -> Constr

dataTypeOf :: Coercion -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Coercion)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Coercion)

gmapT :: (forall b. Data b => b -> b) -> Coercion -> Coercion

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Coercion -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Coercion -> r

gmapQ :: (forall d. Data d => d -> u) -> Coercion -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Coercion -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Coercion -> m Coercion

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Coercion -> m Coercion

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Coercion -> m Coercion

Outputable Coercion

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Coercion -> SDoc

Eq Coercion

Defined in Language.Haskell.Liquid.GHC.TypeRep

Methods

(==) :: Coercion -> Coercion -> Bool

(/=) :: Coercion -> Coercion -> Bool

Subable Coercion

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> Coercion -> Coercion

subTy :: HashMap TyVar Type -> Coercion -> Coercion

Eq (DeBruijn Coercion)

Defined in GHC.Core.Map.Type

Methods

(==) :: DeBruijn Coercion -> DeBruijn Coercion -> Bool

(/=) :: DeBruijn Coercion -> DeBruijn Coercion -> Bool

data TyThing

A global typecheckable-thing, essentially anything that has a name. Not to be confused with a TcTyThing, which is also a typecheckable thing but in the *local* context. See GHC.Tc.Utils.Env for how to retrieve a TyThing given a Name.

Constructors

AnId Id

AConLike ConLike

ATyCon TyCon

Instances

NamedThing TyThing

Defined in GHC.Types.TyThing

Methods

getOccName :: TyThing -> OccName

getName :: TyThing -> Name

Outputable TyThing

Defined in GHC.Types.TyThing

Methods

ppr :: TyThing -> SDoc

PPrint TyThing

Defined in Language.Haskell.Liquid.Types.Types

Methods

pprintTidy :: Tidy -> TyThing -> Doc

pprintPrec :: Int -> Tidy -> TyThing -> Doc

data TyCon

TyCons represent type constructors. Type constructors are introduced by things such as:

1) Data declarations: data Foo = ... creates the Foo type constructor of kind *

2) Type synonyms: type Foo = ... creates the Foo type constructor

3) Newtypes: newtype Foo a = MkFoo ... creates the Foo type constructor of kind * -> *

4) Class declarations: class Foo where creates the Foo type constructor of kind *

This data type also encodes a number of primitive, built in type constructors such as those for function and tuple types.

Instances

Data TyCon

Defined in GHC.Core.TyCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyCon -> c TyCon

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TyCon

toConstr :: TyCon -> Constr

dataTypeOf :: TyCon -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TyCon)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TyCon)

gmapT :: (forall b. Data b => b -> b) -> TyCon -> TyCon

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyCon -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyCon -> r

gmapQ :: (forall d. Data d => d -> u) -> TyCon -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TyCon -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyCon -> m TyCon

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyCon -> m TyCon

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyCon -> m TyCon

Show TyCon

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

showsPrec :: Int -> TyCon -> ShowS

show :: TyCon -> String

showList :: [TyCon] -> ShowS

NFData TyCon

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

rnf :: TyCon -> ()

NamedThing TyCon

Defined in GHC.Core.TyCon

Methods

getOccName :: TyCon -> OccName

getName :: TyCon -> Name

Uniquable TyCon

Defined in GHC.Core.TyCon

Methods

getUnique :: TyCon -> Unique

Outputable TyCon

Defined in GHC.Core.TyCon

Methods

ppr :: TyCon -> SDoc

Outputable OccurrenceMap

Defined in Language.Haskell.Liquid.GHC.Play

Methods

ppr :: OccurrenceMap -> SDoc

Eq TyCon

Defined in GHC.Core.TyCon

Methods

(==) :: TyCon -> TyCon -> Bool

(/=) :: TyCon -> TyCon -> Bool

Ord TyCon

Defined in Language.Haskell.Liquid.Types.Types

Methods

compare :: TyCon -> TyCon -> Ordering

(<) :: TyCon -> TyCon -> Bool

(<=) :: TyCon -> TyCon -> Bool

(>) :: TyCon -> TyCon -> Bool

(>=) :: TyCon -> TyCon -> Bool

max :: TyCon -> TyCon -> TyCon

min :: TyCon -> TyCon -> TyCon

Hashable TyCon

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

hashWithSalt :: Int -> TyCon -> Int

hash :: TyCon -> Int

Symbolic TyCon

Symbol Instances

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

symbol :: TyCon -> Symbol

PPrint TyCon

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> TyCon -> Doc

pprintPrec :: Int -> Tidy -> TyCon -> Doc

ResolveSym TyCon

Defined in Language.Haskell.Liquid.Bare.Resolve

Methods

resolveLocSym :: Env -> ModName -> String -> LocSymbol -> Lookup TyCon

TyConable TyCon

Defined in Language.Haskell.Liquid.Types.Types

Methods

isFun :: TyCon -> Bool

isList :: TyCon -> Bool

isTuple :: TyCon -> Bool

ppTycon :: TyCon -> Doc

isClass :: TyCon -> Bool

isEmbeddedDict :: TyCon -> Bool

isEqual :: TyCon -> Bool

isOrdCls :: TyCon -> Bool

isEqCls :: TyCon -> Bool

isNumCls :: TyCon -> Bool

isFracCls :: TyCon -> Bool

isTupleTyCon :: TyCon -> Bool

Does this TyCon represent a tuple?

NB: when compiling Data.Tuple, the tycons won't reply True to isTupleTyCon, because they are built as AlgTyCons. However they get spat into the interface file as tuple tycons, so I don't think it matters.

isFunTyCon :: TyCon -> Bool

data Bag a

Instances

Foldable Bag

Defined in GHC.Data.Bag

Methods

fold :: Monoid m => Bag m -> m

foldMap :: Monoid m => (a -> m) -> Bag a -> m

foldMap' :: Monoid m => (a -> m) -> Bag a -> m

foldr :: (a -> b -> b) -> b -> Bag a -> b

foldr' :: (a -> b -> b) -> b -> Bag a -> b

foldl :: (b -> a -> b) -> b -> Bag a -> b

foldl' :: (b -> a -> b) -> b -> Bag a -> b

foldr1 :: (a -> a -> a) -> Bag a -> a

foldl1 :: (a -> a -> a) -> Bag a -> a

toList :: Bag a -> [a]

null :: Bag a -> Bool

length :: Bag a -> Int

elem :: Eq a => a -> Bag a -> Bool

maximum :: Ord a => Bag a -> a

minimum :: Ord a => Bag a -> a

sum :: Num a => Bag a -> a

product :: Num a => Bag a -> a

Traversable Bag

Defined in GHC.Data.Bag

Methods

traverse :: Applicative f => (a -> f b) -> Bag a -> f (Bag b)

sequenceA :: Applicative f => Bag (f a) -> f (Bag a)

mapM :: Monad m => (a -> m b) -> Bag a -> m (Bag b)

sequence :: Monad m => Bag (m a) -> m (Bag a)

Functor Bag

Defined in GHC.Data.Bag

Methods

fmap :: (a -> b) -> Bag a -> Bag b

(<$) :: a -> Bag b -> Bag a

Data a => Data (Bag a)

Defined in GHC.Data.Bag

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bag a -> c (Bag a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Bag a)

toConstr :: Bag a -> Constr

dataTypeOf :: Bag a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Bag a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Bag a))

gmapT :: (forall b. Data b => b -> b) -> Bag a -> Bag a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bag a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bag a -> r

gmapQ :: (forall d. Data d => d -> u) -> Bag a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Bag a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a)

IsList (Bag a)

Defined in GHC.Data.Bag

Associated Types

type Item (Bag a)

Methods

fromList :: [Item (Bag a)] -> Bag a

fromListN :: Int -> [Item (Bag a)] -> Bag a

toList :: Bag a -> [Item (Bag a)]

Outputable a => Outputable (Bag a)

Defined in GHC.Data.Bag

Methods

ppr :: Bag a -> SDoc

type Item (Bag a)

Defined in GHC.Data.Bag

type Item (Bag a) = a

bagToList :: Bag a -> [a]

data Pair a

Constructors

Pair a a

Instances

Foldable Pair

Defined in GHC.Data.Pair

Methods

fold :: Monoid m => Pair m -> m

foldMap :: Monoid m => (a -> m) -> Pair a -> m

foldMap' :: Monoid m => (a -> m) -> Pair a -> m

foldr :: (a -> b -> b) -> b -> Pair a -> b

foldr' :: (a -> b -> b) -> b -> Pair a -> b

foldl :: (b -> a -> b) -> b -> Pair a -> b

foldl' :: (b -> a -> b) -> b -> Pair a -> b

foldr1 :: (a -> a -> a) -> Pair a -> a

foldl1 :: (a -> a -> a) -> Pair a -> a

toList :: Pair a -> [a]

null :: Pair a -> Bool

length :: Pair a -> Int

elem :: Eq a => a -> Pair a -> Bool

maximum :: Ord a => Pair a -> a

minimum :: Ord a => Pair a -> a

sum :: Num a => Pair a -> a

product :: Num a => Pair a -> a

Traversable Pair

Defined in GHC.Data.Pair

Methods

traverse :: Applicative f => (a -> f b) -> Pair a -> f (Pair b)

sequenceA :: Applicative f => Pair (f a) -> f (Pair a)

mapM :: Monad m => (a -> m b) -> Pair a -> m (Pair b)

sequence :: Monad m => Pair (m a) -> m (Pair a)

Applicative Pair

Defined in GHC.Data.Pair

Methods

pure :: a -> Pair a

(<*>) :: Pair (a -> b) -> Pair a -> Pair b

liftA2 :: (a -> b -> c) -> Pair a -> Pair b -> Pair c

(*>) :: Pair a -> Pair b -> Pair b

(<*) :: Pair a -> Pair b -> Pair a

Functor Pair

Defined in GHC.Data.Pair

Methods

fmap :: (a -> b) -> Pair a -> Pair b

(<$) :: a -> Pair b -> Pair a

(Semigroup a, Monoid a) => Monoid (Pair a)

Defined in GHC.Data.Pair

Methods

mempty :: Pair a

mappend :: Pair a -> Pair a -> Pair a

mconcat :: [Pair a] -> Pair a

Semigroup a => Semigroup (Pair a)

Defined in GHC.Data.Pair

Methods

(<>) :: Pair a -> Pair a -> Pair a

sconcat :: NonEmpty (Pair a) -> Pair a

stimes :: Integral b => b -> Pair a -> Pair a

Outputable a => Outputable (Pair a)

Defined in GHC.Data.Pair

Methods

ppr :: Pair a -> SDoc

data WarnReason

Used when outputting warnings: if a reason is given, it is displayed. If a warning isn't controlled by a flag, this is made explicit at the point of use.

Constructors

NoReason

Instances

Show WarnReason

Defined in GHC.Driver.Flags

Methods

showsPrec :: Int -> WarnReason -> ShowS

show :: WarnReason -> String

showList :: [WarnReason] -> ShowS

ToJson WarnReason

Defined in GHC.Driver.Flags

Methods

json :: WarnReason -> JsonDoc

Outputable WarnReason

Defined in GHC.Driver.Flags

Methods

ppr :: WarnReason -> SDoc

data GeneralFlag

Enumerates the simple on-or-off dynamic flags

Constructors

Opt_Haddock

Opt_DeferTypedHoles

Opt_PIC

-fPIC

Opt_ImplicitImportQualified

Opt_KeepRawTokenStream

Instances

Enum GeneralFlag

Defined in GHC.Driver.Flags

Methods

succ :: GeneralFlag -> GeneralFlag

pred :: GeneralFlag -> GeneralFlag

toEnum :: Int -> GeneralFlag

fromEnum :: GeneralFlag -> Int

enumFrom :: GeneralFlag -> [GeneralFlag]

enumFromThen :: GeneralFlag -> GeneralFlag -> [GeneralFlag]

enumFromTo :: GeneralFlag -> GeneralFlag -> [GeneralFlag]

enumFromThenTo :: GeneralFlag -> GeneralFlag -> GeneralFlag -> [GeneralFlag]

Show GeneralFlag

Defined in GHC.Driver.Flags

Methods

showsPrec :: Int -> GeneralFlag -> ShowS

show :: GeneralFlag -> String

showList :: [GeneralFlag] -> ShowS

Eq GeneralFlag

Defined in GHC.Driver.Flags

Methods

(==) :: GeneralFlag -> GeneralFlag -> Bool

(/=) :: GeneralFlag -> GeneralFlag -> Bool

data Phase

Constructors

StopLn

Instances

Show Phase

Defined in GHC.Driver.Phases

Methods

showsPrec :: Int -> Phase -> ShowS

show :: Phase -> String

showList :: [Phase] -> ShowS

Outputable Phase

Defined in GHC.Driver.Phases

Methods

ppr :: Phase -> SDoc

Eq Phase

Defined in GHC.Driver.Phases

Methods

(==) :: Phase -> Phase -> Bool

(/=) :: Phase -> Phase -> Bool

showSDocDump :: SDocContext -> SDoc -> String

showSDoc :: DynFlags -> SDoc -> String

Show a SDoc as a String with the default user style

showPpr :: Outputable a => DynFlags -> a -> String

data TopLevelFlag

Constructors

NotTopLevel

Instances

Data TopLevelFlag

Defined in GHC.Types.Basic

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TopLevelFlag -> c TopLevelFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TopLevelFlag

toConstr :: TopLevelFlag -> Constr

dataTypeOf :: TopLevelFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TopLevelFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TopLevelFlag)

gmapT :: (forall b. Data b => b -> b) -> TopLevelFlag -> TopLevelFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TopLevelFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TopLevelFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> TopLevelFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TopLevelFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag

Outputable TopLevelFlag

Defined in GHC.Types.Basic

Methods

ppr :: TopLevelFlag -> SDoc

data PromotionFlag

Is a TyCon a promoted data constructor or just a normal type constructor?

Constructors

NotPromoted

Instances

Data PromotionFlag

Defined in GHC.Types.Basic

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PromotionFlag -> c PromotionFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PromotionFlag

toConstr :: PromotionFlag -> Constr

dataTypeOf :: PromotionFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PromotionFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PromotionFlag)

gmapT :: (forall b. Data b => b -> b) -> PromotionFlag -> PromotionFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PromotionFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PromotionFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> PromotionFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> PromotionFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> PromotionFlag -> m PromotionFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PromotionFlag -> m PromotionFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PromotionFlag -> m PromotionFlag

Binary PromotionFlag

Defined in GHC.Types.Basic

Methods

put_ :: BinHandle -> PromotionFlag -> IO ()

put :: BinHandle -> PromotionFlag -> IO (Bin PromotionFlag)

get :: BinHandle -> IO PromotionFlag

Outputable PromotionFlag

Defined in GHC.Types.Basic

Methods

ppr :: PromotionFlag -> SDoc

Eq PromotionFlag

Defined in GHC.Types.Basic

Methods

(==) :: PromotionFlag -> PromotionFlag -> Bool

(/=) :: PromotionFlag -> PromotionFlag -> Bool

data PprPrec

A general-purpose pretty-printing precedence type.

Instances

Show PprPrec

Defined in GHC.Types.Basic

Methods

showsPrec :: Int -> PprPrec -> ShowS

show :: PprPrec -> String

showList :: [PprPrec] -> ShowS

Eq PprPrec

Defined in GHC.Types.Basic

Methods

(==) :: PprPrec -> PprPrec -> Bool

(/=) :: PprPrec -> PprPrec -> Bool

Ord PprPrec

Defined in GHC.Types.Basic

Methods

compare :: PprPrec -> PprPrec -> Ordering

(<) :: PprPrec -> PprPrec -> Bool

(<=) :: PprPrec -> PprPrec -> Bool

(>) :: PprPrec -> PprPrec -> Bool

(>=) :: PprPrec -> PprPrec -> Bool

max :: PprPrec -> PprPrec -> PprPrec

min :: PprPrec -> PprPrec -> PprPrec

data InlinePragma

Instances

Data InlinePragma

Defined in GHC.Types.Basic

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InlinePragma -> c InlinePragma

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c InlinePragma

toConstr :: InlinePragma -> Constr

dataTypeOf :: InlinePragma -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c InlinePragma)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c InlinePragma)

gmapT :: (forall b. Data b => b -> b) -> InlinePragma -> InlinePragma

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InlinePragma -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InlinePragma -> r

gmapQ :: (forall d. Data d => d -> u) -> InlinePragma -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> InlinePragma -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> InlinePragma -> m InlinePragma

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InlinePragma -> m InlinePragma

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InlinePragma -> m InlinePragma

Binary InlinePragma

Defined in GHC.Types.Basic

Methods

put_ :: BinHandle -> InlinePragma -> IO ()

put :: BinHandle -> InlinePragma -> IO (Bin InlinePragma)

get :: BinHandle -> IO InlinePragma

Outputable InlinePragma

Defined in GHC.Types.Basic

Methods

ppr :: InlinePragma -> SDoc

Eq InlinePragma

Defined in GHC.Types.Basic

Methods

(==) :: InlinePragma -> InlinePragma -> Bool

(/=) :: InlinePragma -> InlinePragma -> Bool

data Boxity

Constructors

Boxed

Instances

Data Boxity

Defined in GHC.Types.Basic

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Boxity -> c Boxity

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Boxity

toConstr :: Boxity -> Constr

dataTypeOf :: Boxity -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Boxity)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Boxity)

gmapT :: (forall b. Data b => b -> b) -> Boxity -> Boxity

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Boxity -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Boxity -> r

gmapQ :: (forall d. Data d => d -> u) -> Boxity -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Boxity -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity

Outputable Boxity

Defined in GHC.Types.Basic

Methods

ppr :: Boxity -> SDoc

Eq Boxity

Defined in GHC.Types.Basic

Methods

(==) :: Boxity -> Boxity -> Bool

(/=) :: Boxity -> Boxity -> Bool

type Arity = Int

The number of value arguments that can be applied to a value before it does "real work". So: fib 100 has arity 0 x -> fib x has arity 1 See also Note [Definition of arity] in GHC.Core.Opt.Arity

topPrec :: PprPrec

noOccInfo :: OccInfo

isStrongLoopBreaker :: OccInfo -> Bool

isDeadOcc :: OccInfo -> Bool

funPrec :: PprPrec

data FieldLabel

Fields in an algebraic record type; see Note [FieldLabel].

Instances

Data FieldLabel

Defined in GHC.Types.FieldLabel

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FieldLabel -> c FieldLabel

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FieldLabel

toConstr :: FieldLabel -> Constr

dataTypeOf :: FieldLabel -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FieldLabel)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FieldLabel)

gmapT :: (forall b. Data b => b -> b) -> FieldLabel -> FieldLabel

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FieldLabel -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FieldLabel -> r

gmapQ :: (forall d. Data d => d -> u) -> FieldLabel -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FieldLabel -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel

HasOccName FieldLabel

Defined in GHC.Types.FieldLabel

Methods

occName :: FieldLabel -> OccName

Binary Name => Binary FieldLabel

We need the Binary Name constraint here even though there is an instance defined in GHC.Types.Name, because the we have a SOURCE import, so the instance is not in scope. And the instance cannot be added to Name.hs-boot because GHC.Utils.Binary itself depends on GHC.Types.Name.

Defined in GHC.Types.FieldLabel

Methods

put_ :: BinHandle -> FieldLabel -> IO ()

put :: BinHandle -> FieldLabel -> IO (Bin FieldLabel)

get :: BinHandle -> IO FieldLabel

Outputable FieldLabel

Defined in GHC.Types.FieldLabel

Methods

ppr :: FieldLabel -> SDoc

Eq FieldLabel

Defined in GHC.Types.FieldLabel

Methods

(==) :: FieldLabel -> FieldLabel -> Bool

(/=) :: FieldLabel -> FieldLabel -> Bool

data LexicalFixity

Captures the fixity of declarations as they are parsed. This is not necessarily the same as the fixity declaration, as the normal fixity may be overridden using parens or backticks.

Constructors

Prefix

Instances

Data LexicalFixity

Defined in GHC.Types.Fixity

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LexicalFixity -> c LexicalFixity

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LexicalFixity

toConstr :: LexicalFixity -> Constr

dataTypeOf :: LexicalFixity -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LexicalFixity)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LexicalFixity)

gmapT :: (forall b. Data b => b -> b) -> LexicalFixity -> LexicalFixity

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFixity -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFixity -> r

gmapQ :: (forall d. Data d => d -> u) -> LexicalFixity -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> LexicalFixity -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity

Outputable LexicalFixity

Defined in GHC.Types.Fixity

Methods

ppr :: LexicalFixity -> SDoc

Eq LexicalFixity

Defined in GHC.Types.Fixity

Methods

(==) :: LexicalFixity -> LexicalFixity -> Bool

(/=) :: LexicalFixity -> LexicalFixity -> Bool

data FixityDirection

Constructors

InfixR

InfixN

Instances

Data FixityDirection

Defined in GHC.Types.Fixity

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FixityDirection -> c FixityDirection

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FixityDirection

toConstr :: FixityDirection -> Constr

dataTypeOf :: FixityDirection -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FixityDirection)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FixityDirection)

gmapT :: (forall b. Data b => b -> b) -> FixityDirection -> FixityDirection

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FixityDirection -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FixityDirection -> r

gmapQ :: (forall d. Data d => d -> u) -> FixityDirection -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FixityDirection -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection

Binary FixityDirection

Defined in GHC.Types.Fixity

Methods

put_ :: BinHandle -> FixityDirection -> IO ()

put :: BinHandle -> FixityDirection -> IO (Bin FixityDirection)

get :: BinHandle -> IO FixityDirection

Outputable FixityDirection

Defined in GHC.Types.Fixity

Methods

ppr :: FixityDirection -> SDoc

Eq FixityDirection

Defined in GHC.Types.Fixity

Methods

(==) :: FixityDirection -> FixityDirection -> Bool

(/=) :: FixityDirection -> FixityDirection -> Bool

data Fixity

Constructors

Fixity SourceText Int FixityDirection

Instances

Data Fixity

Defined in GHC.Types.Fixity

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Fixity -> c Fixity

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Fixity

toConstr :: Fixity -> Constr

dataTypeOf :: Fixity -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Fixity)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Fixity)

gmapT :: (forall b. Data b => b -> b) -> Fixity -> Fixity

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Fixity -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Fixity -> r

gmapQ :: (forall d. Data d => d -> u) -> Fixity -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Fixity -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity

Binary Fixity

Defined in GHC.Types.Fixity

Methods

put_ :: BinHandle -> Fixity -> IO ()

put :: BinHandle -> Fixity -> IO (Bin Fixity)

get :: BinHandle -> IO Fixity

Outputable Fixity

Defined in GHC.Types.Fixity

Methods

ppr :: Fixity -> SDoc

Eq Fixity

Defined in GHC.Types.Fixity

Methods

(==) :: Fixity -> Fixity -> Bool

(/=) :: Fixity -> Fixity -> Bool

data IdInfo

Identifier Information

An IdInfo gives optional information about an Id. If present it never lies, but it may not be present, in which case there is always a conservative assumption which can be made.

Two Ids may have different info even though they have the same Unique (and are hence the same Id); for example, one might lack the properties attached to the other.

Most of the IdInfo gives information about the value, or definition, of the Id, independent of its usage. Exceptions to this are demandInfo, occInfo, oneShotInfo and callArityInfo.

Performance note: when we update IdInfo, we have to reallocate this entire record, so it is a good idea not to let this data structure get too big.

data IdDetails

Identifier Details

The IdDetails of an Id give stable, and necessary, information about the Id.

Constructors

VanillaId

RecSelId RecSelParent Bool

The Id for a record selector

DataConWorkId DataCon

The Id is for a data constructor worker

DataConWrapId DataCon

The Id is for a data constructor wrapper

Instances

Outputable IdDetails

Defined in GHC.Types.Id.Info

Methods

ppr :: IdDetails -> SDoc

vanillaIdInfo :: IdInfo

Basic IdInfo that carries no useful information whatsoever

data VarBndr var argf

Constructors

Bndr var argf

Instances

(Data var, Data argf) => Data (VarBndr var argf)

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> VarBndr var argf -> c (VarBndr var argf)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (VarBndr var argf)

toConstr :: VarBndr var argf -> Constr

dataTypeOf :: VarBndr var argf -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (VarBndr var argf))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (VarBndr var argf))

gmapT :: (forall b. Data b => b -> b) -> VarBndr var argf -> VarBndr var argf

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> VarBndr var argf -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> VarBndr var argf -> r

gmapQ :: (forall d. Data d => d -> u) -> VarBndr var argf -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> VarBndr var argf -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> VarBndr var argf -> m (VarBndr var argf)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> VarBndr var argf -> m (VarBndr var argf)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> VarBndr var argf -> m (VarBndr var argf)

NamedThing tv => NamedThing (VarBndr tv flag)

Defined in GHC.Types.Var

Methods

getOccName :: VarBndr tv flag -> OccName

getName :: VarBndr tv flag -> Name

(Binary tv, Binary vis) => Binary (VarBndr tv vis)

Defined in GHC.Types.Var

Methods

put_ :: BinHandle -> VarBndr tv vis -> IO ()

put :: BinHandle -> VarBndr tv vis -> IO (Bin (VarBndr tv vis))

get :: BinHandle -> IO (VarBndr tv vis)

OutputableBndr tv => Outputable (VarBndr tv TyConBndrVis)

Defined in GHC.Core.TyCon

Methods

ppr :: VarBndr tv TyConBndrVis -> SDoc

Outputable tv => Outputable (VarBndr tv ArgFlag)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv ArgFlag -> SDoc

Outputable tv => Outputable (VarBndr tv Specificity)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv Specificity -> SDoc

(Eq tyvar, Eq argf) => Eq (VarBndr tyvar argf)

Defined in Language.Haskell.Liquid.GHC.TypeRep

Methods

(==) :: VarBndr tyvar argf -> VarBndr tyvar argf -> Bool

(/=) :: VarBndr tyvar argf -> VarBndr tyvar argf -> Bool

data Var

Variable

Essentially a typed Name, that may also contain some additional information about the Var and its use sites.

Instances

Data Var

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Var -> c Var

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Var

toConstr :: Var -> Constr

dataTypeOf :: Var -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Var)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Var)

gmapT :: (forall b. Data b => b -> b) -> Var -> Var

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Var -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Var -> r

gmapQ :: (forall d. Data d => d -> u) -> Var -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Var -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Var -> m Var

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Var -> m Var

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Var -> m Var

Show CoreExpr

Defined in Language.Haskell.Liquid.Transforms.CoreToLogic

Methods

showsPrec :: Int -> CoreExpr -> ShowS

show :: CoreExpr -> String

showList :: [CoreExpr] -> ShowS

Show Var

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

showsPrec :: Int -> Var -> ShowS

show :: Var -> String

showList :: [Var] -> ShowS

NFData Var

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

rnf :: Var -> ()

NamedThing Var

Defined in GHC.Types.Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

HasOccName Var

Defined in GHC.Types.Var

Methods

occName :: Var -> OccName

Uniquable Var

Defined in GHC.Types.Var

Methods

getUnique :: Var -> Unique

Outputable Var

Defined in GHC.Types.Var

Methods

ppr :: Var -> SDoc

Eq Var

Defined in GHC.Types.Var

Methods

(==) :: Var -> Var -> Bool

(/=) :: Var -> Var -> Bool

Ord Var

Defined in GHC.Types.Var

Methods

compare :: Var -> Var -> Ordering

(<) :: Var -> Var -> Bool

(<=) :: Var -> Var -> Bool

(>) :: Var -> Var -> Bool

(>=) :: Var -> Var -> Bool

max :: Var -> Var -> Var

min :: Var -> Var -> Var

Hashable Var

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

hashWithSalt :: Int -> Var -> Int

hash :: Var -> Int

Symbolic Var

NOTE:REFLECT-IMPORTS

we **eschew** the unique suffix for exported vars, to make it possible to lookup names from symbols _across_ modules; anyways exported names are top-level and you shouldn't have local binders that shadow them. However, we **keep** the unique suffix for local variables, as otherwise there are spurious, but extremely problematic, name collisions in the fixpoint environment.

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

symbol :: Var -> Symbol

Fixpoint Var

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

toFix :: Var -> Doc

simplify :: Var -> Var

PPrint Var

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> Var -> Doc

pprintPrec :: Int -> Tidy -> Var -> Doc

Expression Var

Converting to Fixpoint ----------------------------------------------------

Defined in Language.Haskell.Liquid.Types.RefType

Methods

expr :: Var -> Expr

Loc Var

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

srcSpan :: Var -> SrcSpan

ResolveSym Var

Defined in Language.Haskell.Liquid.Bare.Resolve

Methods

resolveLocSym :: Env -> ModName -> String -> LocSymbol -> Lookup Var

Subable CoreExpr

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> CoreExpr -> CoreExpr

subTy :: HashMap TyVar Type -> CoreExpr -> CoreExpr

Subable Var

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> Var -> Var

subTy :: HashMap TyVar Type -> Var -> Var

CBVisitable CoreBind

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> CoreBind -> [Var]

readVars :: CoreBind -> [Var]

letVars :: CoreBind -> [Var]

literals :: CoreBind -> [Literal]

SubsTy TyVar Type SpecType

Defined in Language.Haskell.Liquid.Types.RefType

Methods

subt :: (TyVar, Type) -> SpecType -> SpecType

PPrint (Bind Var)

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> Bind Var -> Doc

pprintPrec :: Int -> Tidy -> Bind Var -> Doc

PPrint (Expr Var)

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> Expr Var -> Doc

pprintPrec :: Int -> Tidy -> Expr Var -> Doc

Subable (Alt Var)

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> Alt Var -> Alt Var

subTy :: HashMap TyVar Type -> Alt Var -> Alt Var

Subable (Bind Var)

Defined in Language.Haskell.Liquid.GHC.Play

Methods

sub :: HashMap CoreBndr CoreExpr -> Bind Var -> Bind Var

subTy :: HashMap TyVar Type -> Bind Var -> Bind Var

CBVisitable (Alt Var)

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> Alt Var -> [Var]

readVars :: Alt Var -> [Var]

letVars :: Alt Var -> [Var]

literals :: Alt Var -> [Literal]

CBVisitable (Expr Var)

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> Expr Var -> [Var]

readVars :: Expr Var -> [Var]

letVars :: Expr Var -> [Var]

literals :: Expr Var -> [Literal]

CBVisitable [CoreBind]

Defined in Language.Haskell.Liquid.Types.Visitors

Methods

freeVars :: HashSet Var -> [CoreBind] -> [Var]

readVars :: [CoreBind] -> [Var]

letVars :: [CoreBind] -> [Var]

literals :: [CoreBind] -> [Literal]

Show (Axiom Var Type CoreExpr)

Defined in Language.Haskell.Liquid.Types.Types

Methods

showsPrec :: Int -> Axiom Var Type CoreExpr -> ShowS

show :: Axiom Var Type CoreExpr -> String

showList :: [Axiom Var Type CoreExpr] -> ShowS

type Anno Id

Defined in GHC.Hs.Extension

type Anno Id = SrcSpanAnnN

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type TyVar = Var

Type or kind Variable

data Specificity

Whether an Invisible argument may appear in source Haskell.

Constructors

SpecifiedSpec

the argument may appear in source Haskell, but isn't required.

Instances

Data Specificity

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Specificity -> c Specificity

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Specificity

toConstr :: Specificity -> Constr

dataTypeOf :: Specificity -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Specificity)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Specificity)

gmapT :: (forall b. Data b => b -> b) -> Specificity -> Specificity

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Specificity -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Specificity -> r

gmapQ :: (forall d. Data d => d -> u) -> Specificity -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Specificity -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity

Binary Specificity

Defined in GHC.Types.Var

Methods

put_ :: BinHandle -> Specificity -> IO ()

put :: BinHandle -> Specificity -> IO (Bin Specificity)

get :: BinHandle -> IO Specificity

Eq Specificity

Defined in GHC.Types.Var

Methods

(==) :: Specificity -> Specificity -> Bool

(/=) :: Specificity -> Specificity -> Bool

Ord Specificity

Defined in GHC.Types.Var

Methods

compare :: Specificity -> Specificity -> Ordering

(<) :: Specificity -> Specificity -> Bool

(<=) :: Specificity -> Specificity -> Bool

(>) :: Specificity -> Specificity -> Bool

(>=) :: Specificity -> Specificity -> Bool

max :: Specificity -> Specificity -> Specificity

min :: Specificity -> Specificity -> Specificity

OutputableBndrFlag Specificity p

Defined in GHC.Hs.Type

Methods

pprTyVarBndr :: HsTyVarBndr Specificity (GhcPass p) -> SDoc

Outputable tv => Outputable (VarBndr tv Specificity)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv Specificity -> SDoc

type Id = Var

Identifier

data ArgFlag

Argument Flag

Is something required to appear in source Haskell (Required), permitted by request (Specified) (visible type application), or prohibited entirely from appearing in source Haskell (Inferred)? See Note [VarBndrs, TyCoVarBinders, TyConBinders, and visibility] in GHC.Core.TyCo.Rep

Constructors

Required

Instances

Data ArgFlag

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ArgFlag -> c ArgFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ArgFlag

toConstr :: ArgFlag -> Constr

dataTypeOf :: ArgFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ArgFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ArgFlag)

gmapT :: (forall b. Data b => b -> b) -> ArgFlag -> ArgFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ArgFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ArgFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> ArgFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ArgFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ArgFlag -> m ArgFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ArgFlag -> m ArgFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ArgFlag -> m ArgFlag

Binary ArgFlag

Defined in GHC.Types.Var

Methods

put_ :: BinHandle -> ArgFlag -> IO ()

put :: BinHandle -> ArgFlag -> IO (Bin ArgFlag)

get :: BinHandle -> IO ArgFlag

Outputable ArgFlag

Defined in GHC.Types.Var

Methods

ppr :: ArgFlag -> SDoc

Eq ArgFlag

Defined in GHC.Types.Var

Methods

(==) :: ArgFlag -> ArgFlag -> Bool

(/=) :: ArgFlag -> ArgFlag -> Bool

Ord ArgFlag

Defined in GHC.Types.Var

Methods

compare :: ArgFlag -> ArgFlag -> Ordering

(<) :: ArgFlag -> ArgFlag -> Bool

(<=) :: ArgFlag -> ArgFlag -> Bool

(>) :: ArgFlag -> ArgFlag -> Bool

(>=) :: ArgFlag -> ArgFlag -> Bool

max :: ArgFlag -> ArgFlag -> ArgFlag

min :: ArgFlag -> ArgFlag -> ArgFlag

Outputable tv => Outputable (VarBndr tv ArgFlag)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv ArgFlag -> SDoc

data AnonArgFlag

The non-dependent version of ArgFlag. See Note [AnonArgFlag] Appears here partly so that it's together with its friends ArgFlag and ForallVisFlag, but also because it is used in IfaceType, rather early in the compilation chain

Constructors

VisArg

Used for (->): an ordinary non-dependent arrow. The argument is visible in source code.

Instances

Data AnonArgFlag

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnonArgFlag -> c AnonArgFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnonArgFlag

toConstr :: AnonArgFlag -> Constr

dataTypeOf :: AnonArgFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnonArgFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnonArgFlag)

gmapT :: (forall b. Data b => b -> b) -> AnonArgFlag -> AnonArgFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnonArgFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnonArgFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> AnonArgFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnonArgFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnonArgFlag -> m AnonArgFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnonArgFlag -> m AnonArgFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnonArgFlag -> m AnonArgFlag

Binary AnonArgFlag

Defined in GHC.Types.Var

Methods

put_ :: BinHandle -> AnonArgFlag -> IO ()

put :: BinHandle -> AnonArgFlag -> IO (Bin AnonArgFlag)

get :: BinHandle -> IO AnonArgFlag

Outputable AnonArgFlag

Defined in GHC.Types.Var

Methods

ppr :: AnonArgFlag -> SDoc

Eq AnonArgFlag

Defined in GHC.Types.Var

Methods

(==) :: AnonArgFlag -> AnonArgFlag -> Bool

(/=) :: AnonArgFlag -> AnonArgFlag -> Bool

Ord AnonArgFlag

Defined in GHC.Types.Var

Methods

compare :: AnonArgFlag -> AnonArgFlag -> Ordering

(<) :: AnonArgFlag -> AnonArgFlag -> Bool

(<=) :: AnonArgFlag -> AnonArgFlag -> Bool

(>) :: AnonArgFlag -> AnonArgFlag -> Bool

(>=) :: AnonArgFlag -> AnonArgFlag -> Bool

max :: AnonArgFlag -> AnonArgFlag -> AnonArgFlag

min :: AnonArgFlag -> AnonArgFlag -> AnonArgFlag

data SourceText

Constructors

SourceText String

NoSourceText

For when code is generated, e.g. TH, deriving. The pretty printer will then make its own representation of the item.

Instances

Data SourceText

Defined in GHC.Types.SourceText

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SourceText -> c SourceText

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SourceText

toConstr :: SourceText -> Constr

dataTypeOf :: SourceText -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SourceText)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SourceText)

gmapT :: (forall b. Data b => b -> b) -> SourceText -> SourceText

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SourceText -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SourceText -> r

gmapQ :: (forall d. Data d => d -> u) -> SourceText -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SourceText -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText

Show SourceText

Defined in GHC.Types.SourceText

Methods

showsPrec :: Int -> SourceText -> ShowS

show :: SourceText -> String

showList :: [SourceText] -> ShowS

Binary SourceText

Defined in GHC.Types.SourceText

Methods

put_ :: BinHandle -> SourceText -> IO ()

put :: BinHandle -> SourceText -> IO (Bin SourceText)

get :: BinHandle -> IO SourceText

Outputable SourceText

Defined in GHC.Types.SourceText

Methods

ppr :: SourceText -> SDoc

Eq SourceText

Defined in GHC.Types.SourceText

Methods

(==) :: SourceText -> SourceText -> Bool

(/=) :: SourceText -> SourceText -> Bool

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

mkTHFractionalLit :: Rational -> FractionalLit

mkIntegralLit :: Integral a => a -> IntegralLit

moduleStableString :: Module -> String

Get a string representation of a Module that's unique and stable across recompilations. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal"

data ModLocation

Module Location

Where a module lives on the file system: the actual locations of the .hs, .hi and .o files, if we have them.

For a module in another unit, the ml_hs_file and ml_obj_file components of ModLocation are undefined.

The locations specified by a ModLocation may or may not correspond to actual files yet: for example, even if the object file doesn't exist, the ModLocation still contains the path to where the object file will reside if/when it is created.

Instances

Show ModLocation

Defined in GHC.Unit.Module.Location

Methods

showsPrec :: Int -> ModLocation -> ShowS

show :: ModLocation -> String

showList :: [ModLocation] -> ShowS

Outputable ModLocation

Defined in GHC.Unit.Module.Location

Methods

ppr :: ModLocation -> SDoc

type ModuleNameWithIsBoot = GenWithIsBoot ModuleName

data IsBootInterface

Indicates whether a module name is referring to a boot interface (hs-boot file) or regular module (hs file). We need to treat boot modules specially when building compilation graphs, since they break cycles. Regular source files and signature files are treated equivalently.

Constructors

NotBoot

IsBoot

Instances

Data IsBootInterface

Defined in GHC.Unit.Types

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IsBootInterface -> c IsBootInterface

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IsBootInterface

toConstr :: IsBootInterface -> Constr

dataTypeOf :: IsBootInterface -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IsBootInterface)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IsBootInterface)

gmapT :: (forall b. Data b => b -> b) -> IsBootInterface -> IsBootInterface

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IsBootInterface -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IsBootInterface -> r

gmapQ :: (forall d. Data d => d -> u) -> IsBootInterface -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IsBootInterface -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

Show IsBootInterface

Defined in GHC.Unit.Types

Methods

showsPrec :: Int -> IsBootInterface -> ShowS

show :: IsBootInterface -> String

showList :: [IsBootInterface] -> ShowS

Binary IsBootInterface

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> IsBootInterface -> IO ()

put :: BinHandle -> IsBootInterface -> IO (Bin IsBootInterface)

get :: BinHandle -> IO IsBootInterface

Eq IsBootInterface

Defined in GHC.Unit.Types

Methods

(==) :: IsBootInterface -> IsBootInterface -> Bool

(/=) :: IsBootInterface -> IsBootInterface -> Bool

Ord IsBootInterface

Defined in GHC.Unit.Types

Methods

compare :: IsBootInterface -> IsBootInterface -> Ordering

(<) :: IsBootInterface -> IsBootInterface -> Bool

(<=) :: IsBootInterface -> IsBootInterface -> Bool

(>) :: IsBootInterface -> IsBootInterface -> Bool

(>=) :: IsBootInterface -> IsBootInterface -> Bool

max :: IsBootInterface -> IsBootInterface -> IsBootInterface

min :: IsBootInterface -> IsBootInterface -> IsBootInterface

data GenWithIsBoot mod

This data type just pairs a value mod with an IsBootInterface flag. In practice, mod is usually a Module or ModuleName'.

Instances

Foldable GenWithIsBoot

Defined in GHC.Unit.Types

Methods

fold :: Monoid m => GenWithIsBoot m -> m

foldMap :: Monoid m => (a -> m) -> GenWithIsBoot a -> m

foldMap' :: Monoid m => (a -> m) -> GenWithIsBoot a -> m

foldr :: (a -> b -> b) -> b -> GenWithIsBoot a -> b

foldr' :: (a -> b -> b) -> b -> GenWithIsBoot a -> b

foldl :: (b -> a -> b) -> b -> GenWithIsBoot a -> b

foldl' :: (b -> a -> b) -> b -> GenWithIsBoot a -> b

foldr1 :: (a -> a -> a) -> GenWithIsBoot a -> a

foldl1 :: (a -> a -> a) -> GenWithIsBoot a -> a

toList :: GenWithIsBoot a -> [a]

null :: GenWithIsBoot a -> Bool

length :: GenWithIsBoot a -> Int

elem :: Eq a => a -> GenWithIsBoot a -> Bool

maximum :: Ord a => GenWithIsBoot a -> a

minimum :: Ord a => GenWithIsBoot a -> a

sum :: Num a => GenWithIsBoot a -> a

product :: Num a => GenWithIsBoot a -> a

Traversable GenWithIsBoot

Defined in GHC.Unit.Types

Methods

traverse :: Applicative f => (a -> f b) -> GenWithIsBoot a -> f (GenWithIsBoot b)

sequenceA :: Applicative f => GenWithIsBoot (f a) -> f (GenWithIsBoot a)

mapM :: Monad m => (a -> m b) -> GenWithIsBoot a -> m (GenWithIsBoot b)

sequence :: Monad m => GenWithIsBoot (m a) -> m (GenWithIsBoot a)

Functor GenWithIsBoot

Defined in GHC.Unit.Types

Methods

fmap :: (a -> b) -> GenWithIsBoot a -> GenWithIsBoot b

(<$) :: a -> GenWithIsBoot b -> GenWithIsBoot a

Show mod => Show (GenWithIsBoot mod)

Defined in GHC.Unit.Types

Methods

showsPrec :: Int -> GenWithIsBoot mod -> ShowS

show :: GenWithIsBoot mod -> String

showList :: [GenWithIsBoot mod] -> ShowS

Binary a => Binary (GenWithIsBoot a)

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> GenWithIsBoot a -> IO ()

put :: BinHandle -> GenWithIsBoot a -> IO (Bin (GenWithIsBoot a))

get :: BinHandle -> IO (GenWithIsBoot a)

Outputable a => Outputable (GenWithIsBoot a)

Defined in GHC.Unit.Types

Methods

ppr :: GenWithIsBoot a -> SDoc

Eq mod => Eq (GenWithIsBoot mod)

Defined in GHC.Unit.Types

Methods

(==) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

(/=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

Ord mod => Ord (GenWithIsBoot mod)

Defined in GHC.Unit.Types

Methods

compare :: GenWithIsBoot mod -> GenWithIsBoot mod -> Ordering

(<) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

(<=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

(>) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

(>=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

max :: GenWithIsBoot mod -> GenWithIsBoot mod -> GenWithIsBoot mod

min :: GenWithIsBoot mod -> GenWithIsBoot mod -> GenWithIsBoot mod

unitString :: IsUnitId u => u -> String

toUnitId :: Unit -> UnitId

Return the UnitId of the Unit. For on-the-fly instantiated units, return the UnitId of the indefinite unit this unit is an instance of.

fsToUnit :: FastString -> Unit

Create a new simple unit identifier from a FastString. Internally, this is primarily used to specify wired-in unit identifiers.

moduleNameString :: ModuleName -> String

moduleNameFS :: ModuleName -> FastString

mkModuleNameFS :: FastString -> ModuleName

mkModuleName :: String -> ModuleName

class NamedThing a where

A class allowing convenient access to the Name of various datatypes

Minimal complete definition

getName

Methods

getOccName :: a -> OccName

getName :: a -> Name

Instances

NamedThing Class

Defined in GHC.Core.Class

Methods

getOccName :: Class -> OccName

getName :: Class -> Name

NamedThing ConLike

Defined in GHC.Core.ConLike

Methods

getOccName :: ConLike -> OccName

getName :: ConLike -> Name

NamedThing DataCon

Defined in GHC.Core.DataCon

Methods

getOccName :: DataCon -> OccName

getName :: DataCon -> Name

NamedThing FamInst

Defined in GHC.Core.FamInstEnv

Methods

getOccName :: FamInst -> OccName

getName :: FamInst -> Name

NamedThing ClsInst

Defined in GHC.Core.InstEnv

Methods

getOccName :: ClsInst -> OccName

getName :: ClsInst -> Name

NamedThing PatSyn

Defined in GHC.Core.PatSyn

Methods

getOccName :: PatSyn -> OccName

getName :: PatSyn -> Name

NamedThing TyCon

Defined in GHC.Core.TyCon

Methods

getOccName :: TyCon -> OccName

getName :: TyCon -> Name

NamedThing IfaceClassOp

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceClassOp -> OccName

getName :: IfaceClassOp -> Name

NamedThing IfaceConDecl

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceConDecl -> OccName

getName :: IfaceConDecl -> Name

NamedThing IfaceDecl

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceDecl -> OccName

getName :: IfaceDecl -> Name

NamedThing HoleFitCandidate

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

getOccName :: HoleFitCandidate -> OccName

getName :: HoleFitCandidate -> Name

NamedThing Name

Defined in GHC.Types.Name

Methods

getOccName :: Name -> OccName

getName :: Name -> Name

NamedThing TyThing

Defined in GHC.Types.TyThing

Methods

getOccName :: TyThing -> OccName

getName :: TyThing -> Name

NamedThing Var

Defined in GHC.Types.Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

NamedThing (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

getOccName :: CoAxiom br -> OccName

getName :: CoAxiom br -> Name

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

NamedThing tv => NamedThing (VarBndr tv flag)

Defined in GHC.Types.Var

Methods

getOccName :: VarBndr tv flag -> OccName

getName :: VarBndr tv flag -> Name

data Name

A unique, unambiguous name for something, containing information about where that thing originated.

Instances

Data Name

Defined in GHC.Types.Name

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Name -> c Name

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Name

toConstr :: Name -> Constr

dataTypeOf :: Name -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Name)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Name)

gmapT :: (forall b. Data b => b -> b) -> Name -> Name

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r

gmapQ :: (forall d. Data d => d -> u) -> Name -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Name -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Name -> m Name

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name

Show Name

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

showsPrec :: Int -> Name -> ShowS

show :: Name -> String

showList :: [Name] -> ShowS

NFData Name

Defined in GHC.Types.Name

Methods

rnf :: Name -> ()

NamedThing Name

Defined in GHC.Types.Name

Methods

getOccName :: Name -> OccName

getName :: Name -> Name

HasOccName Name

Defined in GHC.Types.Name

Methods

occName :: Name -> OccName

Uniquable Name

Defined in GHC.Types.Name

Methods

getUnique :: Name -> Unique

Binary Name

Assumes that the Name is a non-binding one. See putIfaceTopBndr and getIfaceTopBndr for serializing binding Names. See UserData for the rationale for this distinction.

Defined in GHC.Types.Name

Methods

put_ :: BinHandle -> Name -> IO ()

put :: BinHandle -> Name -> IO (Bin Name)

get :: BinHandle -> IO Name

Outputable Name

Defined in GHC.Types.Name

Methods

ppr :: Name -> SDoc

OutputableBndr Name

Defined in GHC.Types.Name

Methods

pprBndr :: BindingSite -> Name -> SDoc

pprPrefixOcc :: Name -> SDoc

pprInfixOcc :: Name -> SDoc

bndrIsJoin_maybe :: Name -> Maybe Int

Eq Name

The same comments as for Name's Ord instance apply.

Defined in GHC.Types.Name

Methods

(==) :: Name -> Name -> Bool

(/=) :: Name -> Name -> Bool

Ord Name

Caution: This instance is implemented via nonDetCmpUnique, which means that the ordering is not stable across deserialization or rebuilds.

See nonDetCmpUnique for further information, and trac #15240 for a bug caused by improper use of this instance.

Defined in GHC.Types.Name

Methods

compare :: Name -> Name -> Ordering

(<) :: Name -> Name -> Bool

(<=) :: Name -> Name -> Bool

(>) :: Name -> Name -> Bool

(>=) :: Name -> Name -> Bool

max :: Name -> Name -> Name

min :: Name -> Name -> Name

Symbolic Name

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

symbol :: Name -> Symbol

Fixpoint Name

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

toFix :: Name -> Doc

simplify :: Name -> Name

PPrint Name

Defined in Language.Haskell.Liquid.Types.PrettyPrint

Methods

pprintTidy :: Tidy -> Name -> Doc

pprintPrec :: Int -> Tidy -> Name -> Doc

type Anno Name

Defined in GHC.Hs.Extension

type Anno Name = SrcSpanAnnN

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

nameOccName :: Name -> OccName

data UnhelpfulSpanReason

Constructors

UnhelpfulNoLocationInfo

UnhelpfulWiredIn

UnhelpfulInteractive

UnhelpfulGenerated

UnhelpfulOther !FastString

Instances

Show UnhelpfulSpanReason

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> UnhelpfulSpanReason -> ShowS

show :: UnhelpfulSpanReason -> String

showList :: [UnhelpfulSpanReason] -> ShowS

Outputable UnhelpfulSpanReason

Defined in GHC.Types.SrcLoc

Methods

ppr :: UnhelpfulSpanReason -> SDoc

Eq UnhelpfulSpanReason

Defined in GHC.Types.SrcLoc

Methods

(==) :: UnhelpfulSpanReason -> UnhelpfulSpanReason -> Bool

(/=) :: UnhelpfulSpanReason -> UnhelpfulSpanReason -> Bool

data SrcSpan

Source Span

A SrcSpan identifies either a specific portion of a text file or a human-readable description of a location.

Constructors

RealSrcSpan !RealSrcSpan !(Maybe BufSpan)

UnhelpfulSpan !UnhelpfulSpanReason

Instances

FromJSON SrcSpan

Defined in Language.Haskell.Liquid.Types.Errors

Methods

parseJSON :: Value -> Parser SrcSpan

parseJSONList :: Value -> Parser [SrcSpan]

FromJSONKey SrcSpan

Defined in Language.Haskell.Liquid.Types.Errors

Methods

fromJSONKey :: FromJSONKeyFunction SrcSpan

fromJSONKeyList :: FromJSONKeyFunction [SrcSpan]

ToJSON SrcSpan

Defined in Language.Haskell.Liquid.Types.Errors

Methods

toJSON :: SrcSpan -> Value

toEncoding :: SrcSpan -> Encoding

toJSONList :: [SrcSpan] -> Value

toEncodingList :: [SrcSpan] -> Encoding

ToJSONKey SrcSpan

Defined in Language.Haskell.Liquid.Types.Errors

Methods

toJSONKey :: ToJSONKeyFunction SrcSpan

toJSONKeyList :: ToJSONKeyFunction [SrcSpan]

Data SrcSpan

Defined in GHC.Types.SrcLoc

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcSpan -> c SrcSpan

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcSpan

toConstr :: SrcSpan -> Constr

dataTypeOf :: SrcSpan -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcSpan)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcSpan)

gmapT :: (forall b. Data b => b -> b) -> SrcSpan -> SrcSpan

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpan -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpan -> r

gmapQ :: (forall d. Data d => d -> u) -> SrcSpan -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcSpan -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan

Show SrcSpan

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> SrcSpan -> ShowS

show :: SrcSpan -> String

showList :: [SrcSpan] -> ShowS

NFData SrcSpan

Defined in GHC.Types.SrcLoc

Methods

rnf :: SrcSpan -> ()

ToJson SrcSpan

Defined in GHC.Types.SrcLoc

Methods

json :: SrcSpan -> JsonDoc

Outputable SrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcSpan -> SDoc

Eq SrcSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: SrcSpan -> SrcSpan -> Bool

(/=) :: SrcSpan -> SrcSpan -> Bool

Hashable SrcSpan

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

hashWithSalt :: Int -> SrcSpan -> Int

hash :: SrcSpan -> Int

PPrint SrcSpan

Defined in Language.Haskell.Liquid.Types.Errors

Methods

pprintTidy :: Tidy -> SrcSpan -> Doc

pprintPrec :: Int -> Tidy -> SrcSpan -> Doc

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

Outputable e => Outputable (Located e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: Located e -> SDoc

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

data SrcLoc

Source Location

Instances

Show SrcLoc

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> SrcLoc -> ShowS

show :: SrcLoc -> String

showList :: [SrcLoc] -> ShowS

Outputable SrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcLoc -> SDoc

Eq SrcLoc

Defined in GHC.Types.SrcLoc

Methods

(==) :: SrcLoc -> SrcLoc -> Bool

(/=) :: SrcLoc -> SrcLoc -> Bool

data RealSrcSpan

A SrcSpan delimits a portion of a text file. It could be represented by a pair of (line,column) coordinates, but in fact we optimise slightly by using more compact representations for single-line and zero-length spans, both of which are quite common.

The end position is defined to be the column after the end of the span. That is, a span of (1,1)-(1,2) is one character long, and a span of (1,1)-(1,1) is zero characters long.

Real Source Span

Instances

FromJSON RealSrcSpan

Defined in Language.Haskell.Liquid.Types.Errors

Methods

parseJSON :: Value -> Parser RealSrcSpan

parseJSONList :: Value -> Parser [RealSrcSpan]

ToJSON RealSrcSpan

Defined in Language.Haskell.Liquid.Types.Errors

Methods

toJSON :: RealSrcSpan -> Value

toEncoding :: RealSrcSpan -> Encoding

toJSONList :: [RealSrcSpan] -> Value

toEncodingList :: [RealSrcSpan] -> Encoding

Data RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RealSrcSpan -> c RealSrcSpan

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RealSrcSpan

toConstr :: RealSrcSpan -> Constr

dataTypeOf :: RealSrcSpan -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RealSrcSpan)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RealSrcSpan)

gmapT :: (forall b. Data b => b -> b) -> RealSrcSpan -> RealSrcSpan

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RealSrcSpan -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RealSrcSpan -> r

gmapQ :: (forall d. Data d => d -> u) -> RealSrcSpan -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> RealSrcSpan -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan

Show RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> RealSrcSpan -> ShowS

show :: RealSrcSpan -> String

showList :: [RealSrcSpan] -> ShowS

ToJson RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

json :: RealSrcSpan -> JsonDoc

Outputable RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcSpan -> SDoc

Eq RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: RealSrcSpan -> RealSrcSpan -> Bool

(/=) :: RealSrcSpan -> RealSrcSpan -> Bool

Ord RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

compare :: RealSrcSpan -> RealSrcSpan -> Ordering

(<) :: RealSrcSpan -> RealSrcSpan -> Bool

(<=) :: RealSrcSpan -> RealSrcSpan -> Bool

(>) :: RealSrcSpan -> RealSrcSpan -> Bool

(>=) :: RealSrcSpan -> RealSrcSpan -> Bool

max :: RealSrcSpan -> RealSrcSpan -> RealSrcSpan

min :: RealSrcSpan -> RealSrcSpan -> RealSrcSpan

Outputable e => Outputable (GenLocated RealSrcSpan e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: GenLocated RealSrcSpan e -> SDoc

data RealSrcLoc

Real Source Location

Represents a single point within a file

Instances

Show RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> RealSrcLoc -> ShowS

show :: RealSrcLoc -> String

showList :: [RealSrcLoc] -> ShowS

Outputable RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcLoc -> SDoc

Eq RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

(==) :: RealSrcLoc -> RealSrcLoc -> Bool

(/=) :: RealSrcLoc -> RealSrcLoc -> Bool

Ord RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

compare :: RealSrcLoc -> RealSrcLoc -> Ordering

(<) :: RealSrcLoc -> RealSrcLoc -> Bool

(<=) :: RealSrcLoc -> RealSrcLoc -> Bool

(>) :: RealSrcLoc -> RealSrcLoc -> Bool

(>=) :: RealSrcLoc -> RealSrcLoc -> Bool

max :: RealSrcLoc -> RealSrcLoc -> RealSrcLoc

min :: RealSrcLoc -> RealSrcLoc -> RealSrcLoc

type Located = GenLocated SrcSpan

data GenLocated l e

We attach SrcSpans to lots of things, so let's have a datatype for it.

Constructors

L l e

Instances

Foldable (GenLocated l)

Defined in GHC.Types.SrcLoc

Methods

fold :: Monoid m => GenLocated l m -> m

foldMap :: Monoid m => (a -> m) -> GenLocated l a -> m

foldMap' :: Monoid m => (a -> m) -> GenLocated l a -> m

foldr :: (a -> b -> b) -> b -> GenLocated l a -> b

foldr' :: (a -> b -> b) -> b -> GenLocated l a -> b

foldl :: (b -> a -> b) -> b -> GenLocated l a -> b

foldl' :: (b -> a -> b) -> b -> GenLocated l a -> b

foldr1 :: (a -> a -> a) -> GenLocated l a -> a

foldl1 :: (a -> a -> a) -> GenLocated l a -> a

toList :: GenLocated l a -> [a]

null :: GenLocated l a -> Bool

length :: GenLocated l a -> Int

elem :: Eq a => a -> GenLocated l a -> Bool

maximum :: Ord a => GenLocated l a -> a

minimum :: Ord a => GenLocated l a -> a

sum :: Num a => GenLocated l a -> a

product :: Num a => GenLocated l a -> a

Traversable (GenLocated l)

Defined in GHC.Types.SrcLoc

Methods

traverse :: Applicative f => (a -> f b) -> GenLocated l a -> f (GenLocated l b)

sequenceA :: Applicative f => GenLocated l (f a) -> f (GenLocated l a)

mapM :: Monad m => (a -> m b) -> GenLocated l a -> m (GenLocated l b)

sequence :: Monad m => GenLocated l (m a) -> m (GenLocated l a)

Functor (GenLocated l)

Defined in GHC.Types.SrcLoc

Methods

fmap :: (a -> b) -> GenLocated l a -> GenLocated l b

(<$) :: a -> GenLocated l b -> GenLocated l a

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

Binary a => Binary (LocatedL a)

Defined in GHC.Parser.Annotation

Methods

put_ :: BinHandle -> LocatedL a -> IO ()

put :: BinHandle -> LocatedL a -> IO (Bin (LocatedL a))

get :: BinHandle -> IO (LocatedL a)

Outputable e => Outputable (Located e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: Located e -> SDoc

(Data l, Data e) => Data (GenLocated l e)

Defined in GHC.Types.SrcLoc

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenLocated l e -> c (GenLocated l e)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GenLocated l e)

toConstr :: GenLocated l e -> Constr

dataTypeOf :: GenLocated l e -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GenLocated l e))

dataCast2 :: Typeable t => (forall d e0. (Data d, Data e0) => c (t d e0)) -> Maybe (c (GenLocated l e))

gmapT :: (forall b. Data b => b -> b) -> GenLocated l e -> GenLocated l e

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenLocated l e -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenLocated l e -> r

gmapQ :: (forall d. Data d => d -> u) -> GenLocated l e -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GenLocated l e -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e)

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

Outputable (GenLocated Anchor EpaComment)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated Anchor EpaComment -> SDoc

(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc

Outputable e => Outputable (GenLocated RealSrcSpan e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: GenLocated RealSrcSpan e -> SDoc

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

(Eq l, Eq e) => Eq (GenLocated l e)

Defined in GHC.Types.SrcLoc

Methods

(==) :: GenLocated l e -> GenLocated l e -> Bool

(/=) :: GenLocated l e -> GenLocated l e -> Bool

(Ord l, Ord e) => Ord (GenLocated l e)

Defined in GHC.Types.SrcLoc

Methods

compare :: GenLocated l e -> GenLocated l e -> Ordering

(<) :: GenLocated l e -> GenLocated l e -> Bool

(<=) :: GenLocated l e -> GenLocated l e -> Bool

(>) :: GenLocated l e -> GenLocated l e -> Bool

(>=) :: GenLocated l e -> GenLocated l e -> Bool

max :: GenLocated l e -> GenLocated l e -> GenLocated l e

min :: GenLocated l e -> GenLocated l e -> GenLocated l e

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.PostProcess

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.Types

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

unLoc :: GenLocated l e -> e

srcSpanToRealSrcSpan :: SrcSpan -> Maybe RealSrcSpan

srcSpanStartLine :: RealSrcSpan -> Int

srcSpanStartCol :: RealSrcSpan -> Int

srcSpanFileName_maybe :: SrcSpan -> Maybe FastString

Obtains the filename for a SrcSpan if it is "good"

srcSpanEndLine :: RealSrcSpan -> Int

srcSpanEndCol :: RealSrcSpan -> Int

srcLocLine :: RealSrcLoc -> Int

Raises an error when used on a "bad" SrcLoc

srcLocFile :: RealSrcLoc -> FastString

Gives the filename of the SrcLoc

srcLocCol :: RealSrcLoc -> Int

Raises an error when used on a "bad" SrcLoc

realSrcSpanStart :: RealSrcSpan -> RealSrcLoc

noSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

mkSrcSpan :: SrcLoc -> SrcLoc -> SrcSpan

Create a SrcSpan between two points in a file

mkSrcLoc :: FastString -> Int -> Int -> SrcLoc

mkRealSrcSpan :: RealSrcLoc -> RealSrcLoc -> RealSrcSpan

Create a SrcSpan between two points in a file

mkRealSrcLoc :: FastString -> Int -> Int -> RealSrcLoc

mkGeneralSrcSpan :: FastString -> SrcSpan

Create a "bad" SrcSpan that has not location information

isGoodSrcSpan :: SrcSpan -> Bool

Test if a SrcSpan is "good", i.e. has precise location information

combineSrcSpans :: SrcSpan -> SrcSpan -> SrcSpan

Combines two SrcSpan into one that spans at least all the characters within both spans. Returns UnhelpfulSpan if the files differ.

mkUniqSet :: Uniquable a => [a] -> UniqSet a

class Monad m => MonadUnique (m :: Type -> Type) where

A monad for generating unique identifiers

Minimal complete definition

getUniqueSupplyM

Methods

getUniqueM :: m Unique

Get a new unique identifier

Instances

MonadUnique UniqSM

Defined in GHC.Types.Unique.Supply

Methods

getUniqueSupplyM :: UniqSM UniqSupply

getUniqueM :: UniqSM Unique

getUniquesM :: UniqSM [Unique]

data Unique

Unique identifier.

The type of unique identifiers that are used in many places in GHC for fast ordering and equality tests. You should generate these with the functions from the UniqSupply module

These are sometimes also referred to as "keys" in comments in GHC.

Instances

Show Unique

Defined in GHC.Types.Unique

Methods

showsPrec :: Int -> Unique -> ShowS

show :: Unique -> String

showList :: [Unique] -> ShowS

Uniquable Unique

Defined in GHC.Types.Unique

Methods

getUnique :: Unique -> Unique

Outputable Unique

Defined in GHC.Types.Unique

Methods

ppr :: Unique -> SDoc

Eq Unique

Defined in GHC.Types.Unique

Methods

(==) :: Unique -> Unique -> Bool

(/=) :: Unique -> Unique -> Bool

class Uniquable a where

Class of things that we can obtain a Unique from

Methods

getUnique :: a -> Unique

Instances

Uniquable Label

Defined in GHC.Cmm.Dataflow.Label

Methods

getUnique :: Label -> Unique

Uniquable LocalReg

Defined in GHC.Cmm.Expr

Methods

getUnique :: LocalReg -> Unique

Uniquable Class

Defined in GHC.Core.Class

Methods

getUnique :: Class -> Unique

Uniquable CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

getUnique :: CoAxiomRule -> Unique

Uniquable ConLike

Defined in GHC.Core.ConLike

Methods

getUnique :: ConLike -> Unique

Uniquable DataCon

Defined in GHC.Core.DataCon

Methods

getUnique :: DataCon -> Unique

Uniquable PatSyn

Defined in GHC.Core.PatSyn

Methods

getUnique :: PatSyn -> Unique

Uniquable CoercionHole

Defined in GHC.Core.TyCo.Rep

Methods

getUnique :: CoercionHole -> Unique

Uniquable TyCon

Defined in GHC.Core.TyCon

Methods

getUnique :: TyCon -> Unique

Uniquable FastString

Defined in GHC.Types.Unique

Methods

getUnique :: FastString -> Unique

Uniquable EvBindsVar

Defined in GHC.Tc.Types.Evidence

Methods

getUnique :: EvBindsVar -> Unique

Uniquable Name

Defined in GHC.Types.Name

Methods

getUnique :: Name -> Unique

Uniquable OccName

Defined in GHC.Types.Name.Occurrence

Methods

getUnique :: OccName -> Unique

Uniquable Unique

Defined in GHC.Types.Unique

Methods

getUnique :: Unique -> Unique

Uniquable Var

Defined in GHC.Types.Var

Methods

getUnique :: Var -> Unique

Uniquable ModuleName

Defined in GHC.Unit.Module.Name

Methods

getUnique :: ModuleName -> Unique

Uniquable Module

Defined in GHC.Unit.Types

Methods

getUnique :: Module -> Unique

Uniquable UnitId

Defined in GHC.Unit.Types

Methods

getUnique :: UnitId -> Unique

Uniquable Int

Defined in GHC.Types.Unique

Methods

getUnique :: Int -> Unique

Uniquable (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

getUnique :: CoAxiom br -> Unique

Uniquable unit => Uniquable (Definite unit)

Defined in GHC.Unit.Types

Methods

getUnique :: Definite unit -> Unique

IsUnitId u => Uniquable (GenUnit u)

Defined in GHC.Unit.Types

Methods

getUnique :: GenUnit u -> Unique

Uniquable unit => Uniquable (Indefinite unit)

Defined in GHC.Unit.Types

Methods

getUnique :: Indefinite unit -> Unique

mkUnique :: Char -> Int -> Unique

hasKey :: Uniquable a => a -> Unique -> Bool

getKey :: Unique -> Int

data GhcException

GHC's own exception type error messages all take the form:

     <location>: <error>
 

If the location is on the command line, or in GHC itself, then <location>="ghc". All of the error types below correspond to a <location> of "ghc", except for ProgramError (where the string is assumed to contain a location already, so we don't print one).

Constructors

CmdLineError String

A problem with the command line arguments, but don't print usage.

ProgramError String

An error in the user's code, probably.

Instances

Exception GhcException

Defined in GHC.Utils.Panic

Methods

toException :: GhcException -> SomeException

fromException :: SomeException -> Maybe GhcException

displayException :: GhcException -> String

Show GhcException

Defined in GHC.Utils.Panic

Methods

showsPrec :: Int -> GhcException -> ShowS

show :: GhcException -> String

showList :: [GhcException] -> ShowS

throwGhcExceptionIO :: GhcException -> IO a

throwGhcException :: GhcException -> a

type QueryQualifyPackage = Unit -> Bool

For a given package, we need to know whether to print it with the component id to disambiguate it.

type QueryQualifyName = Module -> OccName -> QualifyName

Given a Name's Module and OccName, decide whether and how to qualify it.

type QueryQualifyModule = Module -> Bool

For a given module, we need to know whether to print it with a package name to disambiguate it.

data QualifyName

Constructors

NameUnqual

NameQual ModuleName

NameNotInScope1

NameNotInScope2

Instances

Outputable QualifyName

Defined in GHC.Utils.Outputable

Methods

ppr :: QualifyName -> SDoc

data PrintUnqualified

When printing code that contains original names, we need to map the original names back to something the user understands. This is the purpose of the triple of functions that gets passed around when rendering SDoc.

Constructors

QueryQualify

Fields

• queryQualifyName :: QueryQualifyName
• queryQualifyModule :: QueryQualifyModule
• queryQualifyPackage :: QueryQualifyPackage

newtype PDoc a

Wrapper for types having a Outputable instance when an OutputableP instance is required.

Constructors

PDoc a

Instances

Outputable a => OutputableP env (PDoc a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> PDoc a -> SDoc

class OutputableP env a where

Outputable class with an additional environment value

See Note [The OutputableP class]

Methods

pdoc :: env -> a -> SDoc

Instances

OutputableP env Label

Defined in GHC.Cmm.Dataflow.Label

Methods

pdoc :: env -> Label -> SDoc

OutputableP env Alignment

Defined in GHC.Types.Basic

Methods

pdoc :: env -> Alignment -> SDoc

OutputableP env SDoc

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> SDoc -> SDoc

OutputableP env a => OutputableP env (SCC a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> SCC a -> SDoc

OutputableP env a => OutputableP env (Set a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> Set a -> SDoc

OutputableP env instr => OutputableP env (GenBasicBlock instr)

Defined in GHC.Cmm

Methods

pdoc :: env -> GenBasicBlock instr -> SDoc

OutputableP env instr => OutputableP env (ListGraph instr)

Defined in GHC.Cmm

Methods

pdoc :: env -> ListGraph instr -> SDoc

OutputableP env a => OutputableP env (LabelMap a)

Defined in GHC.Cmm.Dataflow.Label

Methods

pdoc :: env -> LabelMap a -> SDoc

Outputable a => OutputableP env (PDoc a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> PDoc a -> SDoc

OutputableP env a => OutputableP env (Maybe a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> Maybe a -> SDoc

OutputableP env a => OutputableP env [a]

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> [a] -> SDoc

(OutputableP env key, OutputableP env elt) => OutputableP env (Map key elt)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> Map key elt -> SDoc

(OutputableP env a, OutputableP env b) => OutputableP env (a, b)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> (a, b) -> SDoc

(OutputableP env a, OutputableP env b, OutputableP env c) => OutputableP env (a, b, c)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> (a, b, c) -> SDoc

class Outputable a => OutputableBndr a where

When we print a binder, we often want to print its type too. The OutputableBndr class encapsulates this idea.

Minimal complete definition

pprPrefixOcc, pprInfixOcc

Methods

pprBndr :: BindingSite -> a -> SDoc

pprPrefixOcc :: a -> SDoc

pprInfixOcc :: a -> SDoc

bndrIsJoin_maybe :: a -> Maybe Int

Instances

OutputableBndr ConLike

Defined in GHC.Core.ConLike

Methods

pprBndr :: BindingSite -> ConLike -> SDoc

pprPrefixOcc :: ConLike -> SDoc

pprInfixOcc :: ConLike -> SDoc

bndrIsJoin_maybe :: ConLike -> Maybe Int

OutputableBndr DataCon

Defined in GHC.Core.DataCon

Methods

pprBndr :: BindingSite -> DataCon -> SDoc

pprPrefixOcc :: DataCon -> SDoc

pprInfixOcc :: DataCon -> SDoc

bndrIsJoin_maybe :: DataCon -> Maybe Int

OutputableBndr PatSyn

Defined in GHC.Core.PatSyn

Methods

pprBndr :: BindingSite -> PatSyn -> SDoc

pprPrefixOcc :: PatSyn -> SDoc

pprInfixOcc :: PatSyn -> SDoc

bndrIsJoin_maybe :: PatSyn -> Maybe Int

OutputableBndr BinderInfo

Defined in GHC.Stg.Lift.Analysis

Methods

pprBndr :: BindingSite -> BinderInfo -> SDoc

pprPrefixOcc :: BinderInfo -> SDoc

pprInfixOcc :: BinderInfo -> SDoc

bndrIsJoin_maybe :: BinderInfo -> Maybe Int

OutputableBndr Name

Defined in GHC.Types.Name

Methods

pprBndr :: BindingSite -> Name -> SDoc

pprPrefixOcc :: Name -> SDoc

pprInfixOcc :: Name -> SDoc

bndrIsJoin_maybe :: Name -> Maybe Int

OutputableBndr OccName

Defined in GHC.Types.Name.Occurrence

Methods

pprBndr :: BindingSite -> OccName -> SDoc

pprPrefixOcc :: OccName -> SDoc

pprInfixOcc :: OccName -> SDoc

bndrIsJoin_maybe :: OccName -> Maybe Int

OutputableBndr RdrName

Defined in GHC.Types.Name.Reader

Methods

pprBndr :: BindingSite -> RdrName -> SDoc

pprPrefixOcc :: RdrName -> SDoc

pprInfixOcc :: RdrName -> SDoc

bndrIsJoin_maybe :: RdrName -> Maybe Int

OutputableBndr HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> HsIPName -> SDoc

pprPrefixOcc :: HsIPName -> SDoc

pprInfixOcc :: HsIPName -> SDoc

bndrIsJoin_maybe :: HsIPName -> Maybe Int

OutputableBndr name => OutputableBndr (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

pprBndr :: BindingSite -> IEWrappedName name -> SDoc

pprPrefixOcc :: IEWrappedName name -> SDoc

pprInfixOcc :: IEWrappedName name -> SDoc

bndrIsJoin_maybe :: IEWrappedName name -> Maybe Int

OutputableBndr (FieldLabelStrings p)

Defined in Language.Haskell.Syntax.Expr

Methods

pprBndr :: BindingSite -> FieldLabelStrings p -> SDoc

pprPrefixOcc :: FieldLabelStrings p -> SDoc

pprInfixOcc :: FieldLabelStrings p -> SDoc

bndrIsJoin_maybe :: FieldLabelStrings p -> Maybe Int

OutputableBndr (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> FieldOcc pass -> SDoc

pprPrefixOcc :: FieldOcc pass -> SDoc

pprInfixOcc :: FieldOcc pass -> SDoc

bndrIsJoin_maybe :: FieldOcc pass -> Maybe Int

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

class Outputable a where

Class designating that some type has an SDoc representation

Methods

ppr :: a -> SDoc

Instances

Outputable Fingerprint

Defined in GHC.Utils.Outputable

Methods

ppr :: Fingerprint -> SDoc

Outputable Int32

Defined in GHC.Utils.Outputable

Methods

ppr :: Int32 -> SDoc

Outputable Int64

Defined in GHC.Utils.Outputable

Methods

ppr :: Int64 -> SDoc

Outputable Word16

Defined in GHC.Utils.Outputable

Methods

ppr :: Word16 -> SDoc

Outputable Word32

Defined in GHC.Utils.Outputable

Methods

ppr :: Word32 -> SDoc

Outputable Word64

Defined in GHC.Utils.Outputable

Methods

ppr :: Word64 -> SDoc

Outputable IntSet

Defined in GHC.Utils.Outputable

Methods

ppr :: IntSet -> SDoc

Outputable CoreModule

Defined in GHC

Methods

ppr :: CoreModule -> SDoc

Outputable ByteOff

Defined in GHC.ByteCode.Types

Methods

ppr :: ByteOff -> SDoc

Outputable CgBreakInfo

Defined in GHC.ByteCode.Types

Methods

ppr :: CgBreakInfo -> SDoc

Outputable CompiledByteCode

Defined in GHC.ByteCode.Types

Methods

ppr :: CompiledByteCode -> SDoc

Outputable RegBitmap

Defined in GHC.ByteCode.Types

Methods

ppr :: RegBitmap -> SDoc

Outputable TupleInfo

Defined in GHC.ByteCode.Types

Methods

ppr :: TupleInfo -> SDoc

Outputable UnlinkedBCO

Defined in GHC.ByteCode.Types

Methods

ppr :: UnlinkedBCO -> SDoc

Outputable WordOff

Defined in GHC.ByteCode.Types

Methods

ppr :: WordOff -> SDoc

Outputable CmmStatic

Defined in GHC.Cmm

Methods

ppr :: CmmStatic -> SDoc

Outputable Label

Defined in GHC.Cmm.Dataflow.Label

Methods

ppr :: Label -> SDoc

Outputable LabelSet

Defined in GHC.Cmm.Dataflow.Label

Methods

ppr :: LabelSet -> SDoc

Outputable CmmLit

Defined in GHC.Cmm.Expr

Methods

ppr :: CmmLit -> SDoc

Outputable CmmTickScope

Defined in GHC.Cmm.Node

Methods

ppr :: CmmTickScope -> SDoc

Outputable CmmCat

Defined in GHC.Cmm.Type

Methods

ppr :: CmmCat -> SDoc

Outputable CmmType

Defined in GHC.Cmm.Type

Methods

ppr :: CmmType -> SDoc

Outputable Width

Defined in GHC.Cmm.Type

Methods

ppr :: Width -> SDoc

Outputable AltCon

Defined in GHC.Core

Methods

ppr :: AltCon -> SDoc

Outputable Class

Defined in GHC.Core.Class

Methods

ppr :: Class -> SDoc

Outputable LiftingContext

Defined in GHC.Core.Coercion

Methods

ppr :: LiftingContext -> SDoc

Outputable CoAxBranch

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: CoAxBranch -> SDoc

Outputable CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: CoAxiomRule -> SDoc

Outputable Role

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: Role -> SDoc

Outputable ConLike

Defined in GHC.Core.ConLike

Methods

ppr :: ConLike -> SDoc

Outputable DataCon

Defined in GHC.Core.DataCon

Methods

ppr :: DataCon -> SDoc

Outputable EqSpec

Defined in GHC.Core.DataCon

Methods

ppr :: EqSpec -> SDoc

Outputable HsImplBang

Defined in GHC.Core.DataCon

Methods

ppr :: HsImplBang -> SDoc

Outputable HsSrcBang

Defined in GHC.Core.DataCon

Methods

ppr :: HsSrcBang -> SDoc

Outputable SrcStrictness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcStrictness -> SDoc

Outputable SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcUnpackedness -> SDoc

Outputable StrictnessMark

Defined in GHC.Core.DataCon

Methods

ppr :: StrictnessMark -> SDoc

Outputable FamInst

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamInst -> SDoc

Outputable FamInstMatch

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamInstMatch -> SDoc

Outputable FamilyInstEnv

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamilyInstEnv -> SDoc

Outputable ClsInst

Defined in GHC.Core.InstEnv

Methods

ppr :: ClsInst -> SDoc

Outputable ClsInstEnv

Defined in GHC.Core.InstEnv

Methods

ppr :: ClsInstEnv -> SDoc

Outputable FloatBind

Defined in GHC.Core.Make

Methods

ppr :: FloatBind -> SDoc

Outputable CallerCcFilter

Defined in GHC.Core.Opt.CallerCC

Methods

ppr :: CallerCcFilter -> SDoc

Outputable NamePattern

Defined in GHC.Core.Opt.CallerCC

Methods

ppr :: NamePattern -> SDoc

Outputable Details

Defined in GHC.Core.Opt.OccurAnal

Methods

ppr :: Details -> SDoc

Outputable OccEncl

Defined in GHC.Core.Opt.OccurAnal

Methods

ppr :: OccEncl -> SDoc

Outputable UsageDetails

Defined in GHC.Core.Opt.OccurAnal

Methods

ppr :: UsageDetails -> SDoc

Outputable PatSyn

Defined in GHC.Core.PatSyn

Methods

ppr :: PatSyn -> SDoc

Outputable EqRel

Defined in GHC.Core.Predicate

Methods

ppr :: EqRel -> SDoc

Outputable Subst

Defined in GHC.Core.Subst

Methods

ppr :: Subst -> SDoc

Outputable Coercion

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Coercion -> SDoc

Outputable CoercionHole

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: CoercionHole -> SDoc

Outputable MCoercion

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: MCoercion -> SDoc

Outputable TyCoBinder

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: TyCoBinder -> SDoc

Outputable TyLit

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: TyLit -> SDoc

Outputable Type

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Type -> SDoc

Outputable UnivCoProvenance

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: UnivCoProvenance -> SDoc

Outputable TCvSubst

Defined in GHC.Core.TyCo.Subst

Methods

ppr :: TCvSubst -> SDoc

Outputable AlgTyConFlav

Defined in GHC.Core.TyCon

Methods

ppr :: AlgTyConFlav -> SDoc

Outputable FamTyConFlav

Defined in GHC.Core.TyCon

Methods

ppr :: FamTyConFlav -> SDoc

Outputable PrimElemRep

Defined in GHC.Core.TyCon

Methods

ppr :: PrimElemRep -> SDoc

Outputable PrimRep

Defined in GHC.Core.TyCon

Methods

ppr :: PrimRep -> SDoc

Outputable TyCon

Defined in GHC.Core.TyCon

Methods

ppr :: TyCon -> SDoc

Outputable TyConBndrVis

Defined in GHC.Core.TyCon

Methods

ppr :: TyConBndrVis -> SDoc

Outputable TyConFlavour

Defined in GHC.Core.TyCon

Methods

ppr :: TyConFlavour -> SDoc

Outputable ArgSummary

Defined in GHC.Core.Unfold

Methods

ppr :: ArgSummary -> SDoc

Outputable CallCtxt

Defined in GHC.Core.Unfold

Methods

ppr :: CallCtxt -> SDoc

Outputable ExprSize

Defined in GHC.Core.Unfold

Methods

ppr :: ExprSize -> SDoc

Outputable MaybeApartReason

Defined in GHC.Core.Unify

Methods

ppr :: MaybeApartReason -> SDoc

Outputable FastString

Defined in GHC.Utils.Outputable

Methods

ppr :: FastString -> SDoc

Outputable LexicalFastString

Defined in GHC.Utils.Outputable

Methods

ppr :: LexicalFastString -> SDoc

Outputable NonDetFastString

Defined in GHC.Utils.Outputable

Methods

ppr :: NonDetFastString -> SDoc

Outputable Language

Defined in GHC.Driver.Flags

Methods

ppr :: Language -> SDoc

Outputable WarnReason

Defined in GHC.Driver.Flags

Methods

ppr :: WarnReason -> SDoc

Outputable Phase

Defined in GHC.Driver.Phases

Methods

ppr :: Phase -> SDoc

Outputable PluginRecompile

Defined in GHC.Driver.Plugins

Methods

ppr :: PluginRecompile -> SDoc

Outputable GhcMode

Defined in GHC.Driver.Session

Methods

ppr :: GhcMode -> SDoc

Outputable ModRenaming

Defined in GHC.Driver.Session

Methods

ppr :: ModRenaming -> SDoc

Outputable PackageArg

Defined in GHC.Driver.Session

Methods

ppr :: PackageArg -> SDoc

Outputable PackageFlag

Defined in GHC.Driver.Session

Methods

ppr :: PackageFlag -> SDoc

Outputable HsModule

Defined in GHC.Hs

Methods

ppr :: HsModule -> SDoc

Outputable XViaStrategyPs

Defined in GHC.Hs.Decls

Methods

ppr :: XViaStrategyPs -> SDoc

Outputable ArgDocMap

Defined in GHC.Hs.Doc

Methods

ppr :: ArgDocMap -> SDoc

Outputable DeclDocMap

Defined in GHC.Hs.Doc

Methods

ppr :: DeclDocMap -> SDoc

Outputable HsDocString

Defined in GHC.Hs.Doc

Methods

ppr :: HsDocString -> SDoc

Outputable GrhsAnn

Defined in GHC.Hs.Expr

Methods

ppr :: GrhsAnn -> SDoc

Outputable PendingRnSplice

Defined in GHC.Hs.Expr

Methods

ppr :: PendingRnSplice -> SDoc

Outputable PendingTcSplice

Defined in GHC.Hs.Expr

Methods

ppr :: PendingTcSplice -> SDoc

Outputable SyntaxExprRn

Defined in GHC.Hs.Expr

Methods

ppr :: SyntaxExprRn -> SDoc

Outputable SyntaxExprTc

Defined in GHC.Hs.Expr

Methods

ppr :: SyntaxExprTc -> SDoc

Outputable DsMatchContext

Defined in GHC.HsToCore.Monad

Methods

ppr :: DsMatchContext -> SDoc

Outputable EquationInfo

Defined in GHC.HsToCore.Monad

Methods

ppr :: EquationInfo -> SDoc

Outputable IfaceAT

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceAT -> SDoc

Outputable IfaceAnnotation

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceAnnotation -> SDoc

Outputable IfaceClassOp

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceClassOp -> SDoc

Outputable IfaceClsInst

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceClsInst -> SDoc

Outputable IfaceCompleteMatch

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceCompleteMatch -> SDoc

Outputable IfaceConAlt

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceConAlt -> SDoc

Outputable IfaceDecl

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceDecl -> SDoc

Outputable IfaceExpr

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceExpr -> SDoc

Outputable IfaceFamInst

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceFamInst -> SDoc

Outputable IfaceIdDetails

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceIdDetails -> SDoc

Outputable IfaceInfoItem

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceInfoItem -> SDoc

Outputable IfaceJoinInfo

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceJoinInfo -> SDoc

Outputable IfaceLFInfo

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceLFInfo -> SDoc

Outputable IfaceRule

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceRule -> SDoc

Outputable IfaceTyConParent

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceTyConParent -> SDoc

Outputable IfaceUnfolding

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceUnfolding -> SDoc

Outputable ShowHowMuch

Defined in GHC.Iface.Syntax

Methods

ppr :: ShowHowMuch -> SDoc

Outputable Linkable

Defined in GHC.Linker.Types

Methods

ppr :: Linkable -> SDoc

Outputable SptEntry

Defined in GHC.Linker.Types

Methods

ppr :: SptEntry -> SDoc

Outputable Unlinked

Defined in GHC.Linker.Types

Methods

ppr :: Unlinked -> SDoc

Outputable AddEpAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: AddEpAnn -> SDoc

Outputable Anchor

Defined in GHC.Parser.Annotation

Methods

ppr :: Anchor -> SDoc

Outputable AnchorOperation

Defined in GHC.Parser.Annotation

Methods

ppr :: AnchorOperation -> SDoc

Outputable AnnContext

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnContext -> SDoc

Outputable AnnKeywordId

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnKeywordId -> SDoc

Outputable AnnList

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnList -> SDoc

Outputable AnnListItem

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnListItem -> SDoc

Outputable AnnPragma

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnPragma -> SDoc

Outputable AnnSortKey

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnSortKey -> SDoc

Outputable DeltaPos

Defined in GHC.Parser.Annotation

Methods

ppr :: DeltaPos -> SDoc

Outputable EpAnnComments

Defined in GHC.Parser.Annotation

Methods

ppr :: EpAnnComments -> SDoc

Outputable EpaComment

Defined in GHC.Parser.Annotation

Methods

ppr :: EpaComment -> SDoc

Outputable EpaLocation

Defined in GHC.Parser.Annotation

Methods

ppr :: EpaLocation -> SDoc

Outputable IsUnicodeSyntax

Defined in GHC.Parser.Annotation

Methods

ppr :: IsUnicodeSyntax -> SDoc

Outputable NameAdornment

Defined in GHC.Parser.Annotation

Methods

ppr :: NameAdornment -> SDoc

Outputable NameAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: NameAnn -> SDoc

Outputable TrailingAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: TrailingAnn -> SDoc

Outputable Token

Defined in GHC.Parser.Lexer

Methods

ppr :: Token -> SDoc

Outputable DataConBuilder

Defined in GHC.Parser.Types

Methods

ppr :: DataConBuilder -> SDoc

Outputable MonadNames

Defined in GHC.Rename.Expr

Methods

ppr :: MonadNames -> SDoc

Outputable InteractiveImport

Defined in GHC.Runtime.Context

Methods

ppr :: InteractiveImport -> SDoc

Outputable GetDocsFailure

Defined in GHC.Runtime.Eval

Methods

ppr :: GetDocsFailure -> SDoc

Outputable BinderInfo

Defined in GHC.Stg.Lift.Analysis

Methods

ppr :: BinderInfo -> SDoc

Outputable Skeleton

Defined in GHC.Stg.Lift.Analysis

Methods

ppr :: Skeleton -> SDoc

Outputable AltType

Defined in GHC.Stg.Syntax

Methods

ppr :: AltType -> SDoc

Outputable ConstructorNumber

Defined in GHC.Stg.Syntax

Methods

ppr :: ConstructorNumber -> SDoc

Outputable NoExtFieldSilent

Defined in GHC.Stg.Syntax

Methods

ppr :: NoExtFieldSilent -> SDoc

Outputable StgArg

Defined in GHC.Stg.Syntax

Methods

ppr :: StgArg -> SDoc

Outputable UpdateFlag

Defined in GHC.Stg.Syntax

Methods

ppr :: UpdateFlag -> SDoc

Outputable ArgDescr

Defined in GHC.StgToCmm.Types

Methods

ppr :: ArgDescr -> SDoc

Outputable LambdaFormInfo

Defined in GHC.StgToCmm.Types

Methods

ppr :: LambdaFormInfo -> SDoc

Outputable StandardFormInfo

Defined in GHC.StgToCmm.Types

Methods

ppr :: StandardFormInfo -> SDoc

Outputable HoleFit

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

ppr :: HoleFit -> SDoc

Outputable HoleFitCandidate

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

ppr :: HoleFitCandidate -> SDoc

Outputable TypedHole

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

ppr :: TypedHole -> SDoc

Outputable GeneralisationPlan

Defined in GHC.Tc.Gen.Bind

Methods

ppr :: GeneralisationPlan -> SDoc

Outputable InferMode

Defined in GHC.Tc.Solver

Methods

ppr :: InferMode -> SDoc

Outputable IdBindingInfo

Defined in GHC.Tc.Types

Methods

ppr :: IdBindingInfo -> SDoc

Outputable PromotionErr

Defined in GHC.Tc.Types

Methods

ppr :: PromotionErr -> SDoc

Outputable TcBinder

Defined in GHC.Tc.Types

Methods

ppr :: TcBinder -> SDoc

Outputable TcIdSigInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcIdSigInfo -> SDoc

Outputable TcIdSigInst

Defined in GHC.Tc.Types

Methods

ppr :: TcIdSigInst -> SDoc

Outputable TcPatSynInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcPatSynInfo -> SDoc

Outputable TcSigInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcSigInfo -> SDoc

Outputable TcTyThing

Defined in GHC.Tc.Types

Methods

ppr :: TcTyThing -> SDoc

Outputable ThStage

Defined in GHC.Tc.Types

Methods

ppr :: ThStage -> SDoc

Outputable WhereFrom

Defined in GHC.Tc.Types

Methods

ppr :: WhereFrom -> SDoc

Outputable CanEqLHS

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CanEqLHS -> SDoc

Outputable CheckTyEqResult

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CheckTyEqResult -> SDoc

Outputable Ct

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Ct -> SDoc

Outputable CtEvidence

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtEvidence -> SDoc

Outputable CtFlavour

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtFlavour -> SDoc

Outputable CtIrredReason

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtIrredReason -> SDoc

Outputable HasGivenEqs

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: HasGivenEqs -> SDoc

Outputable Hole

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Hole -> SDoc

Outputable HoleSort

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: HoleSort -> SDoc

Outputable ImplicStatus

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: ImplicStatus -> SDoc

Outputable Implication

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Implication -> SDoc

Outputable QCInst

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: QCInst -> SDoc

Outputable SubGoalDepth

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: SubGoalDepth -> SDoc

Outputable TcEvDest

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: TcEvDest -> SDoc

Outputable WantedConstraints

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: WantedConstraints -> SDoc

Outputable EvBind

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBind -> SDoc

Outputable EvBindMap

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBindMap -> SDoc

Outputable EvBindsVar

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBindsVar -> SDoc

Outputable EvCallStack

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvCallStack -> SDoc

Outputable EvTerm

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvTerm -> SDoc

Outputable EvTypeable

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvTypeable -> SDoc

Outputable HoleExprRef

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: HoleExprRef -> SDoc

Outputable HsWrapper

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: HsWrapper -> SDoc

Outputable TcEvBinds

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: TcEvBinds -> SDoc

Outputable CtOrigin

Defined in GHC.Tc.Types.Origin

Methods

ppr :: CtOrigin -> SDoc

Outputable SkolemInfo

Defined in GHC.Tc.Types.Origin

Methods

ppr :: SkolemInfo -> SDoc

Outputable IsExtraConstraint

Defined in GHC.Tc.Utils.Monad

Methods

ppr :: IsExtraConstraint -> SDoc

Outputable ExpType

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: ExpType -> SDoc

Outputable InferResult

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: InferResult -> SDoc

Outputable MetaDetails

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: MetaDetails -> SDoc

Outputable MetaInfo

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: MetaInfo -> SDoc

Outputable TcLevel

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: TcLevel -> SDoc

Outputable TcTyVarDetails

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: TcTyVarDetails -> SDoc

Outputable ZonkEnv

Defined in GHC.Tc.Utils.Zonk

Methods

ppr :: ZonkEnv -> SDoc

Outputable Annotation

Defined in GHC.Types.Annotations

Methods

ppr :: Annotation -> SDoc

Outputable AvailInfo

Defined in GHC.Types.Avail

Methods

ppr :: AvailInfo -> SDoc

Outputable GreName

Defined in GHC.Types.Avail

Methods

ppr :: GreName -> SDoc

Outputable Activation

Defined in GHC.Types.Basic

Methods

ppr :: Activation -> SDoc

Outputable Alignment

Defined in GHC.Types.Basic

Methods

ppr :: Alignment -> SDoc

Outputable Boxity

Defined in GHC.Types.Basic

Methods

ppr :: Boxity -> SDoc

Outputable CompilerPhase

Defined in GHC.Types.Basic

Methods

ppr :: CompilerPhase -> SDoc

Outputable FunctionOrData

Defined in GHC.Types.Basic

Methods

ppr :: FunctionOrData -> SDoc

Outputable InlinePragma

Defined in GHC.Types.Basic

Methods

ppr :: InlinePragma -> SDoc

Outputable InlineSpec

Defined in GHC.Types.Basic

Methods

ppr :: InlineSpec -> SDoc

Outputable IntWithInf

Defined in GHC.Types.Basic

Methods

ppr :: IntWithInf -> SDoc

Outputable LeftOrRight

Defined in GHC.Types.Basic

Methods

ppr :: LeftOrRight -> SDoc

Outputable OccInfo

Defined in GHC.Types.Basic

Methods

ppr :: OccInfo -> SDoc

Outputable OneShotInfo

Defined in GHC.Types.Basic

Methods

ppr :: OneShotInfo -> SDoc

Outputable Origin

Defined in GHC.Types.Basic

Methods

ppr :: Origin -> SDoc

Outputable OverlapFlag

Defined in GHC.Types.Basic

Methods

ppr :: OverlapFlag -> SDoc

Outputable OverlapMode

Defined in GHC.Types.Basic

Methods

ppr :: OverlapMode -> SDoc

Outputable PromotionFlag

Defined in GHC.Types.Basic

Methods

ppr :: PromotionFlag -> SDoc

Outputable RecFlag

Defined in GHC.Types.Basic

Methods

ppr :: RecFlag -> SDoc

Outputable RuleMatchInfo

Defined in GHC.Types.Basic

Methods

ppr :: RuleMatchInfo -> SDoc

Outputable SuccessFlag

Defined in GHC.Types.Basic

Methods

ppr :: SuccessFlag -> SDoc

Outputable SwapFlag

Defined in GHC.Types.Basic

Methods

ppr :: SwapFlag -> SDoc

Outputable TailCallInfo

Defined in GHC.Types.Basic

Methods

ppr :: TailCallInfo -> SDoc

Outputable TopLevelFlag

Defined in GHC.Types.Basic

Methods

ppr :: TopLevelFlag -> SDoc

Outputable TupleSort

Defined in GHC.Types.Basic

Methods

ppr :: TupleSort -> SDoc

Outputable TypeOrKind

Defined in GHC.Types.Basic

Methods

ppr :: TypeOrKind -> SDoc

Outputable CompleteMatch

Defined in GHC.Types.CompleteMatch

Methods

ppr :: CompleteMatch -> SDoc

Outputable CostCentre

Defined in GHC.Types.CostCentre

Methods

ppr :: CostCentre -> SDoc

Outputable CostCentreStack

Defined in GHC.Types.CostCentre

Methods

ppr :: CostCentreStack -> SDoc

Outputable Cpr

BNF: ``` cpr ::= '' -- TopCpr | n -- FlatConCpr n | n '(' cpr1 ',' cpr2 ',' ... ')' -- ConCpr n [cpr1,cpr2,...] | b -- BotCpr ``` Examples: * `f x = f x` has denotation b * `1(1,)` is a valid (nested) Cpr denotation for `(I# 42#, f 42)`.

Defined in GHC.Types.Cpr

Methods

ppr :: Cpr -> SDoc

Outputable CprSig

Only print the CPR result

Defined in GHC.Types.Cpr

Methods

ppr :: CprSig -> SDoc

Outputable CprType

Defined in GHC.Types.Cpr

Methods

ppr :: CprType -> SDoc

Outputable Card

See Note [Demand notation] Current syntax was discussed in #19016.

Defined in GHC.Types.Demand

Methods

ppr :: Card -> SDoc

Outputable Demand

See Note [Demand notation]

Defined in GHC.Types.Demand

Methods

ppr :: Demand -> SDoc

Outputable Divergence

Defined in GHC.Types.Demand

Methods

ppr :: Divergence -> SDoc

Outputable DmdType

Defined in GHC.Types.Demand

Methods

ppr :: DmdType -> SDoc

Outputable StrictSig

Defined in GHC.Types.Demand

Methods

ppr :: StrictSig -> SDoc

Outputable SubDemand

See Note [Demand notation]

Defined in GHC.Types.Demand

Methods

ppr :: SubDemand -> SDoc

Outputable TypeShape

Defined in GHC.Types.Demand

Methods

ppr :: TypeShape -> SDoc

Outputable DuplicateRecordFields

Defined in GHC.Types.FieldLabel

Methods

ppr :: DuplicateRecordFields -> SDoc

Outputable FieldLabel

Defined in GHC.Types.FieldLabel

Methods

ppr :: FieldLabel -> SDoc

Outputable FieldSelectors

Defined in GHC.Types.FieldLabel

Methods

ppr :: FieldSelectors -> SDoc

Outputable Fixity

Defined in GHC.Types.Fixity

Methods

ppr :: Fixity -> SDoc

Outputable FixityDirection

Defined in GHC.Types.Fixity

Methods

ppr :: FixityDirection -> SDoc

Outputable LexicalFixity

Defined in GHC.Types.Fixity

Methods

ppr :: LexicalFixity -> SDoc

Outputable FixItem

Defined in GHC.Types.Fixity.Env

Methods

ppr :: FixItem -> SDoc

Outputable CCallConv

Defined in GHC.Types.ForeignCall

Methods

ppr :: CCallConv -> SDoc

Outputable CCallSpec

Defined in GHC.Types.ForeignCall

Methods

ppr :: CCallSpec -> SDoc

Outputable CExportSpec

Defined in GHC.Types.ForeignCall

Methods

ppr :: CExportSpec -> SDoc

Outputable CType

Defined in GHC.Types.ForeignCall

Methods

ppr :: CType -> SDoc

Outputable ForeignCall

Defined in GHC.Types.ForeignCall

Methods

ppr :: ForeignCall -> SDoc

Outputable Header

Defined in GHC.Types.ForeignCall

Methods

ppr :: Header -> SDoc

Outputable Safety

Defined in GHC.Types.ForeignCall

Methods

ppr :: Safety -> SDoc

Outputable CafInfo

Defined in GHC.Types.Id.Info

Methods

ppr :: CafInfo -> SDoc

Outputable IdDetails

Defined in GHC.Types.Id.Info

Methods

ppr :: IdDetails -> SDoc

Outputable LevityInfo

Defined in GHC.Types.Id.Info

Methods

ppr :: LevityInfo -> SDoc

Outputable RecSelParent

Defined in GHC.Types.Id.Info

Methods

ppr :: RecSelParent -> SDoc

Outputable TickBoxOp

Defined in GHC.Types.Id.Info

Methods

ppr :: TickBoxOp -> SDoc

Outputable Literal

Defined in GHC.Types.Literal

Methods

ppr :: Literal -> SDoc

Outputable Name

Defined in GHC.Types.Name

Methods

ppr :: Name -> SDoc

Outputable NameSort

Defined in GHC.Types.Name

Methods

ppr :: NameSort -> SDoc

Outputable OccName

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccName -> SDoc

Outputable GlobalRdrElt

Defined in GHC.Types.Name.Reader

Methods

ppr :: GlobalRdrElt -> SDoc

Outputable ImportSpec

Defined in GHC.Types.Name.Reader

Methods

ppr :: ImportSpec -> SDoc

Outputable LocalRdrEnv

Defined in GHC.Types.Name.Reader

Methods

ppr :: LocalRdrEnv -> SDoc

Outputable Parent

Defined in GHC.Types.Name.Reader

Methods

ppr :: Parent -> SDoc

Outputable RdrName

Defined in GHC.Types.Name.Reader

Methods

ppr :: RdrName -> SDoc

Outputable IfaceTrustInfo

Defined in GHC.Types.SafeHaskell

Methods

ppr :: IfaceTrustInfo -> SDoc

Outputable SafeHaskellMode

Defined in GHC.Types.SafeHaskell

Methods

ppr :: SafeHaskellMode -> SDoc

Outputable FractionalLit

Defined in GHC.Types.SourceText

Methods

ppr :: FractionalLit -> SDoc

Outputable IntegralLit

Defined in GHC.Types.SourceText

Methods

ppr :: IntegralLit -> SDoc

Outputable SourceText

Defined in GHC.Types.SourceText

Methods

ppr :: SourceText -> SDoc

Outputable StringLiteral

Defined in GHC.Types.SourceText

Methods

ppr :: StringLiteral -> SDoc

Outputable RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcLoc -> SDoc

Outputable RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcSpan -> SDoc

Outputable SrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcLoc -> SDoc

Outputable SrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcSpan -> SDoc

Outputable UnhelpfulSpanReason

Defined in GHC.Types.SrcLoc

Methods

ppr :: UnhelpfulSpanReason -> SDoc

Outputable Target

Defined in GHC.Types.Target

Methods

ppr :: Target -> SDoc

Outputable TargetId

Defined in GHC.Types.Target

Methods

ppr :: TargetId -> SDoc

Outputable TyThing

Defined in GHC.Types.TyThing

Methods

ppr :: TyThing -> SDoc

Outputable Unique

Defined in GHC.Types.Unique

Methods

ppr :: Unique -> SDoc

Outputable AnonArgFlag

Defined in GHC.Types.Var

Methods

ppr :: AnonArgFlag -> SDoc

Outputable ArgFlag

Defined in GHC.Types.Var

Methods

ppr :: ArgFlag -> SDoc

Outputable Var

Defined in GHC.Types.Var

Methods

ppr :: Var -> SDoc

Outputable InScopeSet

Defined in GHC.Types.Var.Env

Methods

ppr :: InScopeSet -> SDoc

Outputable ModuleGraphNode

Defined in GHC.Unit.Module.Graph

Methods

ppr :: ModuleGraphNode -> SDoc

Outputable ModLocation

Defined in GHC.Unit.Module.Location

Methods

ppr :: ModLocation -> SDoc

Outputable ExtendedModSummary

Defined in GHC.Unit.Module.ModSummary

Methods

ppr :: ExtendedModSummary -> SDoc

Outputable ModSummary

Defined in GHC.Unit.Module.ModSummary

Methods

ppr :: ModSummary -> SDoc

Outputable ModuleName

Defined in GHC.Unit.Module.Name

Methods

ppr :: ModuleName -> SDoc

Outputable WarningTxt

Defined in GHC.Unit.Module.Warnings

Methods

ppr :: WarningTxt -> SDoc

Outputable ModuleOrigin

Defined in GHC.Unit.State

Methods

ppr :: ModuleOrigin -> SDoc

Outputable UnitErr

Defined in GHC.Unit.State

Methods

ppr :: UnitErr -> SDoc

Outputable UnitVisibility

Defined in GHC.Unit.State

Methods

ppr :: UnitVisibility -> SDoc

Outputable UnusableUnitReason

Defined in GHC.Unit.State

Methods

ppr :: UnusableUnitReason -> SDoc

Outputable InstalledModule

Defined in GHC.Unit.Types

Methods

ppr :: InstalledModule -> SDoc

Outputable InstantiatedModule

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedModule -> SDoc

Outputable InstantiatedUnit

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedUnit -> SDoc

Outputable Module

Defined in GHC.Unit.Types

Methods

ppr :: Module -> SDoc

Outputable Unit

Defined in GHC.Unit.Types

Methods

ppr :: Unit -> SDoc

Outputable UnitId

Defined in GHC.Unit.Types

Methods

ppr :: UnitId -> SDoc

Outputable PprStyle

Defined in GHC.Utils.Outputable

Methods

ppr :: PprStyle -> SDoc

Outputable QualifyName

Defined in GHC.Utils.Outputable

Methods

ppr :: QualifyName -> SDoc

Outputable SDoc

Defined in GHC.Utils.Outputable

Methods

ppr :: SDoc -> SDoc

Outputable DocDecl

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: DocDecl -> SDoc

Outputable ForeignExport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignExport -> SDoc

Outputable ForeignImport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignImport -> SDoc

Outputable NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: NewOrData -> SDoc

Outputable SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: SpliceDecoration -> SDoc

Outputable NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

ppr :: NoExtCon -> SDoc

Outputable NoExtField

Defined in Language.Haskell.Syntax.Extension

Methods

ppr :: NoExtField -> SDoc

Outputable OverLitVal

Defined in Language.Haskell.Syntax.Lit

Methods

ppr :: OverLitVal -> SDoc

Outputable HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsIPName -> SDoc

Outputable HsTyLit

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsTyLit -> SDoc

Outputable Serialized

Defined in GHC.Utils.Outputable

Methods

ppr :: Serialized -> SDoc

Outputable Extension

Defined in GHC.Utils.Outputable

Methods

ppr :: Extension -> SDoc

Outputable Ordering

Defined in GHC.Utils.Outputable

Methods

ppr :: Ordering -> SDoc

Outputable HashableType

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

ppr :: HashableType -> SDoc

Outputable OccurrenceMap

Defined in Language.Haskell.Liquid.GHC.Play

Methods

ppr :: OccurrenceMap -> SDoc

Outputable TyConOccurrence

Defined in Language.Haskell.Liquid.GHC.Play

Methods

ppr :: TyConOccurrence -> SDoc

Outputable Integer

Defined in GHC.Utils.Outputable

Methods

ppr :: Integer -> SDoc

Outputable ()

Defined in GHC.Utils.Outputable

Methods

ppr :: () -> SDoc

Outputable Bool

Defined in GHC.Utils.Outputable

Methods

ppr :: Bool -> SDoc

Outputable Char

Defined in GHC.Utils.Outputable

Methods

ppr :: Char -> SDoc

Outputable Double

Defined in GHC.Utils.Outputable

Methods

ppr :: Double -> SDoc

Outputable Float

Defined in GHC.Utils.Outputable

Methods

ppr :: Float -> SDoc

Outputable Int

Defined in GHC.Utils.Outputable

Methods

ppr :: Int -> SDoc

Outputable Word

Defined in GHC.Utils.Outputable

Methods

ppr :: Word -> SDoc

Outputable a => Outputable (SCC a)

Defined in GHC.Utils.Outputable

Methods

ppr :: SCC a -> SDoc

Outputable elt => Outputable (IntMap elt)

Defined in GHC.Utils.Outputable

Methods

ppr :: IntMap elt -> SDoc

Outputable a => Outputable (Set a)

Defined in GHC.Utils.Outputable

Methods

ppr :: Set a -> SDoc

Outputable instr => Outputable (GenBasicBlock instr)

Defined in GHC.Cmm

Methods

ppr :: GenBasicBlock instr -> SDoc

Outputable instr => Outputable (ListGraph instr)

Defined in GHC.Cmm

Methods

ppr :: ListGraph instr -> SDoc

Outputable a => Outputable (LabelMap a)

Defined in GHC.Cmm.Dataflow.Label

Methods

ppr :: LabelMap a -> SDoc

Outputable b => Outputable (TaggedBndr b)

Defined in GHC.Core

Methods

ppr :: TaggedBndr b -> SDoc

Outputable ev => Outputable (NormaliseStepResult ev)

Defined in GHC.Core.Coercion

Methods

ppr :: NormaliseStepResult ev -> SDoc

Outputable (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: CoAxiom br -> SDoc

Outputable a => Outputable (CoreMap a)

Defined in GHC.Core.Map.Expr

Methods

ppr :: CoreMap a -> SDoc

Outputable a => Outputable (TypeMapG a)

Defined in GHC.Core.Map.Type

Methods

ppr :: TypeMapG a -> SDoc

Outputable a => Outputable (Scaled a)

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Scaled a -> SDoc

Outputable a => Outputable (UnifyResultM a)

Defined in GHC.Core.Unify

Methods

ppr :: UnifyResultM a -> SDoc

Outputable a => Outputable (Bag a)

Defined in GHC.Data.Bag

Methods

ppr :: Bag a -> SDoc

Outputable a => Outputable (Pair a)

Defined in GHC.Data.Pair

Methods

ppr :: Pair a -> SDoc

Outputable a => Outputable (OnOff a)

Defined in GHC.Driver.Session

Methods

ppr :: OnOff a -> SDoc

OutputableBndrId p => Outputable (IE (GhcPass p))

Defined in GHC.Hs.ImpExp

Methods

ppr :: IE (GhcPass p) -> SDoc

OutputableBndr name => Outputable (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

ppr :: IEWrappedName name -> SDoc

(OutputableBndrId p, Outputable (Anno (IE (GhcPass p)))) => Outputable (ImportDecl (GhcPass p))

Defined in GHC.Hs.ImpExp

Methods

ppr :: ImportDecl (GhcPass p) -> SDoc

Outputable a => Outputable (EpAnn a)

Defined in GHC.Parser.Annotation

Methods

ppr :: EpAnn a -> SDoc

Outputable a => Outputable (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

ppr :: SrcSpanAnn' a -> SDoc

Outputable (PatBuilder GhcPs)

Defined in GHC.Parser.Types

Methods

ppr :: PatBuilder GhcPs -> SDoc

Outputable a => Outputable (StmtTree a)

Defined in GHC.Rename.Expr

Methods

ppr :: StmtTree a -> SDoc

OutputableBndrId a => Outputable (InstInfo (GhcPass a))

Defined in GHC.Tc.Utils.Env

Methods

ppr :: InstInfo (GhcPass a) -> SDoc

Outputable name => Outputable (AnnTarget name)

Defined in GHC.Types.Annotations

Methods

ppr :: AnnTarget name -> SDoc

Outputable (DefMethSpec ty)

Defined in GHC.Types.Basic

Methods

ppr :: DefMethSpec ty -> SDoc

Outputable a => Outputable (OccEnv a)

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccEnv a -> SDoc

Outputable e => Outputable (Located e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: Located e -> SDoc

Outputable a => Outputable (UniqDSet a)

Defined in GHC.Types.Unique.DSet

Methods

ppr :: UniqDSet a -> SDoc

Outputable a => Outputable (UniqSet a)

Defined in GHC.Types.Unique.Set

Methods

ppr :: UniqSet a -> SDoc

Outputable unit => Outputable (Definite unit)

Defined in GHC.Unit.Types

Methods

ppr :: Definite unit -> SDoc

Outputable a => Outputable (GenWithIsBoot a)

Defined in GHC.Unit.Types

Methods

ppr :: GenWithIsBoot a -> SDoc

Outputable unit => Outputable (Indefinite unit)

Defined in GHC.Unit.Types

Methods

ppr :: Indefinite unit -> SDoc

Outputable (RecordPatSynField a)

Defined in Language.Haskell.Syntax.Binds

Methods

ppr :: RecordPatSynField a -> SDoc

Outputable (FamilyInfo pass)

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: FamilyInfo pass -> SDoc

Outputable (FieldLabelStrings p)

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: FieldLabelStrings p -> SDoc

Outputable (HsFieldLabel p)

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: HsFieldLabel p -> SDoc

Outputable (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: FieldOcc pass -> SDoc

Outputable a => Outputable (HashSet a)

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

ppr :: HashSet a -> SDoc

Outputable a => Outputable (NonEmpty a)

Defined in GHC.Utils.Outputable

Methods

ppr :: NonEmpty a -> SDoc

Outputable a => Outputable (Maybe a)

Defined in GHC.Utils.Outputable

Methods

ppr :: Maybe a -> SDoc

Outputable a => Outputable [a]

Defined in GHC.Utils.Outputable

Methods

ppr :: [a] -> SDoc

(Outputable a, Outputable b) => Outputable (Either a b)

Defined in GHC.Utils.Outputable

Methods

ppr :: Either a b -> SDoc

(Outputable key, Outputable elt) => Outputable (Map key elt)

Defined in GHC.Utils.Outputable

Methods

ppr :: Map key elt -> SDoc

(Outputable a, Outputable (m a)) => Outputable (GenMap m a)

Defined in GHC.Data.TrieMap

Methods

ppr :: GenMap m a -> SDoc

(TrieMap m, Outputable a) => Outputable (ListMap m a)

Defined in GHC.Data.TrieMap

Methods

ppr :: ListMap m a -> SDoc

(Outputable a, Outputable b) => Outputable (HsExpansion a b)

Just print the original expression (the a).

Defined in GHC.Hs.Expr

Methods

ppr :: HsExpansion a b -> SDoc

Outputable (GenLocated Anchor EpaComment)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated Anchor EpaComment -> SDoc

(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc

Outputable e => Outputable (GenLocated RealSrcSpan e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: GenLocated RealSrcSpan e -> SDoc

Outputable a => Outputable (UniqDFM key a)

Defined in GHC.Types.Unique.DFM

Methods

ppr :: UniqDFM key a -> SDoc

Outputable a => Outputable (UniqFM key a)

Defined in GHC.Types.Unique.FM

Methods

ppr :: UniqFM key a -> SDoc

OutputableBndr tv => Outputable (VarBndr tv TyConBndrVis)

Defined in GHC.Core.TyCon

Methods

ppr :: VarBndr tv TyConBndrVis -> SDoc

Outputable tv => Outputable (VarBndr tv ArgFlag)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv ArgFlag -> SDoc

Outputable tv => Outputable (VarBndr tv Specificity)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv Specificity -> SDoc

(Outputable p, OutputableBndr p, Outputable arg) => Outputable (HsRecField' p arg)

Defined in Language.Haskell.Syntax.Pat

Methods

ppr :: HsRecField' p arg -> SDoc

(Outputable arg, Outputable (XRec p (HsRecField p arg))) => Outputable (HsRecFields p arg)

Defined in Language.Haskell.Syntax.Pat

Methods

ppr :: HsRecFields p arg -> SDoc

(Outputable tm, Outputable ty) => Outputable (HsArg tm ty)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsArg tm ty -> SDoc

Outputable a => Outputable (HsScaled pass a)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsScaled pass a -> SDoc

(Outputable a, Outputable b) => Outputable (a, b)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b) -> SDoc

(Outputable tyarg, Outputable arg, Outputable rec) => Outputable (HsConDetails tyarg arg rec)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsConDetails tyarg arg rec -> SDoc

(Outputable a, Outputable b, Outputable c) => Outputable (a, b, c)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c) -> SDoc

(Outputable a, Outputable b, Outputable c, Outputable d) => Outputable (a, b, c, d)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c, d) -> SDoc

(Outputable a, Outputable b, Outputable c, Outputable d, Outputable e) => Outputable (a, b, c, d, e)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c, d, e) -> SDoc

(Outputable a, Outputable b, Outputable c, Outputable d, Outputable e, Outputable f) => Outputable (a, b, c, d, e, f)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c, d, e, f) -> SDoc

(Outputable a, Outputable b, Outputable c, Outputable d, Outputable e, Outputable f, Outputable g) => Outputable (a, b, c, d, e, f, g)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c, d, e, f, g) -> SDoc

data LabelStyle

Style of label pretty-printing.

When we produce C sources or headers, we have to take into account that C compilers transform C labels when they convert them into symbols. For example, they can add prefixes (e.g., "_" on Darwin) or suffixes (size for stdcalls on Windows). So we provide two ways to pretty-print CLabels: C style or Asm style.

Constructors

CStyle

C label style (used by C and LLVM backends)

AsmStyle

Asm label style (used by NCG backend)

Instances

Show LabelStyle

Defined in GHC.Utils.Outputable

Methods

showsPrec :: Int -> LabelStyle -> ShowS

show :: LabelStyle -> String

showList :: [LabelStyle] -> ShowS

Eq LabelStyle

Defined in GHC.Utils.Outputable

Methods

(==) :: LabelStyle -> LabelStyle -> Bool

(/=) :: LabelStyle -> LabelStyle -> Bool

Ord LabelStyle

Defined in GHC.Utils.Outputable

Methods

compare :: LabelStyle -> LabelStyle -> Ordering

(<) :: LabelStyle -> LabelStyle -> Bool

(<=) :: LabelStyle -> LabelStyle -> Bool

(>) :: LabelStyle -> LabelStyle -> Bool

(>=) :: LabelStyle -> LabelStyle -> Bool

max :: LabelStyle -> LabelStyle -> LabelStyle

min :: LabelStyle -> LabelStyle -> LabelStyle

data Depth

Constructors

AllTheWay

PartWay Int

0 => stop

DefaultDepth

Use sdocDefaultDepth field as depth

data BindingSite

BindingSite is used to tell the thing that prints binder what language construct is binding the identifier. This can be used to decide how much info to print. Also see Note [Binding-site specific printing] in GHC.Core.Ppr

Constructors

LambdaBind

The x in (x. e)

CaseBind

The x in case scrut of x { (y,z) -> ... }

CasePatBind

The y,z in case scrut of x { (y,z) -> ... }

LetBind

The x in (let x = rhs in e)

ztext :: FastZString -> SDoc

word :: Integer -> SDoc

withUserStyle :: PrintUnqualified -> Depth -> SDoc -> SDoc

withPprStyle :: PprStyle -> SDoc -> SDoc

withErrStyle :: PrintUnqualified -> SDoc -> SDoc

whenPprDebug :: SDoc -> SDoc

Says what to do with -dppr-debug; without, return empty

vcat :: [SDoc] -> SDoc

Concatenate SDoc vertically with dovetailing

vbar :: SDoc

userStyle :: PprStyle -> Bool

updSDocContext :: (SDocContext -> SDocContext) -> SDoc -> SDoc

unicodeSyntax :: SDoc -> SDoc -> SDoc

underscore :: SDoc

speakNth :: Int -> SDoc

Converts an integer to a verbal index:

speakNth 1 = text "first"
speakNth 5 = text "fifth"
speakNth 21 = text "21st"

speakNOf :: Int -> SDoc -> SDoc

Converts an integer and object description to a statement about the multiplicity of those objects:

speakNOf 0 (text "melon") = text "no melons"
speakNOf 1 (text "melon") = text "one melon"
speakNOf 3 (text "melon") = text "three melons"

speakN :: Int -> SDoc

Converts an integer to a verbal multiplicity:

speakN 0 = text "none"
speakN 5 = text "five"
speakN 10 = text "10"

space :: SDoc

showSDocUnsafe :: SDoc -> String

showSDocOneLine :: SDocContext -> SDoc -> String

showPprUnsafe :: Outputable a => a -> String

setStyleColoured :: Bool -> PprStyle -> PprStyle

sep :: [SDoc] -> SDoc

Separate: is either like hsep or like vcat, depending on what fits

semi :: SDoc

sdocWithContext :: (SDocContext -> SDoc) -> SDoc

sdocOption :: (SDocContext -> a) -> (a -> SDoc) -> SDoc

runSDoc :: SDoc -> SDocContext -> Doc

rparen :: SDoc

renderWithContext :: SDocContext -> SDoc -> String

reallyAlwaysQualifyNames :: QueryQualifyName

reallyAlwaysQualify :: PrintUnqualified

rbrack :: SDoc

rbrace :: SDoc

rational :: Rational -> SDoc

quotes :: SDoc -> SDoc

quotedListWithOr :: [SDoc] -> SDoc

quotedListWithNor :: [SDoc] -> SDoc

quote :: SDoc -> SDoc

queryQual :: PprStyle -> PrintUnqualified

qualPackage :: PprStyle -> QueryQualifyPackage

qualName :: PprStyle -> QueryQualifyName

qualModule :: PprStyle -> QueryQualifyModule

punctuate

Arguments

:: SDoc

The punctuation

-> [SDoc]

The list that will have punctuation added between every adjacent pair of elements

-> [SDoc]

Punctuated list

ptext :: PtrString -> SDoc

printSDocLn :: SDocContext -> Mode -> Handle -> SDoc -> IO ()

Like printSDoc but appends an extra newline.

printSDoc :: SDocContext -> Mode -> Handle -> SDoc -> IO ()

The analog of printDoc_ for SDoc, which tries to make sure the terminal doesn't get screwed up by the ANSI color codes if an exception is thrown during pretty-printing.

primWordSuffix :: SDoc

primWord8Suffix :: SDoc

primWord64Suffix :: SDoc

primWord32Suffix :: SDoc

primWord16Suffix :: SDoc

primIntSuffix :: SDoc

primInt8Suffix :: SDoc

primInt64Suffix :: SDoc

primInt32Suffix :: SDoc

primInt16Suffix :: SDoc

primFloatSuffix :: SDoc

primDoubleSuffix :: SDoc

primCharSuffix :: SDoc

pprWithCommas

Arguments

:: (a -> SDoc)

The pretty printing function to use

-> [a]

The things to be pretty printed

-> SDoc

SDoc where the things have been pretty printed, comma-separated and finally packed into a paragraph.

pprWithBars

Arguments

:: (a -> SDoc)

The pretty printing function to use

-> [a]

The things to be pretty printed

-> SDoc

SDoc where the things have been pretty printed, bar-separated and finally packed into a paragraph.

pprSetDepth :: Depth -> SDoc -> SDoc

pprQuotedList :: Outputable a => [a] -> SDoc

Returns the comma-separated concatenation of the quoted pretty printed things.

[x,y,z]  ==>  `x', `y', `z'

pprPrimWord8 :: Integer -> SDoc

pprPrimWord64 :: Integer -> SDoc

pprPrimWord32 :: Integer -> SDoc

pprPrimWord16 :: Integer -> SDoc

pprPrimWord :: Integer -> SDoc

pprPrimInt8 :: Integer -> SDoc

pprPrimInt64 :: Integer -> SDoc

pprPrimInt32 :: Integer -> SDoc

pprPrimInt16 :: Integer -> SDoc

pprPrimInt :: Integer -> SDoc

pprPrimChar :: Char -> SDoc

Special combinator for showing unboxed literals.

pprPrefixVar :: Bool -> SDoc -> SDoc

pprInfixVar :: Bool -> SDoc -> SDoc

pprHsString :: FastString -> SDoc

Special combinator for showing string literals.

pprHsChar :: Char -> SDoc

Special combinator for showing character literals.

pprHsBytes :: ByteString -> SDoc

Special combinator for showing bytestring literals.

pprFilePathString :: FilePath -> SDoc

Normalise, escape and render a string representing a path

e.g. "c:\whatever"

pprFastFilePath :: FastString -> SDoc

pprDeeperList :: ([SDoc] -> SDoc) -> [SDoc] -> SDoc

Truncate a list that is longer than the current depth.

pprDeeper :: SDoc -> SDoc

pprCode :: LabelStyle -> SDoc -> SDoc

ppWhenOption :: (SDocContext -> Bool) -> SDoc -> SDoc

ppWhen :: Bool -> SDoc -> SDoc

ppUnlessOption :: (SDocContext -> Bool) -> SDoc -> SDoc

ppUnless :: Bool -> SDoc -> SDoc

plural :: [a] -> SDoc

Determines the pluralisation suffix appropriate for the length of a list:

plural [] = char 's'
plural ["Hello"] = empty
plural ["Hello", "World"] = char 's'

parens :: SDoc -> SDoc

neverQualifyPackages :: QueryQualifyPackage

neverQualifyNames :: QueryQualifyName

neverQualifyModules :: QueryQualifyModule

neverQualify :: PrintUnqualified

nest :: Int -> SDoc -> SDoc

Indent SDoc some specified amount

mulArrow :: SDoc -> SDoc

mkUserStyle :: PrintUnqualified -> Depth -> PprStyle

mkErrStyle :: PrintUnqualified -> PprStyle

Style for printing error messages

mkDumpStyle :: PrintUnqualified -> PprStyle

lparen :: SDoc

lollipop :: SDoc

lbrack :: SDoc

lbrace :: SDoc

larrowtt :: SDoc

larrowt :: SDoc

larrow :: SDoc

lambda :: SDoc

keyword :: SDoc -> SDoc

itsOrTheir :: [a] -> SDoc

Determines the form of possessive appropriate for the length of a list:

itsOrTheir [x]   = text "its"
itsOrTheir [x,y] = text "their"
itsOrTheir []    = text "their"  -- probably avoid this

isOrAre :: [a] -> SDoc

Determines the form of to be appropriate for the length of a list:

isOrAre [] = text "are"
isOrAre ["Hello"] = text "is"
isOrAre ["Hello", "World"] = text "are"

isEmpty :: SDocContext -> SDoc -> Bool

interppSP :: Outputable a => [a] -> SDoc

Returns the separated concatenation of the pretty printed things.

interpp'SP' :: (a -> SDoc) -> [a] -> SDoc

interpp'SP :: Outputable a => [a] -> SDoc

Returns the comma-separated concatenation of the pretty printed things.

integer :: Integer -> SDoc

intWithCommas :: Integral a => a -> SDoc

int :: Int -> SDoc

ifPprDebug :: SDoc -> SDoc -> SDoc

Says what to do with and without -dppr-debug

hsep :: [SDoc] -> SDoc

Concatenate SDoc horizontally with a space between each one

hcat :: [SDoc] -> SDoc

Concatenate SDoc horizontally

hangNotEmpty :: SDoc -> Int -> SDoc -> SDoc

This behaves like hang, but does not indent the second document when the header is empty.

hang

Arguments

:: SDoc

The header

-> Int

Amount to indent the hung body

-> SDoc

The hung body, indented and placed below the header

-> SDoc

getPprStyle :: (PprStyle -> SDoc) -> SDoc

getPprDebug :: (Bool -> SDoc) -> SDoc

Indicate if -dppr-debug mode is enabled

ftext :: FastString -> SDoc

fsep :: [SDoc] -> SDoc

A paragraph-fill combinator. It's much like sep, only it keeps fitting things on one line until it can't fit any more.

forAllLit :: SDoc

float :: Float -> SDoc

fcat :: [SDoc] -> SDoc

This behaves like fsep, but it uses <> for horizontal conposition rather than <+>

equals :: SDoc

empty :: SDoc

dumpStyle :: PprStyle -> Bool

doubleQuotes :: SDoc -> SDoc

doublePrec :: Int -> Double -> SDoc

doublePrec p n shows a floating point number n with p digits of precision after the decimal point.

double :: Double -> SDoc

dot :: SDoc

docToSDoc :: Doc -> SDoc

doOrDoes :: [a] -> SDoc

Determines the form of to do appropriate for the length of a list:

doOrDoes [] = text "do"
doOrDoes ["Hello"] = text "does"
doOrDoes ["Hello", "World"] = text "do"

defaultUserStyle :: PprStyle

defaultSDocContext :: SDocContext

Default pretty-printing options

defaultErrStyle :: PprStyle

Default style for error messages, when we don't know PrintUnqualified It's a bit of a hack because it doesn't take into account what's in scope Only used for desugarer warnings, and typechecker errors in interface sigs

defaultDumpStyle :: PprStyle

dcolon :: SDoc

darrow :: SDoc

cparen :: Bool -> SDoc -> SDoc

comma :: SDoc

coloured :: PprColour -> SDoc -> SDoc

Apply the given colour/style for the argument.

Only takes effect if colours are enabled.

colon :: SDoc

codeStyle :: PprStyle -> Bool

cmdlineParserStyle :: PprStyle

char :: Char -> SDoc

cat :: [SDoc] -> SDoc

Catenate: is either like hcat or like vcat, depending on what fits

bullet :: SDoc

bufLeftRenderSDoc :: SDocContext -> BufHandle -> SDoc -> IO ()

An efficient variant of printSDoc specialized for LeftMode that outputs to a BufHandle.

brackets :: SDoc -> SDoc

braces :: SDoc -> SDoc

blankLine :: SDoc

asmStyle :: PprStyle -> Bool

arrowtt :: SDoc

arrowt :: SDoc

arrow :: SDoc

angleBrackets :: SDoc -> SDoc

alwaysQualifyPackages :: QueryQualifyPackage

alwaysQualifyNames :: QueryQualifyName

NB: This won't ever show package IDs

alwaysQualifyModules :: QueryQualifyModule

alwaysQualify :: PrintUnqualified

(<+>) :: SDoc -> SDoc -> SDoc

Join two SDoc together horizontally with a gap between them

($+$) :: SDoc -> SDoc -> SDoc

Join two SDoc together vertically

($$) :: SDoc -> SDoc -> SDoc

Join two SDoc together vertically; if there is no vertical overlap it "dovetails" the two onto one line

data OccName

Occurrence Name

In this context that means: "classified (i.e. as a type name, value name, etc) but not qualified and not yet resolved"

Instances

Data OccName

Defined in GHC.Types.Name.Occurrence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OccName -> c OccName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OccName

toConstr :: OccName -> Constr

dataTypeOf :: OccName -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OccName)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OccName)

gmapT :: (forall b. Data b => b -> b) -> OccName -> OccName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OccName -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OccName -> r

gmapQ :: (forall d. Data d => d -> u) -> OccName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> OccName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> OccName -> m OccName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OccName -> m OccName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OccName -> m OccName

NFData OccName

Defined in GHC.Types.Name.Occurrence

Methods

rnf :: OccName -> ()

HasOccName OccName

Defined in GHC.Types.Name.Occurrence

Methods

occName :: OccName -> OccName

Uniquable OccName

Defined in GHC.Types.Name.Occurrence

Methods

getUnique :: OccName -> Unique

Binary OccName

Defined in GHC.Types.Name.Occurrence

Methods

put_ :: BinHandle -> OccName -> IO ()

put :: BinHandle -> OccName -> IO (Bin OccName)

get :: BinHandle -> IO OccName

Outputable OccName

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccName -> SDoc

OutputableBndr OccName

Defined in GHC.Types.Name.Occurrence

Methods

pprBndr :: BindingSite -> OccName -> SDoc

pprPrefixOcc :: OccName -> SDoc

pprInfixOcc :: OccName -> SDoc

bndrIsJoin_maybe :: OccName -> Maybe Int

Eq OccName

Defined in GHC.Types.Name.Occurrence

Methods

(==) :: OccName -> OccName -> Bool

(/=) :: OccName -> OccName -> Bool

Ord OccName

Defined in GHC.Types.Name.Occurrence

Methods

compare :: OccName -> OccName -> Ordering

(<) :: OccName -> OccName -> Bool

(<=) :: OccName -> OccName -> Bool

(>) :: OccName -> OccName -> Bool

(>=) :: OccName -> OccName -> Bool

max :: OccName -> OccName -> OccName

min :: OccName -> OccName -> OccName

occNameString :: OccName -> String

mkVarOccFS :: FastString -> OccName

data FastString

A FastString is a UTF-8 encoded string together with a unique ID. All FastStrings are stored in a global hashtable to support fast O(1) comparison.

It is also associated with a lazy reference to the Z-encoding of this string which is used by the compiler internally.

Instances

Data FastString

Defined in GHC.Data.FastString

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FastString -> c FastString

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FastString

toConstr :: FastString -> Constr

dataTypeOf :: FastString -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FastString)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FastString)

gmapT :: (forall b. Data b => b -> b) -> FastString -> FastString

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FastString -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FastString -> r

gmapQ :: (forall d. Data d => d -> u) -> FastString -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FastString -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FastString -> m FastString

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FastString -> m FastString

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FastString -> m FastString

IsString FastString

Defined in GHC.Data.FastString

Methods

fromString :: String -> FastString

Monoid FastString

Defined in GHC.Data.FastString

Methods

mempty :: FastString

mappend :: FastString -> FastString -> FastString

mconcat :: [FastString] -> FastString

Semigroup FastString

Defined in GHC.Data.FastString

Methods

(<>) :: FastString -> FastString -> FastString

sconcat :: NonEmpty FastString -> FastString

stimes :: Integral b => b -> FastString -> FastString

Show FastString

Defined in GHC.Data.FastString

Methods

showsPrec :: Int -> FastString -> ShowS

show :: FastString -> String

showList :: [FastString] -> ShowS

NFData FastString

Defined in GHC.Data.FastString

Methods

rnf :: FastString -> ()

Uniquable FastString

Defined in GHC.Types.Unique

Methods

getUnique :: FastString -> Unique

Outputable FastString

Defined in GHC.Utils.Outputable

Methods

ppr :: FastString -> SDoc

Eq FastString

Defined in GHC.Data.FastString

Methods

(==) :: FastString -> FastString -> Bool

(/=) :: FastString -> FastString -> Bool

Symbolic FastString

Defined in Language.Haskell.Liquid.GHC.Misc

Methods

symbol :: FastString -> Symbol

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

unpackFS :: FastString -> String

Unpacks and decodes the FastString

sLit :: String -> PtrString

mkFastStringByteString :: ByteString -> FastString

Create a FastString by copying an existing ByteString

mkFastString :: String -> FastString

Creates a UTF-8 encoded FastString from a String

fsLit :: String -> FastString

concatFS :: [FastString] -> FastString

bytesFS :: FastString -> ByteString

Gives the Modified UTF-8 encoded bytes corresponding to a FastString

data Backend

Code generation backends.

GHC supports several code generation backends serving different purposes (producing machine code, producing ByteCode for the interpreter) and supporting different platforms.

Constructors

Interpreter

ByteCode interpreter.

Produce ByteCode objects (BCO, see GHC.ByteCode) that can be interpreted. It is used by GHCi.

Currently some extensions are not supported (foreign primops).

See GHC.StgToByteCode

Instances

Read Backend

Defined in GHC.Driver.Backend

Methods

readsPrec :: Int -> ReadS Backend

readList :: ReadS [Backend]

readPrec :: ReadPrec Backend

readListPrec :: ReadPrec [Backend]

Show Backend

Defined in GHC.Driver.Backend

Methods

showsPrec :: Int -> Backend -> ShowS

show :: Backend -> String

showList :: [Backend] -> ShowS

Eq Backend

Defined in GHC.Driver.Backend

Methods

(==) :: Backend -> Backend -> Bool

(/=) :: Backend -> Backend -> Bool

Ord Backend

Defined in GHC.Driver.Backend

Methods

compare :: Backend -> Backend -> Ordering

(<) :: Backend -> Backend -> Bool

(<=) :: Backend -> Backend -> Bool

(>) :: Backend -> Backend -> Bool

(>=) :: Backend -> Backend -> Bool

max :: Backend -> Backend -> Backend

min :: Backend -> Backend -> Backend

data DynFlags

Contains not only a collection of GeneralFlags but also a plethora of information relating to the compilation of a single file or GHC session

panic :: String -> a

Panics and asserts.

data UnitId

A UnitId identifies a built library in a database and is used to generate unique symbols, etc. It's usually of the form:

pkgname-1.2:libname+hash

These UnitId are provided to us via the -this-unit-id flag.

The library in question may be definite or indefinite; if it is indefinite, none of the holes have been filled (we never install partially instantiated libraries as we can cheaply instantiate them on-the-fly, cf VirtUnit). Put another way, an installed unit id is either fully instantiated, or not instantiated at all.

Instances

Data Unit

Defined in GHC.Unit.Types

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Unit -> c Unit

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Unit

toConstr :: Unit -> Constr

dataTypeOf :: Unit -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Unit)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Unit)

gmapT :: (forall b. Data b => b -> b) -> Unit -> Unit

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unit -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unit -> r

gmapQ :: (forall d. Data d => d -> u) -> Unit -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Unit -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unit -> m Unit

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit -> m Unit

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit -> m Unit

Show Unit

Defined in GHC.Unit.Types

Methods

showsPrec :: Int -> Unit -> ShowS

show :: Unit -> String

showList :: [Unit] -> ShowS

NFData Unit

Defined in GHC.Unit.Types

Methods

rnf :: Unit -> ()

Uniquable Module

Defined in GHC.Unit.Types

Methods

getUnique :: Module -> Unique

Uniquable UnitId

Defined in GHC.Unit.Types

Methods

getUnique :: UnitId -> Unique

IsUnitId UnitId

Defined in GHC.Unit.Types

Methods

unitFS :: UnitId -> FastString

Binary InstantiatedUnit

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> InstantiatedUnit -> IO ()

put :: BinHandle -> InstantiatedUnit -> IO (Bin InstantiatedUnit)

get :: BinHandle -> IO InstantiatedUnit

Binary Unit

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> Unit -> IO ()

put :: BinHandle -> Unit -> IO (Bin Unit)

get :: BinHandle -> IO Unit

Binary UnitId

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> UnitId -> IO ()

put :: BinHandle -> UnitId -> IO (Bin UnitId)

get :: BinHandle -> IO UnitId

Outputable InstalledModule

Defined in GHC.Unit.Types

Methods

ppr :: InstalledModule -> SDoc

Outputable InstantiatedModule

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedModule -> SDoc

Outputable InstantiatedUnit

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedUnit -> SDoc

Outputable Module

Defined in GHC.Unit.Types

Methods

ppr :: Module -> SDoc

Outputable Unit

Defined in GHC.Unit.Types

Methods

ppr :: Unit -> SDoc

Outputable UnitId

Defined in GHC.Unit.Types

Methods

ppr :: UnitId -> SDoc

Eq UnitId

Defined in GHC.Unit.Types

Methods

(==) :: UnitId -> UnitId -> Bool

(/=) :: UnitId -> UnitId -> Bool

Ord Unit

Defined in GHC.Unit.Types

Methods

compare :: Unit -> Unit -> Ordering

(<) :: Unit -> Unit -> Bool

(<=) :: Unit -> Unit -> Bool

(>) :: Unit -> Unit -> Bool

(>=) :: Unit -> Unit -> Bool

max :: Unit -> Unit -> Unit

min :: Unit -> Unit -> Unit

Ord UnitId

Defined in GHC.Unit.Types

Methods

compare :: UnitId -> UnitId -> Ordering

(<) :: UnitId -> UnitId -> Bool

(<=) :: UnitId -> UnitId -> Bool

(>) :: UnitId -> UnitId -> Bool

(>=) :: UnitId -> UnitId -> Bool

max :: UnitId -> UnitId -> UnitId

min :: UnitId -> UnitId -> UnitId

type Module = GenModule Unit

A Module is a pair of a Unit and a ModuleName.

moduleName :: GenModule unit -> ModuleName

Module name (e.g. A.B.C)

moduleUnit :: GenModule unit -> unit

Unit the module belongs to

data SDocContext

Constructors

SDC

Fields

• sdocStyle :: !PprStyle
• sdocColScheme :: !Scheme
• sdocLastColour :: !PprColour

  The most recently used colour. This allows nesting colours.

• sdocShouldUseColor :: !Bool
• sdocDefaultDepth :: !Int
• sdocLineLength :: !Int
• sdocCanUseUnicode :: !Bool

  True if Unicode encoding is supported and not disable by GHC_NO_UNICODE environment variable

• sdocHexWordLiterals :: !Bool
• sdocPprDebug :: !Bool
• sdocPrintUnicodeSyntax :: !Bool
• sdocPrintCaseAsLet :: !Bool
• sdocPrintTypecheckerElaboration :: !Bool
• sdocPrintAxiomIncomps :: !Bool
• sdocPrintExplicitKinds :: !Bool
• sdocPrintExplicitCoercions :: !Bool
• sdocPrintExplicitRuntimeReps :: !Bool
• sdocPrintExplicitForalls :: !Bool
• sdocPrintPotentialInstances :: !Bool
• sdocPrintEqualityRelations :: !Bool
• sdocSuppressTicks :: !Bool
• sdocSuppressTypeSignatures :: !Bool
• sdocSuppressTypeApplications :: !Bool
• sdocSuppressIdInfo :: !Bool
• sdocSuppressCoercions :: !Bool
• sdocSuppressUnfoldings :: !Bool
• sdocSuppressVarKinds :: !Bool
• sdocSuppressUniques :: !Bool
• sdocSuppressModulePrefixes :: !Bool
• sdocSuppressStgExts :: !Bool
• sdocErrorSpans :: !Bool
• sdocStarIsType :: !Bool
• sdocLinearTypes :: !Bool
• sdocImpredicativeTypes :: !Bool
• sdocPrintTypeAbbreviations :: !Bool
• sdocUnitIdForUser :: !(FastString -> SDoc)

  Used to map UnitIds to more friendly "package-version:component" strings while pretty-printing.

  Use pprWithUnitState to set it. Users should never have to set it to pretty-print SDocs emitted by GHC, otherwise it's a bug. It's an internal field used to thread the UnitState so that the Outputable instance of UnitId can use it.

  See Note [Pretty-printing UnitId] in GHC.Unit for more details.

  Note that we use FastString instead of UnitId to avoid boring module inter-dependency issues.

data SDoc

Represents a pretty-printable document.

To display an SDoc, use printSDoc, printSDocLn, bufLeftRenderSDoc, or renderWithContext. Avoid calling runSDoc directly as it breaks the abstraction layer.

Instances

IsString SDoc

Defined in GHC.Utils.Outputable

Methods

fromString :: String -> SDoc

Outputable SDoc

Defined in GHC.Utils.Outputable

Methods

ppr :: SDoc -> SDoc

OutputableP env SDoc

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> SDoc -> SDoc

data PprStyle

Constructors

PprUser PrintUnqualified Depth Coloured

PprDump PrintUnqualified

PprCode LabelStyle

Print code; either C or assembler

Instances

Outputable PprStyle

Defined in GHC.Utils.Outputable

Methods

ppr :: PprStyle -> SDoc

text :: String -> SDoc

data ModuleName

A ModuleName is essentially a simple string, e.g. Data.List.

Instances

Data ModuleName

Defined in GHC.Unit.Module.Name

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModuleName -> c ModuleName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ModuleName

toConstr :: ModuleName -> Constr

dataTypeOf :: ModuleName -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ModuleName)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ModuleName)

gmapT :: (forall b. Data b => b -> b) -> ModuleName -> ModuleName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName -> r

gmapQ :: (forall d. Data d => d -> u) -> ModuleName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ModuleName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName

Show ModuleName

Defined in GHC.Unit.Module.Name

Methods

showsPrec :: Int -> ModuleName -> ShowS

show :: ModuleName -> String

showList :: [ModuleName] -> ShowS

NFData ModuleName

Defined in GHC.Unit.Module.Name

Methods

rnf :: ModuleName -> ()

Uniquable ModuleName

Defined in GHC.Unit.Module.Name

Methods

getUnique :: ModuleName -> Unique

Binary ModuleName

Defined in GHC.Unit.Module.Name

Methods

put_ :: BinHandle -> ModuleName -> IO ()

put :: BinHandle -> ModuleName -> IO (Bin ModuleName)

get :: BinHandle -> IO ModuleName

Outputable ModuleName

Defined in GHC.Unit.Module.Name

Methods

ppr :: ModuleName -> SDoc

Eq ModuleName

Defined in GHC.Unit.Module.Name

Methods

(==) :: ModuleName -> ModuleName -> Bool

(/=) :: ModuleName -> ModuleName -> Bool

Ord ModuleName

Defined in GHC.Unit.Module.Name

Methods

compare :: ModuleName -> ModuleName -> Ordering

(<) :: ModuleName -> ModuleName -> Bool

(<=) :: ModuleName -> ModuleName -> Bool

(>) :: ModuleName -> ModuleName -> Bool

(>=) :: ModuleName -> ModuleName -> Bool

max :: ModuleName -> ModuleName -> ModuleName

min :: ModuleName -> ModuleName -> ModuleName

Hashable ModuleName

Defined in Liquid.GHC.API.StableModule

Methods

hashWithSalt :: Int -> ModuleName -> Int

hash :: ModuleName -> Int

Symbolic ModuleName

Defined in Language.Haskell.Liquid.Types.Types

Methods

symbol :: ModuleName -> Symbol

type Anno ModuleName

Defined in GHC.Hs.ImpExp

type Anno ModuleName = SrcSpanAnnA

data StableModule

A newtype wrapper around a Module which:

• Allows a Module to be serialised (i.e. it has a Binary instance)
• It tries to use stable comparison and equality under the hood.

Instances

Generic StableModule

Defined in Liquid.GHC.API.StableModule

Associated Types

type Rep StableModule :: Type -> Type

Methods

from :: StableModule -> Rep StableModule x

to :: Rep StableModule x -> StableModule

Show StableModule

Defined in Liquid.GHC.API.StableModule

Methods

showsPrec :: Int -> StableModule -> ShowS

show :: StableModule -> String

showList :: [StableModule] -> ShowS

Binary StableModule

Defined in Liquid.GHC.API.StableModule

Methods

put :: StableModule -> Put

get :: Get StableModule

putList :: [StableModule] -> Put

Eq StableModule

Defined in Liquid.GHC.API.StableModule

Methods

(==) :: StableModule -> StableModule -> Bool

(/=) :: StableModule -> StableModule -> Bool

Ord StableModule

Defined in Liquid.GHC.API.StableModule

Methods

compare :: StableModule -> StableModule -> Ordering

(<) :: StableModule -> StableModule -> Bool

(<=) :: StableModule -> StableModule -> Bool

(>) :: StableModule -> StableModule -> Bool

(>=) :: StableModule -> StableModule -> Bool

max :: StableModule -> StableModule -> StableModule

min :: StableModule -> StableModule -> StableModule

Hashable StableModule

Defined in Liquid.GHC.API.StableModule

Methods

hashWithSalt :: Int -> StableModule -> Int

hash :: StableModule -> Int

type Rep StableModule

Defined in Liquid.GHC.API.StableModule

type Rep StableModule = D1 ('MetaData "StableModule" "Liquid.GHC.API.StableModule" "liquidhaskell-boot-0.9.2.5.0-JuBNLAGIRFD6ItsPyAO3oF" 'True) (C1 ('MetaCons "StableModule" 'PrefixI 'True) (S1 ('MetaSel ('Just "unStableModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Module)))

toStableModule :: Module -> StableModule

Converts a Module into a StableModule.

renderModule :: Module -> String

mkStableModule :: UnitId -> ModuleName -> StableModule

Creates a new StableModule out of a ModuleName and a UnitId.

data ApiComment

Abstraction of EpaComment.

Constructors

ApiLineComment String

ApiBlockComment String

Instances

Show ApiComment

Defined in Liquid.GHC.API.Extra

Methods

showsPrec :: Int -> ApiComment -> ShowS

show :: ApiComment -> String

showList :: [ApiComment] -> ShowS

Eq ApiComment

Defined in Liquid.GHC.API.Extra

Methods

(==) :: ApiComment -> ApiComment -> Bool

(/=) :: ApiComment -> ApiComment -> Bool

fsToUnitId :: FastString -> UnitId

moduleUnitId :: Module -> UnitId

thisPackage :: DynFlags -> UnitId

tyConRealArity :: TyCon -> Int

getDependenciesModuleNames :: Dependencies -> [ModuleNameWithIsBoot]

renderWithStyle :: DynFlags -> SDoc -> PprStyle -> String

dataConSig :: DataCon -> ([TyCoVar], ThetaType, [Type], Type)

relevantModules :: ModGuts -> Set Module

The collection of dependencies and usages modules which are relevant for liquidHaskell

parseModuleIO :: HscEnv -> ModSummary -> IO ParsedModule

typecheckModuleIO :: HscEnv -> ParsedModule -> IO TypecheckedModuleLH

desugarModuleIO :: HscEnv -> ModSummary -> TypecheckedModuleLH -> IO ModGuts

Desugar a typechecked module.

apiComments :: ParsedModule -> [Located ApiComment]

Extract top-level comments from a module.

apiCommentsParsedSource :: Located HsModule -> [Located ApiComment]

lookupModSummary :: HscEnv -> ModuleName -> Maybe ModSummary

modInfoLookupNameIO :: HscEnv -> ModuleInfoLH -> Name -> IO (Maybe TyThing)

moduleInfoTc :: HscEnv -> ModSummary -> TcGblEnv -> IO ModuleInfoLH

isPatErrorAlt :: CoreAlt -> Bool

Tells if a case alternative calls to patError

qualifiedNameFS :: Name -> FastString

showPprQualified :: Outputable a => a -> String

showSDocQualified :: SDoc -> String