HumblePrelude.Extras

Control.Applicative

liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c

Lift a binary function to actions.

Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>.

class Applicative f => Alternative (f :: Type -> Type) where

A monoid on applicative functors.

If defined, some and many should be the least solutions of the equations:

• some v = (:) <$> v <*> many v

• many v = some v <|> pure []

Methods

empty :: f a

The identity of <|>

(<|>) :: f a -> f a -> f a infixl 3

An associative binary operation

Instances

Alternative []

Since: base-2.1

Defined in GHC.Base

Methods

empty :: [a]

(<|>) :: [a] -> [a] -> [a]

some :: [a] -> [[a]]

many :: [a] -> [[a]]

Alternative Maybe

Since: base-2.1

Defined in GHC.Base

Methods

empty :: Maybe a

(<|>) :: Maybe a -> Maybe a -> Maybe a

some :: Maybe a -> Maybe [a]

many :: Maybe a -> Maybe [a]

Alternative IO

Since: base-4.9.0.0

Defined in GHC.Base

Methods

empty :: IO a

(<|>) :: IO a -> IO a -> IO a

some :: IO a -> IO [a]

many :: IO a -> IO [a]

Alternative ZipList

Since: base-4.11.0.0

Defined in Control.Applicative

Methods

empty :: ZipList a

(<|>) :: ZipList a -> ZipList a -> ZipList a

some :: ZipList a -> ZipList [a]

many :: ZipList a -> ZipList [a]

Alternative CoreM

Defined in CoreMonad

Methods

empty :: CoreM a

(<|>) :: CoreM a -> CoreM a -> CoreM a

some :: CoreM a -> CoreM [a]

many :: CoreM a -> CoreM [a]

Alternative (U1 :: Type -> Type)

Since: base-4.9.0.0

Defined in GHC.Generics

Methods

empty :: U1 a

(<|>) :: U1 a -> U1 a -> U1 a

some :: U1 a -> U1 [a]

many :: U1 a -> U1 [a]

MonadPlus m => Alternative (WrappedMonad m)

Since: base-2.1

Defined in Control.Applicative

Methods

empty :: WrappedMonad m a

(<|>) :: WrappedMonad m a -> WrappedMonad m a -> WrappedMonad m a

some :: WrappedMonad m a -> WrappedMonad m [a]

many :: WrappedMonad m a -> WrappedMonad m [a]

Alternative (Proxy :: Type -> Type)

Since: base-4.9.0.0

Defined in Data.Proxy

Methods

empty :: Proxy a

(<|>) :: Proxy a -> Proxy a -> Proxy a

some :: Proxy a -> Proxy [a]

many :: Proxy a -> Proxy [a]

Alternative f => Alternative (Rec1 f)

Since: base-4.9.0.0

Defined in GHC.Generics

Methods

empty :: Rec1 f a

(<|>) :: Rec1 f a -> Rec1 f a -> Rec1 f a

some :: Rec1 f a -> Rec1 f [a]

many :: Rec1 f a -> Rec1 f [a]

(ArrowZero a, ArrowPlus a) => Alternative (WrappedArrow a b)

Since: base-2.1

Defined in Control.Applicative

Methods

empty :: WrappedArrow a b a0

(<|>) :: WrappedArrow a b a0 -> WrappedArrow a b a0 -> WrappedArrow a b a0

some :: WrappedArrow a b a0 -> WrappedArrow a b [a0]

many :: WrappedArrow a b a0 -> WrappedArrow a b [a0]

(Alternative f, Alternative g) => Alternative (f :*: g)

Since: base-4.9.0.0

Defined in GHC.Generics

Methods

empty :: (f :*: g) a

(<|>) :: (f :*: g) a -> (f :*: g) a -> (f :*: g) a

some :: (f :*: g) a -> (f :*: g) [a]

many :: (f :*: g) a -> (f :*: g) [a]

Alternative f => Alternative (M1 i c f)

Since: base-4.9.0.0

Defined in GHC.Generics

Methods

empty :: M1 i c f a

(<|>) :: M1 i c f a -> M1 i c f a -> M1 i c f a

some :: M1 i c f a -> M1 i c f [a]

many :: M1 i c f a -> M1 i c f [a]

(Alternative f, Applicative g) => Alternative (f :.: g)

Since: base-4.9.0.0

Defined in GHC.Generics

Methods

empty :: (f :.: g) a

(<|>) :: (f :.: g) a -> (f :.: g) a -> (f :.: g) a

some :: (f :.: g) a -> (f :.: g) [a]

many :: (f :.: g) a -> (f :.: g) [a]

Control.Monad

guard :: Alternative f => Bool -> f ()

Conditional failure of Alternative computations. Defined by

guard True  = pure ()
guard False = empty

Examples

Common uses of guard include conditionally signaling an error in an error monad and conditionally rejecting the current choice in an Alternative-based parser.

As an example of signaling an error in the error monad Maybe, consider a safe division function safeDiv x y that returns Nothing when the denominator y is zero and Just (x `div` y) otherwise. For example:

>>> safeDiv 4 0
Nothing
>>> safeDiv 4 2
Just 2

A definition of safeDiv using guards, but not guard:

safeDiv :: Int -> Int -> Maybe Int
safeDiv x y | y /= 0    = Just (x `div` y)
            | otherwise = Nothing

A definition of safeDiv using guard and Monad do-notation:

safeDiv :: Int -> Int -> Maybe Int
safeDiv x y = do
  guard (y /= 0)
  return (x `div` y)

when :: Applicative f => Bool -> f () -> f ()

Conditional execution of Applicative expressions. For example,

when debug (putStrLn "Debugging")

will output the string Debugging if the Boolean value debug is True, and otherwise do nothing.

unless :: Applicative f => Bool -> f () -> f ()

The reverse of when.

Data.Function

(&) :: a -> (a -> b) -> b infixl 1

& is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $.

>>> 5 & (+1) & show
"6"

Since: base-4.8.0.0

fix :: (a -> a) -> a

fix f is the least fixed point of the function f, i.e. the least defined x such that f x = x.

For example, we can write the factorial function using direct recursion as

>>> let fac n = if n <= 1 then 1 else n * fac (n-1) in fac 5
120

This uses the fact that Haskell’s let introduces recursive bindings. We can rewrite this definition using fix,

>>> fix (\rec n -> if n <= 1 then 1 else n * rec (n-1)) 5
120

Instead of making a recursive call, we introduce a dummy parameter rec; when used within fix, this parameter then refers to fix' argument, hence the recursion is reintroduced.

Data.Functor

(<&>) :: Functor f => f a -> (a -> b) -> f b infixl 1

Flipped version of <$>.

(<&>) = flip fmap

Examples

Apply (+1) to a list, a Just and a Right:

>>> Just 2 <&> (+1)
Just 3

>>> [1,2,3] <&> (+1)
[2,3,4]

>>> Right 3 <&> (+1)
Right 4

Since: base-4.11.0.0

void :: Functor f => f a -> f ()

void value discards or ignores the result of evaluation, such as the return value of an IO action.

Examples

Replace the contents of a Maybe Int with unit:

>>> void Nothing
Nothing
>>> void (Just 3)
Just ()

Replace the contents of an Either Int Int with unit, resulting in an Either Int '()':

>>> void (Left 8675309)
Left 8675309
>>> void (Right 8675309)
Right ()

Replace every element of a list with unit:

>>> void [1,2,3]
[(),(),()]

Replace the second element of a pair with unit:

>>> void (1,2)
(1,())

Discard the result of an IO action:

>>> mapM print [1,2]
1
2
[(),()]
>>> void $ mapM print [1,2]
1
2

Data.Ord

comparing :: Ord a => (b -> a) -> b -> b -> Ordering

comparing p x y = compare (p x) (p y)

Useful combinator for use in conjunction with the xxxBy family of functions from Data.List, for example:

  ... sortBy (comparing fst) ...

Data.Foldable

traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()

Map each element of a structure to an action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see traverse.

for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f ()

for_ is traverse_ with its arguments flipped. For a version that doesn't ignore the results see for.

>>> for_ [1..4] print
1
2
3
4

foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b

Left-associative fold of a structure but with strict application of the operator.

This ensures that each step of the fold is forced to weak head normal form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite list to a single, monolithic result (e.g. length).

For a general Foldable structure this should be semantically identical to,

foldl f z = foldl' f z . toList

Data.Traversable

for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)

for is traverse with its arguments flipped. For a version that ignores the results see for_.

Common types

data ByteString

A space-efficient representation of a Word8 vector, supporting many efficient operations.

A ByteString contains 8-bit bytes, or by using the operations from Data.ByteString.Char8 it can be interpreted as containing 8-bit characters.

Instances

Eq ByteString

Defined in Data.ByteString.Internal

Methods

(==) :: ByteString -> ByteString -> Bool

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

Data ByteString

Defined in Data.ByteString.Internal

Methods

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

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

toConstr :: ByteString -> Constr

dataTypeOf :: ByteString -> DataType

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

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

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

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

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

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

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

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

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

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

Ord ByteString

Defined in Data.ByteString.Internal

Methods

compare :: ByteString -> ByteString -> Ordering

(<) :: ByteString -> ByteString -> Bool

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

(>) :: ByteString -> ByteString -> Bool

(>=) :: ByteString -> ByteString -> Bool

max :: ByteString -> ByteString -> ByteString

min :: ByteString -> ByteString -> ByteString

Read ByteString

Defined in Data.ByteString.Internal

Methods

readsPrec :: Int -> ReadS ByteString

readList :: ReadS [ByteString]

readPrec :: ReadPrec ByteString

readListPrec :: ReadPrec [ByteString]

Show ByteString

Defined in Data.ByteString.Internal

Methods

showsPrec :: Int -> ByteString -> ShowS

show :: ByteString -> String

showList :: [ByteString] -> ShowS

IsString ByteString

Defined in Data.ByteString.Internal

Methods

fromString :: String -> ByteString

Semigroup ByteString

Defined in Data.ByteString.Internal

Methods

(<>) :: ByteString -> ByteString -> ByteString

sconcat :: NonEmpty ByteString -> ByteString

stimes :: Integral b => b -> ByteString -> ByteString

Monoid ByteString

Defined in Data.ByteString.Internal

Methods

mempty :: ByteString

mappend :: ByteString -> ByteString -> ByteString

mconcat :: [ByteString] -> ByteString

NFData ByteString

Defined in Data.ByteString.Internal

Methods

rnf :: ByteString -> ()

data Constraint

The kind of constraints, like Show a

class Generic a

Representable types of kind *. This class is derivable in GHC with the DeriveGeneric flag on.

A Generic instance must satisfy the following laws:

from . to ≡ id
to . from ≡ id

Minimal complete definition

from, to

Instances

Generic Bool

Defined in GHC.Generics

Associated Types

type Rep Bool :: Type -> Type

Methods

from :: Bool -> Rep Bool x

to :: Rep Bool x -> Bool

Generic Ordering

Defined in GHC.Generics

Associated Types

type Rep Ordering :: Type -> Type

Methods

from :: Ordering -> Rep Ordering x

to :: Rep Ordering x -> Ordering

Generic ()

Defined in GHC.Generics

Associated Types

type Rep () :: Type -> Type

Methods

from :: () -> Rep () x

to :: Rep () x -> ()

Generic Version

Defined in Data.Version

Associated Types

type Rep Version :: Type -> Type

Methods

from :: Version -> Rep Version x

to :: Rep Version x -> Version

Generic Fixity

Defined in GHC.Generics

Associated Types

type Rep Fixity :: Type -> Type

Methods

from :: Fixity -> Rep Fixity x

to :: Rep Fixity x -> Fixity

Generic Associativity

Defined in GHC.Generics

Associated Types

type Rep Associativity :: Type -> Type

Methods

from :: Associativity -> Rep Associativity x

to :: Rep Associativity x -> Associativity

Generic SourceUnpackedness

Defined in GHC.Generics

Associated Types

type Rep SourceUnpackedness :: Type -> Type

Methods

from :: SourceUnpackedness -> Rep SourceUnpackedness x

to :: Rep SourceUnpackedness x -> SourceUnpackedness

Generic SourceStrictness

Defined in GHC.Generics

Associated Types

type Rep SourceStrictness :: Type -> Type

Methods

from :: SourceStrictness -> Rep SourceStrictness x

to :: Rep SourceStrictness x -> SourceStrictness

Generic DecidedStrictness

Defined in GHC.Generics

Associated Types

type Rep DecidedStrictness :: Type -> Type

Methods

from :: DecidedStrictness -> Rep DecidedStrictness x

to :: Rep DecidedStrictness x -> DecidedStrictness

Generic ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

Associated Types

type Rep ForeignSrcLang :: Type -> Type

Methods

from :: ForeignSrcLang -> Rep ForeignSrcLang x

to :: Rep ForeignSrcLang x -> ForeignSrcLang

Generic EvalOpts

Defined in GHCi.Message

Associated Types

type Rep EvalOpts :: Type -> Type

Methods

from :: EvalOpts -> Rep EvalOpts x

to :: Rep EvalOpts x -> EvalOpts

Generic SerializableException

Defined in GHCi.Message

Associated Types

type Rep SerializableException :: Type -> Type

Methods

from :: SerializableException -> Rep SerializableException x

to :: Rep SerializableException x -> SerializableException

Generic THResultType

Defined in GHCi.Message

Associated Types

type Rep THResultType :: Type -> Type

Methods

from :: THResultType -> Rep THResultType x

to :: Rep THResultType x -> THResultType

Generic [a]

Defined in GHC.Generics

Associated Types

type Rep [a] :: Type -> Type

Methods

from :: [a] -> Rep [a] x

to :: Rep [a] x -> [a]

Generic (Maybe a)

Defined in GHC.Generics

Associated Types

type Rep (Maybe a) :: Type -> Type

Methods

from :: Maybe a -> Rep (Maybe a) x

to :: Rep (Maybe a) x -> Maybe a

Generic (Par1 p)

Defined in GHC.Generics

Associated Types

type Rep (Par1 p) :: Type -> Type

Methods

from :: Par1 p -> Rep (Par1 p) x

to :: Rep (Par1 p) x -> Par1 p

Generic (ZipList a)

Defined in Control.Applicative

Associated Types

type Rep (ZipList a) :: Type -> Type

Methods

from :: ZipList a -> Rep (ZipList a) x

to :: Rep (ZipList a) x -> ZipList a

Generic (Down a)

Defined in GHC.Generics

Associated Types

type Rep (Down a) :: Type -> Type

Methods

from :: Down a -> Rep (Down a) x

to :: Rep (Down a) x -> Down a

Generic (NonEmpty a)

Defined in GHC.Generics

Associated Types

type Rep (NonEmpty a) :: Type -> Type

Methods

from :: NonEmpty a -> Rep (NonEmpty a) x

to :: Rep (NonEmpty a) x -> NonEmpty a

Generic (EvalResult a)

Defined in GHCi.Message

Associated Types

type Rep (EvalResult a) :: Type -> Type

Methods

from :: EvalResult a -> Rep (EvalResult a) x

to :: Rep (EvalResult a) x -> EvalResult a

Generic (EvalExpr a)

Defined in GHCi.Message

Associated Types

type Rep (EvalExpr a) :: Type -> Type

Methods

from :: EvalExpr a -> Rep (EvalExpr a) x

to :: Rep (EvalExpr a) x -> EvalExpr a

Generic (QResult a)

Defined in GHCi.Message

Associated Types

type Rep (QResult a) :: Type -> Type

Methods

from :: QResult a -> Rep (QResult a) x

to :: Rep (QResult a) x -> QResult a

Generic (THResult a)

Defined in GHCi.Message

Associated Types

type Rep (THResult a) :: Type -> Type

Methods

from :: THResult a -> Rep (THResult a) x

to :: Rep (THResult a) x -> THResult a

Generic (Either a b)

Defined in GHC.Generics

Associated Types

type Rep (Either a b) :: Type -> Type

Methods

from :: Either a b -> Rep (Either a b) x

to :: Rep (Either a b) x -> Either a b

Generic (V1 p)

Defined in GHC.Generics

Associated Types

type Rep (V1 p) :: Type -> Type

Methods

from :: V1 p -> Rep (V1 p) x

to :: Rep (V1 p) x -> V1 p

Generic (U1 p)

Defined in GHC.Generics

Associated Types

type Rep (U1 p) :: Type -> Type

Methods

from :: U1 p -> Rep (U1 p) x

to :: Rep (U1 p) x -> U1 p

Generic (a, b)

Defined in GHC.Generics

Associated Types

type Rep (a, b) :: Type -> Type

Methods

from :: (a, b) -> Rep (a, b) x

to :: Rep (a, b) x -> (a, b)

Generic (WrappedMonad m a)

Defined in Control.Applicative

Associated Types

type Rep (WrappedMonad m a) :: Type -> Type

Methods

from :: WrappedMonad m a -> Rep (WrappedMonad m a) x

to :: Rep (WrappedMonad m a) x -> WrappedMonad m a

Generic (Proxy t)

Defined in GHC.Generics

Associated Types

type Rep (Proxy t) :: Type -> Type

Methods

from :: Proxy t -> Rep (Proxy t) x

to :: Rep (Proxy t) x -> Proxy t

Generic (EvalStatus_ a b)

Defined in GHCi.Message

Associated Types

type Rep (EvalStatus_ a b) :: Type -> Type

Methods

from :: EvalStatus_ a b -> Rep (EvalStatus_ a b) x

to :: Rep (EvalStatus_ a b) x -> EvalStatus_ a b

Generic (Rec1 f p)

Defined in GHC.Generics

Associated Types

type Rep (Rec1 f p) :: Type -> Type

Methods

from :: Rec1 f p -> Rep (Rec1 f p) x

to :: Rep (Rec1 f p) x -> Rec1 f p

Generic (URec (Ptr ()) p)

Defined in GHC.Generics

Associated Types

type Rep (URec (Ptr ()) p) :: Type -> Type

Methods

from :: URec (Ptr ()) p -> Rep (URec (Ptr ()) p) x

to :: Rep (URec (Ptr ()) p) x -> URec (Ptr ()) p

Generic (URec Char p)

Defined in GHC.Generics

Associated Types

type Rep (URec Char p) :: Type -> Type

Methods

from :: URec Char p -> Rep (URec Char p) x

to :: Rep (URec Char p) x -> URec Char p

Generic (URec Double p)

Defined in GHC.Generics

Associated Types

type Rep (URec Double p) :: Type -> Type

Methods

from :: URec Double p -> Rep (URec Double p) x

to :: Rep (URec Double p) x -> URec Double p

Generic (URec Float p)

Defined in GHC.Generics

Associated Types

type Rep (URec Float p) :: Type -> Type

Methods

from :: URec Float p -> Rep (URec Float p) x

to :: Rep (URec Float p) x -> URec Float p

Generic (URec Int p)

Defined in GHC.Generics

Associated Types

type Rep (URec Int p) :: Type -> Type

Methods

from :: URec Int p -> Rep (URec Int p) x

to :: Rep (URec Int p) x -> URec Int p

Generic (URec Word p)

Defined in GHC.Generics

Associated Types

type Rep (URec Word p) :: Type -> Type

Methods

from :: URec Word p -> Rep (URec Word p) x

to :: Rep (URec Word p) x -> URec Word p

Generic (a, b, c)

Defined in GHC.Generics

Associated Types

type Rep (a, b, c) :: Type -> Type

Methods

from :: (a, b, c) -> Rep (a, b, c) x

to :: Rep (a, b, c) x -> (a, b, c)

Generic (WrappedArrow a b c)

Defined in Control.Applicative

Associated Types

type Rep (WrappedArrow a b c) :: Type -> Type

Methods

from :: WrappedArrow a b c -> Rep (WrappedArrow a b c) x

to :: Rep (WrappedArrow a b c) x -> WrappedArrow a b c

Generic (Const a b)

Defined in Data.Functor.Const

Associated Types

type Rep (Const a b) :: Type -> Type

Methods

from :: Const a b -> Rep (Const a b) x

to :: Rep (Const a b) x -> Const a b

Generic (K1 i c p)

Defined in GHC.Generics

Associated Types

type Rep (K1 i c p) :: Type -> Type

Methods

from :: K1 i c p -> Rep (K1 i c p) x

to :: Rep (K1 i c p) x -> K1 i c p

Generic ((f :+: g) p)

Defined in GHC.Generics

Associated Types

type Rep ((f :+: g) p) :: Type -> Type

Methods

from :: (f :+: g) p -> Rep ((f :+: g) p) x

to :: Rep ((f :+: g) p) x -> (f :+: g) p

Generic ((f :*: g) p)

Defined in GHC.Generics

Associated Types

type Rep ((f :*: g) p) :: Type -> Type

Methods

from :: (f :*: g) p -> Rep ((f :*: g) p) x

to :: Rep ((f :*: g) p) x -> (f :*: g) p

Generic (a, b, c, d)

Defined in GHC.Generics

Associated Types

type Rep (a, b, c, d) :: Type -> Type

Methods

from :: (a, b, c, d) -> Rep (a, b, c, d) x

to :: Rep (a, b, c, d) x -> (a, b, c, d)

Generic (M1 i c f p)

Defined in GHC.Generics

Associated Types

type Rep (M1 i c f p) :: Type -> Type

Methods

from :: M1 i c f p -> Rep (M1 i c f p) x

to :: Rep (M1 i c f p) x -> M1 i c f p

Generic ((f :.: g) p)

Defined in GHC.Generics

Associated Types

type Rep ((f :.: g) p) :: Type -> Type

Methods

from :: (f :.: g) p -> Rep ((f :.: g) p) x

to :: Rep ((f :.: g) p) x -> (f :.: g) p

Generic (a, b, c, d, e)

Defined in GHC.Generics

Associated Types

type Rep (a, b, c, d, e) :: Type -> Type

Methods

from :: (a, b, c, d, e) -> Rep (a, b, c, d, e) x

to :: Rep (a, b, c, d, e) x -> (a, b, c, d, e)

Generic (a, b, c, d, e, f)

Defined in GHC.Generics

Associated Types

type Rep (a, b, c, d, e, f) :: Type -> Type

Methods

from :: (a, b, c, d, e, f) -> Rep (a, b, c, d, e, f) x

to :: Rep (a, b, c, d, e, f) x -> (a, b, c, d, e, f)

Generic (a, b, c, d, e, f, g)

Defined in GHC.Generics

Associated Types

type Rep (a, b, c, d, e, f, g) :: Type -> Type

Methods

from :: (a, b, c, d, e, f, g) -> Rep (a, b, c, d, e, f, g) x

to :: Rep (a, b, c, d, e, f, g) x -> (a, b, c, d, e, f, g)

class Monad m => MonadIO (m :: Type -> Type) where

Monads in which IO computations may be embedded. Any monad built by applying a sequence of monad transformers to the IO monad will be an instance of this class.

Instances should satisfy the following laws, which state that liftIO is a transformer of monads:

• liftIO . return = return

• liftIO (m >>= f) = liftIO m >>= (liftIO . f)

Methods

liftIO :: IO a -> m a

Lift a computation from the IO monad.

Instances

MonadIO IO

Since: base-4.9.0.0

Defined in Control.Monad.IO.Class

Methods

liftIO :: IO a -> IO a

MonadIO Hsc

Defined in HscTypes

Methods

liftIO :: IO a -> Hsc a

MonadIO CoreM

Defined in CoreMonad

Methods

liftIO :: IO a -> CoreM a

class NFData a

A class of types that can be fully evaluated.

Since: deepseq-1.1.0.0

Instances

NFData Bool

Defined in Control.DeepSeq

Methods

rnf :: Bool -> ()

NFData Char

Defined in Control.DeepSeq

Methods

rnf :: Char -> ()

NFData Double

Defined in Control.DeepSeq

Methods

rnf :: Double -> ()

NFData Float

Defined in Control.DeepSeq

Methods

rnf :: Float -> ()

NFData Int

Defined in Control.DeepSeq

Methods

rnf :: Int -> ()

NFData Int8

Defined in Control.DeepSeq

Methods

rnf :: Int8 -> ()

NFData Int16

Defined in Control.DeepSeq

Methods

rnf :: Int16 -> ()

NFData Int32

Defined in Control.DeepSeq

Methods

rnf :: Int32 -> ()

NFData Int64

Defined in Control.DeepSeq

Methods

rnf :: Int64 -> ()

NFData Integer

Defined in Control.DeepSeq

Methods

rnf :: Integer -> ()

NFData Natural

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Natural -> ()

NFData Ordering

Defined in Control.DeepSeq

Methods

rnf :: Ordering -> ()

NFData Word

Defined in Control.DeepSeq

Methods

rnf :: Word -> ()

NFData Word8

Defined in Control.DeepSeq

Methods

rnf :: Word8 -> ()

NFData Word16

Defined in Control.DeepSeq

Methods

rnf :: Word16 -> ()

NFData Word32

Defined in Control.DeepSeq

Methods

rnf :: Word32 -> ()

NFData Word64

Defined in Control.DeepSeq

Methods

rnf :: Word64 -> ()

NFData CallStack

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: CallStack -> ()

NFData ()

Defined in Control.DeepSeq

Methods

rnf :: () -> ()

NFData TyCon

NOTE: Prior to deepseq-1.4.4.0 this instance was only defined for base-4.8.0.0 and later.

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: TyCon -> ()

NFData Void

Defined as rnf = absurd.

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Void -> ()

NFData Unique

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Unique -> ()

NFData Version

Since: deepseq-1.3.0.0

Defined in Control.DeepSeq

Methods

rnf :: Version -> ()

NFData ThreadId

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: ThreadId -> ()

NFData ExitCode

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: ExitCode -> ()

NFData MaskingState

Since: deepseq-1.4.4.0

Defined in Control.DeepSeq

Methods

rnf :: MaskingState -> ()

NFData TypeRep

NOTE: Prior to deepseq-1.4.4.0 this instance was only defined for base-4.8.0.0 and later.

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: TypeRep -> ()

NFData All

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: All -> ()

NFData Any

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Any -> ()

NFData CChar

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CChar -> ()

NFData CSChar

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CSChar -> ()

NFData CUChar

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CUChar -> ()

NFData CShort

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CShort -> ()

NFData CUShort

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CUShort -> ()

NFData CInt

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CInt -> ()

NFData CUInt

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CUInt -> ()

NFData CLong

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CLong -> ()

NFData CULong

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CULong -> ()

NFData CLLong

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CLLong -> ()

NFData CULLong

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CULLong -> ()

NFData CBool

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

rnf :: CBool -> ()

NFData CFloat

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CFloat -> ()

NFData CDouble

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CDouble -> ()

NFData CPtrdiff

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CPtrdiff -> ()

NFData CSize

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CSize -> ()

NFData CWchar

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CWchar -> ()

NFData CSigAtomic

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CSigAtomic -> ()

NFData CClock

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CClock -> ()

NFData CTime

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CTime -> ()

NFData CUSeconds

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CUSeconds -> ()

NFData CSUSeconds

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CSUSeconds -> ()

NFData CFile

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CFile -> ()

NFData CFpos

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CFpos -> ()

NFData CJmpBuf

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CJmpBuf -> ()

NFData CIntPtr

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CIntPtr -> ()

NFData CUIntPtr

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CUIntPtr -> ()

NFData CIntMax

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CIntMax -> ()

NFData CUIntMax

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: CUIntMax -> ()

NFData Fingerprint

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Fingerprint -> ()

NFData SrcLoc

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: SrcLoc -> ()

NFData ByteString

Defined in Data.ByteString.Internal

Methods

rnf :: ByteString -> ()

NFData FFIInfo

Defined in ByteCodeTypes

Methods

rnf :: FFIInfo -> ()

NFData ItblPtr

Defined in ByteCodeTypes

Methods

rnf :: ItblPtr -> ()

NFData UnlinkedBCO

Defined in ByteCodeTypes

Methods

rnf :: UnlinkedBCO -> ()

NFData BCOPtr

Defined in ByteCodeTypes

Methods

rnf :: BCOPtr -> ()

NFData BCONPtr

Defined in ByteCodeTypes

Methods

rnf :: BCONPtr -> ()

NFData SrcSpan

Defined in SrcLoc

Methods

rnf :: SrcSpan -> ()

NFData Module

Defined in Module

Methods

rnf :: Module -> ()

NFData ModuleName

Defined in Module

Methods

rnf :: ModuleName -> ()

NFData UnitId

Defined in Module

Methods

rnf :: UnitId -> ()

NFData FastZString

Defined in FastString

Methods

rnf :: FastZString -> ()

NFData OccName

Defined in OccName

Methods

rnf :: OccName -> ()

NFData Name

Defined in Name

Methods

rnf :: Name -> ()

NFData ZonedTime

Defined in Data.Time.LocalTime.Internal.ZonedTime

Methods

rnf :: ZonedTime -> ()

NFData LocalTime

Defined in Data.Time.LocalTime.Internal.LocalTime

Methods

rnf :: LocalTime -> ()

NFData NameSort

Defined in Name

Methods

rnf :: NameSort -> ()

NFData a => NFData [a]

Defined in Control.DeepSeq

Methods

rnf :: [a] -> ()

NFData a => NFData (Maybe a)

Defined in Control.DeepSeq

Methods

rnf :: Maybe a -> ()

NFData a => NFData (Ratio a)

Defined in Control.DeepSeq

Methods

rnf :: Ratio a -> ()

NFData (Ptr a)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: Ptr a -> ()

NFData (FunPtr a)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: FunPtr a -> ()

NFData a => NFData (Complex a)

Defined in Control.DeepSeq

Methods

rnf :: Complex a -> ()

NFData (Fixed a)

Since: deepseq-1.3.0.0

Defined in Control.DeepSeq

Methods

rnf :: Fixed a -> ()

NFData a => NFData (Min a)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: Min a -> ()

NFData a => NFData (Max a)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: Max a -> ()

NFData a => NFData (First a)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: First a -> ()

NFData a => NFData (Last a)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: Last a -> ()

NFData m => NFData (WrappedMonoid m)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: WrappedMonoid m -> ()

NFData a => NFData (Option a)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: Option a -> ()

NFData (StableName a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: StableName a -> ()

NFData a => NFData (ZipList a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: ZipList a -> ()

NFData a => NFData (Identity a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Identity a -> ()

NFData (IORef a)

NOTE: Only strict in the reference and not the referenced value.

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: IORef a -> ()

NFData a => NFData (First a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: First a -> ()

NFData a => NFData (Last a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Last a -> ()

NFData a => NFData (Dual a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Dual a -> ()

NFData a => NFData (Sum a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Sum a -> ()

NFData a => NFData (Product a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Product a -> ()

NFData a => NFData (Down a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Down a -> ()

NFData (MVar a)

NOTE: Only strict in the reference and not the referenced value.

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: MVar a -> ()

NFData a => NFData (NonEmpty a)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: NonEmpty a -> ()

NFData (a -> b)

This instance is for convenience and consistency with seq. This assumes that WHNF is equivalent to NF for functions.

Since: deepseq-1.3.0.0

Defined in Control.DeepSeq

Methods

rnf :: (a -> b) -> ()

(NFData a, NFData b) => NFData (Either a b)

Defined in Control.DeepSeq

Methods

rnf :: Either a b -> ()

(NFData a, NFData b) => NFData (a, b)

Defined in Control.DeepSeq

Methods

rnf :: (a, b) -> ()

(NFData a, NFData b) => NFData (Array a b)

Defined in Control.DeepSeq

Methods

rnf :: Array a b -> ()

(NFData a, NFData b) => NFData (Arg a b)

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: Arg a b -> ()

NFData (Proxy a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Proxy a -> ()

NFData (STRef s a)

NOTE: Only strict in the reference and not the referenced value.

Since: deepseq-1.4.2.0

Defined in Control.DeepSeq

Methods

rnf :: STRef s a -> ()

(NFData a1, NFData a2, NFData a3) => NFData (a1, a2, a3)

Defined in Control.DeepSeq

Methods

rnf :: (a1, a2, a3) -> ()

NFData a => NFData (Const a b)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Const a b -> ()

NFData (a :~: b)

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

rnf :: (a :~: b) -> ()

(NFData a1, NFData a2, NFData a3, NFData a4) => NFData (a1, a2, a3, a4)

Defined in Control.DeepSeq

Methods

rnf :: (a1, a2, a3, a4) -> ()

(NFData1 f, NFData1 g, NFData a) => NFData (Product f g a)

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

rnf :: Product f g a -> ()

(NFData1 f, NFData1 g, NFData a) => NFData (Sum f g a)

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

rnf :: Sum f g a -> ()

NFData (a :~~: b)

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

rnf :: (a :~~: b) -> ()

(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5) => NFData (a1, a2, a3, a4, a5)

Defined in Control.DeepSeq

Methods

rnf :: (a1, a2, a3, a4, a5) -> ()

(NFData1 f, NFData1 g, NFData a) => NFData (Compose f g a)

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

rnf :: Compose f g a -> ()

(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6) => NFData (a1, a2, a3, a4, a5, a6)

Defined in Control.DeepSeq

Methods

rnf :: (a1, a2, a3, a4, a5, a6) -> ()

(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7) => NFData (a1, a2, a3, a4, a5, a6, a7)

Defined in Control.DeepSeq

Methods

rnf :: (a1, a2, a3, a4, a5, a6, a7) -> ()

(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8) => NFData (a1, a2, a3, a4, a5, a6, a7, a8)

Defined in Control.DeepSeq

Methods

rnf :: (a1, a2, a3, a4, a5, a6, a7, a8) -> ()

(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8, NFData a9) => NFData (a1, a2, a3, a4, a5, a6, a7, a8, a9)

Defined in Control.DeepSeq

Methods

rnf :: (a1, a2, a3, a4, a5, a6, a7, a8, a9) -> ()

data Proxy (t :: k) :: forall k. k -> Type

Proxy is a type that holds no data, but has a phantom parameter of arbitrary type (or even kind). Its use is to provide type information, even though there is no value available of that type (or it may be too costly to create one).

Historically, Proxy :: Proxy a is a safer alternative to the 'undefined :: a' idiom.

>>> Proxy :: Proxy (Void, Int -> Int)
Proxy

Proxy can even hold types of higher kinds,

>>> Proxy :: Proxy Either
Proxy

>>> Proxy :: Proxy Functor
Proxy

>>> Proxy :: Proxy complicatedStructure
Proxy

Constructors

Proxy

Instances

Generic1 (Proxy :: k -> Type)

Defined in GHC.Generics

Associated Types

type Rep1 Proxy :: k -> Type

Methods

from1 :: Proxy a -> Rep1 Proxy a

to1 :: Rep1 Proxy a -> Proxy a

Monad (Proxy :: Type -> Type)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

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

(>>) :: Proxy a -> Proxy b -> Proxy b

return :: a -> Proxy a

fail :: String -> Proxy a

Functor (Proxy :: Type -> Type)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

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

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

Applicative (Proxy :: Type -> Type)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

pure :: a -> Proxy a

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

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

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

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

Foldable (Proxy :: Type -> Type)

Since: base-4.7.0.0

Defined in Data.Foldable

Methods

fold :: Monoid m => Proxy m -> m

foldMap :: Monoid m => (a -> m) -> Proxy a -> m

foldr :: (a -> b -> b) -> b -> Proxy a -> b

foldr' :: (a -> b -> b) -> b -> Proxy a -> b

foldl :: (b -> a -> b) -> b -> Proxy a -> b

foldl' :: (b -> a -> b) -> b -> Proxy a -> b

foldr1 :: (a -> a -> a) -> Proxy a -> a

foldl1 :: (a -> a -> a) -> Proxy a -> a

toList :: Proxy a -> [a]

null :: Proxy a -> Bool

length :: Proxy a -> Int

elem :: Eq a => a -> Proxy a -> Bool

maximum :: Ord a => Proxy a -> a

minimum :: Ord a => Proxy a -> a

sum :: Num a => Proxy a -> a

product :: Num a => Proxy a -> a

Traversable (Proxy :: Type -> Type)

Since: base-4.7.0.0

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b)

sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a)

mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b)

sequence :: Monad m => Proxy (m a) -> m (Proxy a)

Alternative (Proxy :: Type -> Type)

Since: base-4.9.0.0

Defined in Data.Proxy

Methods

empty :: Proxy a

(<|>) :: Proxy a -> Proxy a -> Proxy a

some :: Proxy a -> Proxy [a]

many :: Proxy a -> Proxy [a]

MonadPlus (Proxy :: Type -> Type)

Since: base-4.9.0.0

Defined in Data.Proxy

Methods

mzero :: Proxy a

mplus :: Proxy a -> Proxy a -> Proxy a

NFData1 (Proxy :: Type -> Type)

Since: deepseq-1.4.3.0

Defined in Control.DeepSeq

Methods

liftRnf :: (a -> ()) -> Proxy a -> ()

Bounded (Proxy t)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

minBound :: Proxy t

maxBound :: Proxy t

Enum (Proxy s)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

succ :: Proxy s -> Proxy s

pred :: Proxy s -> Proxy s

toEnum :: Int -> Proxy s

fromEnum :: Proxy s -> Int

enumFrom :: Proxy s -> [Proxy s]

enumFromThen :: Proxy s -> Proxy s -> [Proxy s]

enumFromTo :: Proxy s -> Proxy s -> [Proxy s]

enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s]

Eq (Proxy s)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

(==) :: Proxy s -> Proxy s -> Bool

(/=) :: Proxy s -> Proxy s -> Bool

Ord (Proxy s)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

compare :: Proxy s -> Proxy s -> Ordering

(<) :: Proxy s -> Proxy s -> Bool

(<=) :: Proxy s -> Proxy s -> Bool

(>) :: Proxy s -> Proxy s -> Bool

(>=) :: Proxy s -> Proxy s -> Bool

max :: Proxy s -> Proxy s -> Proxy s

min :: Proxy s -> Proxy s -> Proxy s

Read (Proxy t)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

readsPrec :: Int -> ReadS (Proxy t)

readList :: ReadS [Proxy t]

readPrec :: ReadPrec (Proxy t)

readListPrec :: ReadPrec [Proxy t]

Show (Proxy s)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

showsPrec :: Int -> Proxy s -> ShowS

show :: Proxy s -> String

showList :: [Proxy s] -> ShowS

Ix (Proxy s)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

range :: (Proxy s, Proxy s) -> [Proxy s]

index :: (Proxy s, Proxy s) -> Proxy s -> Int

unsafeIndex :: (Proxy s, Proxy s) -> Proxy s -> Int

inRange :: (Proxy s, Proxy s) -> Proxy s -> Bool

rangeSize :: (Proxy s, Proxy s) -> Int

unsafeRangeSize :: (Proxy s, Proxy s) -> Int

Generic (Proxy t)

Defined in GHC.Generics

Associated Types

type Rep (Proxy t) :: Type -> Type

Methods

from :: Proxy t -> Rep (Proxy t) x

to :: Rep (Proxy t) x -> Proxy t

Semigroup (Proxy s)

Since: base-4.9.0.0

Defined in Data.Proxy

Methods

(<>) :: Proxy s -> Proxy s -> Proxy s

sconcat :: NonEmpty (Proxy s) -> Proxy s

stimes :: Integral b => b -> Proxy s -> Proxy s

Monoid (Proxy s)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

mempty :: Proxy s

mappend :: Proxy s -> Proxy s -> Proxy s

mconcat :: [Proxy s] -> Proxy s

NFData (Proxy a)

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Proxy a -> ()

type Rep1 (Proxy :: k -> Type)

Since: base-4.6.0.0

Defined in GHC.Generics

type Rep1 (Proxy :: k -> Type) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: k -> Type))

type Rep (Proxy t)

Since: base-4.6.0.0

Defined in GHC.Generics

type Rep (Proxy t) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: Type -> Type))

data Text

A space efficient, packed, unboxed Unicode text type.

Instances

type Item Text

Defined in Data.Text

type Item Text = Char

type Type = Type

The kind of types with values. For example Int :: Type.

module HumblePrelude