The kind of types with lifted values. For example Int :: Type.
Modulererebase-1.21.2Haskell2010
Data.Kind
- 3 types
- Packagererebase-1.21.2
- Exports3
- LanguageHaskell2010
- LicenceMIT
- SourceTypes.hs
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 permits representation polymorphism in both
FUN m a ba and b, so that types like can still be
well-kinded.Int# -> Int#
Instances57Category, Semigroupoid, Ob, MonadReader, FunctorWithIndex, ComonadTraced, …
Category (->)Defined in ghc-internal-9.1003.0 · GHC.Internal.Control.CategorySemigroupoid (->)Defined in semigroupoids-6.0.1 · Data.SemigroupoidOb (->) aDefined in semigroupoids-6.0.1 · Data.Semigroupoid.ObMonadReader r ((->) r)Defined in mtl-2.3.1 · Control.Monad.Reader.ClassFunctorWithIndex r ((->) r)Defined in indexed-traversable-0.1.4 · WithIndexMonoid m => ComonadTraced m ((->) m)Defined in comonad-5.0.9 · Control.Comonad.Traced.ClassAdjunction (Tuple2 e) ((->) e)Defined in adjunctions-4.4.3 · Data.Functor.AdjunctionShow (a -> b)Defined in base-4.20.2.0 · Text.Show.Functions · orphanSemigroup b => Semigroup (a -> b)Defined in ghc-internal-9.1003.0 · GHC.Internal.BaseMonoid b => Monoid (a -> b)Defined in ghc-internal-9.1003.0 · GHC.Internal.BaseArrow (->)Defined in ghc-internal-9.1003.0 · GHC.Internal.Control.ArrowArrowApply (->)Defined in ghc-internal-9.1003.0 · GHC.Internal.Control.ArrowArrowChoice (->)Defined in ghc-internal-9.1003.0 · GHC.Internal.Control.ArrowArrowLoop (->)Defined in ghc-internal-9.1003.0 · GHC.Internal.Control.Arrow(PrintfArg a, HPrintfType r) => HPrintfType (a -> r)Defined in base-4.20.2.0 · Text.Printf(PrintfArg a, PrintfType r) => PrintfType (a -> r)Defined in base-4.20.2.0 · Text.PrintfNFData (a -> b)Defined in deepseq-1.5.0.0 · Control.DeepSeqThis instance is for convenience and consistency with seq. This assumes that WHNF is equivalent to NF for functions.
Choice (->)Defined in profunctors-5.6.3 · Data.Profunctor.ChoiceCochoice (->)Defined in profunctors-5.6.3 · Data.Profunctor.ChoiceClosed (->)Defined in profunctors-5.6.3 · Data.Profunctor.ClosedMapping (->)Defined in profunctors-5.6.3 · Data.Profunctor.MappingCostrong (->)Defined in profunctors-5.6.3 · Data.Profunctor.StrongStrong (->)Defined in profunctors-5.6.3 · Data.Profunctor.StrongProfunctor (->)Defined in profunctors-5.6.3 · Data.Profunctor.UnsafeTraversing (->)Defined in profunctors-5.6.3 · Data.Profunctor.TraversingCorepresentable (->)Defined in profunctors-5.6.3 · Data.Profunctor.RepRepresentable (->)Defined in profunctors-5.6.3 · Data.Profunctor.RepInvariant2 (->)Defined in invariant-0.6.4 · Data.Functor.InvariantAbelian b => Abelian (a -> b)Defined in groups-0.5.3 · Data.GroupGroup b => Group (a -> b)Defined in groups-0.5.3 · Data.GroupCosieve (->) IdentityDefined in profunctors-5.6.3 · Data.Profunctor.SieveSieve (->) IdentityDefined in profunctors-5.6.3 · Data.Profunctor.SieveMonad ((->) r)Defined in ghc-internal-9.1003.0 · GHC.Internal.BaseFunctor ((->) r)Defined in ghc-internal-9.1003.0 · GHC.Internal.BaseMonadFix ((->) r)Defined in ghc-internal-9.1003.0 · GHC.Internal.Control.Monad.FixApplicative ((->) r)Defined in ghc-internal-9.1003.0 · GHC.Internal.BaseDistributive ((->) e)Defined in distributive-0.6.2.1 · Data.DistributiveMonoid m => Comonad ((->) m)Defined in comonad-5.0.9 · Control.ComonadMonoid m => ComonadApply ((->) m)Defined in comonad-5.0.9 · Control.ComonadApply ((->) m)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.ClassBind ((->) m)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.ClassSemigroup m => Extend ((->) m)Defined in semigroupoids-6.0.1 · Data.Functor.ExtendRepresentable ((->) e)Defined in adjunctions-4.4.3 · Data.Functor.RepInvariant ((->) a)Defined in invariant-0.6.4 · Data.Functor.InvariantSelective ((->) a)Defined in selective-0.7.0.1 · Control.SelectiveIndexable ((->) a)Defined in keys-3.12.3 · Data.KeyKeyed ((->) a)Defined in keys-3.12.3 · Data.KeyLookup ((->) a)Defined in keys-3.12.3 · Data.KeyZip ((->) a)Defined in keys-3.12.3 · Data.KeyZipWithKey ((->) a)Defined in keys-3.12.3 · Data.KeyDefault m => Copointed ((->) m)Defined in pointed-5.0.4 · Data.CopointedPointed ((->) e)Defined in pointed-5.0.4 · Data.PointedMonadBase ((->) r) ((->) r)Defined in transformers-base-0.4.6 · Control.Monad.Basetype Corep (->) = IdentityDefined in profunctors-5.6.3 · Data.Profunctor.Reptype Rep (->) = IdentityDefined in profunctors-5.6.3 · Data.Profunctor.Reptype Rep ((->) e) = eDefined in adjunctions-4.4.3 · Data.Functor.Reptype Key ((->) a) = aDefined in keys-3.12.3 · Data.Key
The kind of lifted constraints