base-4.20.2.0: Core data structures and operations

License | BSD-style (see the LICENSE file in the distribution)
Maintainer | libraries@haskell.org
Stability | stable
Portability | not portable
Safe Haskell | Trustworthy
Language | Haskell2010

Data.Kind

Description

Basic kinds

Since: base-4.9.0.0

Synopsis

- type Type = TYPE LiftedRep
- type Constraint = CONSTRAINT LiftedRep
- data FUN

# Documentation

type Type = TYPE LiftedRep Source #

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

type Constraint = CONSTRAINT LiftedRep Source #

The kind of lifted constraints

data FUN Source #

The builtin function type, written in infix form as `a % m -> b`. Values of this type are functions taking inputs of type `a` and producing outputs of type `b`. The multiplicity of the input is `m`.

Note that ``FUN` m a b` permits representation polymorphism in both `a` and `b`, so that types like ``Int#` -> `Int#`` can still be well-kinded.

#### Instances

Instances details

Category (->) | Since: base-3.0
Instance details Defined in GHC.Internal.Control.Category Methods id :: a -> a Source # (.) :: (b -> c) -> (a -> b) -> a -> c Source #
(PrintfArg a, HPrintfType r) => HPrintfType (a -> r) Source # | Since: base-2.1
Instance details Defined in Text.Printf Methods hspr :: Handle -> String -> [UPrintf] -> a -> r
(PrintfArg a, PrintfType r) => PrintfType (a -> r) Source # | Since: base-2.1
Instance details Defined in Text.Printf Methods spr :: String -> [UPrintf] -> a -> r
Monoid b => Monoid (a -> b) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods mempty :: a -> b Source # mappend :: (a -> b) -> (a -> b) -> a -> b Source # mconcat :: [a -> b] -> a -> b Source #
Semigroup b => Semigroup (a -> b) | Since: base-4.9.0.0
Instance details Defined in GHC.Internal.Base Methods (<>) :: (a -> b) -> (a -> b) -> a -> b Source # sconcat :: NonEmpty (a -> b) -> a -> b Source # stimes :: Integral b0 => b0 -> (a -> b) -> a -> b Source #
Arrow (->) | Since: base-2.1
Instance details Defined in GHC.Internal.Control.Arrow Methods arr :: (b -> c) -> b -> c Source # first :: (b -> c) -> (b, d) -> (c, d) Source # second :: (b -> c) -> (d, b) -> (d, c) Source # (***) :: (b -> c) -> (b' -> c') -> (b, b') -> (c, c') Source # (&&&) :: (b -> c) -> (b -> c') -> b -> (c, c') Source #
ArrowApply (->) | Since: base-2.1
Instance details Defined in GHC.Internal.Control.Arrow Methods app :: (b -> c, b) -> c Source #
ArrowChoice (->) | Since: base-2.1
Instance details Defined in GHC.Internal.Control.Arrow Methods left :: (b -> c) -> Either b d -> Either c d Source # right :: (b -> c) -> Either d b -> Either d c Source # (+++) :: (b -> c) -> (b' -> c') -> Either b b' -> Either c c' Source # (|||) :: (b -> d) -> (c -> d) -> Either b c -> d Source #
ArrowLoop (->) | Since: base-2.1
Instance details Defined in GHC.Internal.Control.Arrow Methods loop :: ((b, d) -> (c, d)) -> b -> c Source #
Show (a -> b) Source # | Since: base-2.1
Instance details Defined in Text.Show.Functions Methods showsPrec :: Int -> (a -> b) -> ShowS Source # show :: (a -> b) -> String Source # showList :: [a -> b] -> ShowS Source #
Applicative ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods pure :: a -> r -> a Source # (<*>) :: (r -> (a -> b)) -> (r -> a) -> r -> b Source # liftA2 :: (a -> b -> c) -> (r -> a) -> (r -> b) -> r -> c Source # (*>) :: (r -> a) -> (r -> b) -> r -> b Source # (<*) :: (r -> a) -> (r -> b) -> r -> a Source #
Functor ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods fmap :: (a -> b) -> (r -> a) -> r -> b Source # (<$) :: a -> (r -> b) -> r -> a Source #
Monad ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Base Methods (>>=) :: (r -> a) -> (a -> r -> b) -> r -> b Source # (>>) :: (r -> a) -> (r -> b) -> r -> b Source # return :: a -> r -> a Source #
MonadFix ((->) r) | Since: base-2.1
Instance details Defined in GHC.Internal.Control.Monad.Fix Methods mfix :: (a -> r -> a) -> r -> a Source #