Hoogle Search
Within LTS Haskell 24.37 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
data
MaybeO (ex :: Extensibility) tghc-lib-parser GHC.Cmm.Dataflow.Block Maybe type indexed by open/closed
MaybeApart :: MaybeApartReason -> a -> UnifyResultM aghc-lib-parser GHC.Core.Unify No documentation available.
-
ghc-lib-parser GHC.Core.Unify Why are two types MaybeApart? MARInfinite takes precedence: This is used (only) in Note [Infinitary substitution in lookup] in GHC.Core.InstEnv As of Feb 2022, we never differentiate between MARTypeFamily and MARTypeVsConstraint; it's really only MARInfinite that's interesting here.
-
ghc-lib-parser GHC.Data.Maybe No documentation available.
newtype
MaybeT (m :: Type -> Type) aghc-lib-parser GHC.Data.Maybe The parameterizable maybe monad, obtained by composing an arbitrary monad with the Maybe monad. Computations are actions that may produce a value or exit. The return function yields a computation that produces that value, while >>= sequences two subcomputations, exiting if either computation does.
MaybeT :: m (Maybe a) -> MaybeT (m :: Type -> Type) aghc-lib-parser GHC.Data.Maybe No documentation available.
data
MaybeMap (m :: Type -> Type) aghc-lib-parser GHC.Data.TrieMap No documentation available.
-
ghc-lib-parser GHC.Data.Unboxed Like Maybe, but using unboxed sums. Use with care. Using a unboxed maybe is not always a win in execution *time* even when allocations go down. So make sure to benchmark for execution time as well. If the difference in *runtime* for the compiler is too small to measure it's likely better to use a regular Maybe instead. This is since it causes more function arguments to be passed, and potentially more variables to be captured by closures increasing closure size.
MaybeRecompile :: Fingerprint -> PluginRecompileghc-lib-parser GHC.Driver.Plugins No documentation available.
-
ghc-lib-parser GHC.HsToCore.Pmc.Solver.Types No documentation available.