Copyright	(c) The University of Glasgow CWI 2001--2004
License	BSD-style (see the file libraries/base/LICENSE)
Maintainer	libraries@haskell.org
Stability	experimental
Portability	portable
Safe Haskell	Trustworthy
Language	Haskell2010

Data.Typeable

Contents

Description

TheTypeable class reifies types to some extent by associating type representations to types. These type representations can be compared, and one can in turn define a type-safe cast operation. To this end, an unsafe cast is guarded by a test for type (representation) equivalence. The moduleData.Dynamic uses Typeable for an implementation of dynamics. The moduleData.Data uses Typeable and type-safe cast (but not dynamics) to support the "Scrap your boilerplate" style of generic programming.

Compatibility Notes

Since GHC 8.2, GHC has supported type-indexed type representations.Data.Typeable provides type representations which are qualified over this index, providing an interface very similar to theTypeable notion seen in previous releases. For the type-indexed interface, seeType.Reflection.

Since GHC 7.8,Typeable is poly-kinded. The changes required for this might break some old programs involvingTypeable. More details on this, including how to fix your code, can be found on thePolyTypeable wiki page

Synopsis

classTypeable (a :: k)
typeOf ::forall a.Typeable a => a ->TypeRep
typeRep ::forall proxy a.Typeable a => proxy a ->TypeRep
data a:~: bwhere
- Refl :: a:~: a
data (a :: k1):~~: (b :: k2)where
- HRefl :: a:~~: a
cast ::forall a b. (Typeable a,Typeable b) => a ->Maybe b
eqT ::forall a b. (Typeable a,Typeable b) =>Maybe (a:~: b)
gcast ::forall a b c. (Typeable a,Typeable b) => c a ->Maybe (c b)
gcast1 ::forall c t t' a. (Typeable t,Typeable t') => c (t a) ->Maybe (c (t' a))
gcast2 ::forall c t t' a b. (Typeable t,Typeable t') => c (t a b) ->Maybe (c (t' a b))
dataProxy t =Proxy
typeTypeRep =SomeTypeRep
rnfTypeRep ::TypeRep -> ()
showsTypeRep ::TypeRep ->ShowS
mkFunTy ::TypeRep ->TypeRep ->TypeRep
funResultTy ::TypeRep ->TypeRep ->Maybe TypeRep
splitTyConApp ::TypeRep -> (TyCon, [TypeRep])
typeRepArgs ::TypeRep -> [TypeRep]
typeRepTyCon ::TypeRep ->TyCon
typeRepFingerprint ::TypeRep ->Fingerprint
dataTyCon
tyConPackage ::TyCon ->String
tyConModule ::TyCon ->String
tyConName ::TyCon ->String
rnfTyCon ::TyCon -> ()
tyConFingerprint ::TyCon ->Fingerprint
typeOf1 ::forall t (a ::Type).Typeable t => t a ->TypeRep
typeOf2 ::forall t (a ::Type) (b ::Type).Typeable t => t a b ->TypeRep
typeOf3 ::forall t (a ::Type) (b ::Type) (c ::Type).Typeable t => t a b c ->TypeRep
typeOf4 ::forall t (a ::Type) (b ::Type) (c ::Type) (d ::Type).Typeable t => t a b c d ->TypeRep
typeOf5 ::forall t (a ::Type) (b ::Type) (c ::Type) (d ::Type) (e ::Type).Typeable t => t a b c d e ->TypeRep
typeOf6 ::forall t (a ::Type) (b ::Type) (c ::Type) (d ::Type) (e ::Type) (f ::Type).Typeable t => t a b c d e f ->TypeRep
typeOf7 ::forall t (a ::Type) (b ::Type) (c ::Type) (d ::Type) (e ::Type) (f ::Type) (g ::Type).Typeable t => t a b c d e f g ->TypeRep

The Typeable class

classTypeable (a :: k)Source #

The classTypeable allows a concrete representation of a type to be calculated.

Minimal complete definition

typeRep#

typeOf ::forall a.Typeable a => a ->TypeRep Source #

Observe a type representation for the type of a value.

typeRep ::forall proxy a.Typeable a => proxy a ->TypeRep Source #

Takes a value of typea and returns a concrete representation of that type.

Since: 4.7.0.0

Propositional equality

data a:~: bwhereinfix 4Source #

Propositional equality. Ifa :~: b is inhabited by some terminating value, then the typea is the same as the typeb. To use this equality in practice, pattern-match on thea :~: b to get out theRefl constructor; in the body of the pattern-match, the compiler knows thata ~ b.

Since: 4.7.0.0

Constructors

Refl :: a:~: a

Instances

Category ((:~:) :: k -> k ->Type)Source #	Since: 4.7.0.0
Instance details Defined inControl.Category Methods id :: a:~: aSource # (.) :: (b:~: c) -> (a:~: b) -> a:~: cSource #
TestEquality ((:~:) a :: k ->Type)Source #	Since: 4.7.0.0
Instance details Defined inData.Type.Equality Methods testEquality :: (a:~: a0) -> (a:~: b) ->Maybe (a0:~: b)Source #
TestCoercion ((:~:) a :: k ->Type)Source #	Since: 4.7.0.0
Instance details Defined inData.Type.Coercion Methods testCoercion :: (a:~: a0) -> (a:~: b) ->Maybe (Coercion a0 b)Source #
a ~ b =>Bounded (a:~: b)Source #	Since: 4.7.0.0
Instance details Defined inData.Type.Equality Methods minBound :: a:~: bSource # maxBound :: a:~: bSource #
a ~ b =>Enum (a:~: b)Source #	Since: 4.7.0.0
Instance details Defined inData.Type.Equality Methods succ :: (a:~: b) -> a:~: bSource # pred :: (a:~: b) -> a:~: bSource # toEnum ::Int -> a:~: bSource # fromEnum :: (a:~: b) ->Int Source # enumFrom :: (a:~: b) -> [a:~: b]Source # enumFromThen :: (a:~: b) -> (a:~: b) -> [a:~: b]Source # enumFromTo :: (a:~: b) -> (a:~: b) -> [a:~: b]Source # enumFromThenTo :: (a:~: b) -> (a:~: b) -> (a:~: b) -> [a:~: b]Source #
Eq (a:~: b)Source #	Since: 4.7.0.0
Instance details Defined inData.Type.Equality Methods (==) :: (a:~: b) -> (a:~: b) ->Bool # (/=) :: (a:~: b) -> (a:~: b) ->Bool #
(a ~ b,Data a) =>Data (a:~: b)Source #	Since: 4.7.0.0
Instance details Defined inData.Data Methods gfoldl :: (forall d b0.Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> (a:~: b) -> c (a:~: b)Source # gunfold :: (forall b0 r.Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) ->Constr -> c (a:~: b)Source # toConstr :: (a:~: b) ->Constr Source # dataTypeOf :: (a:~: b) ->DataType Source # dataCast1 ::Typeable t => (forall d.Data d => c (t d)) ->Maybe (c (a:~: b))Source # dataCast2 ::Typeable t => (forall d e. (Data d,Data e) => c (t d e)) ->Maybe (c (a:~: b))Source # gmapT :: (forall b0.Data b0 => b0 -> b0) -> (a:~: b) -> a:~: bSource # gmapQl :: (r -> r' -> r) -> r -> (forall d.Data d => d -> r') -> (a:~: b) -> rSource # gmapQr :: (r' -> r -> r) -> r -> (forall d.Data d => d -> r') -> (a:~: b) -> rSource # gmapQ :: (forall d.Data d => d -> u) -> (a:~: b) -> [u]Source # gmapQi ::Int -> (forall d.Data d => d -> u) -> (a:~: b) -> uSource # gmapM ::Monad m => (forall d.Data d => d -> m d) -> (a:~: b) -> m (a:~: b)Source # gmapMp ::MonadPlus m => (forall d.Data d => d -> m d) -> (a:~: b) -> m (a:~: b)Source # gmapMo ::MonadPlus m => (forall d.Data d => d -> m d) -> (a:~: b) -> m (a:~: b)Source #
Ord (a:~: b)Source #	Since: 4.7.0.0
Instance details Defined inData.Type.Equality Methods compare :: (a:~: b) -> (a:~: b) ->Ordering # (<) :: (a:~: b) -> (a:~: b) ->Bool # (<=) :: (a:~: b) -> (a:~: b) ->Bool # (>) :: (a:~: b) -> (a:~: b) ->Bool # (>=) :: (a:~: b) -> (a:~: b) ->Bool # max :: (a:~: b) -> (a:~: b) -> a:~: b# min :: (a:~: b) -> (a:~: b) -> a:~: b#
a ~ b =>Read (a:~: b)Source #	Since: 4.7.0.0
Instance details Defined inData.Type.Equality Methods readsPrec ::Int ->ReadS (a:~: b)Source # readList ::ReadS [a:~: b]Source # readPrec ::ReadPrec (a:~: b)Source # readListPrec ::ReadPrec [a:~: b]Source #
Show (a:~: b)Source #	Since: 4.7.0.0
Instance details Defined inData.Type.Equality Methods showsPrec ::Int -> (a:~: b) ->ShowS Source # show :: (a:~: b) ->String Source # showList :: [a:~: b] ->ShowS Source #

data (a :: k1):~~: (b :: k2)whereinfix 4Source #

Kind heterogeneous propositional equality. Like:~:,a :~~: b is inhabited by a terminating value if and only ifa is the same type asb.

Since: 4.10.0.0

Constructors

HRefl :: a:~~: a

Instances

Category ((:~~:) :: k -> k ->Type)Source #	Since: 4.10.0.0
Instance details Defined inControl.Category Methods id :: a:~~: aSource # (.) :: (b:~~: c) -> (a:~~: b) -> a:~~: cSource #
TestEquality ((:~~:) a :: k ->Type)Source #	Since: 4.10.0.0
Instance details Defined inData.Type.Equality Methods testEquality :: (a:~~: a0) -> (a:~~: b) ->Maybe (a0:~: b)Source #
TestCoercion ((:~~:) a :: k ->Type)Source #	Since: 4.10.0.0
Instance details Defined inData.Type.Coercion Methods testCoercion :: (a:~~: a0) -> (a:~~: b) ->Maybe (Coercion a0 b)Source #
a~~ b =>Bounded (a:~~: b)Source #	Since: 4.10.0.0
Instance details Defined inData.Type.Equality Methods minBound :: a:~~: bSource # maxBound :: a:~~: bSource #
a~~ b =>Enum (a:~~: b)Source #	Since: 4.10.0.0
Instance details Defined inData.Type.Equality Methods succ :: (a:~~: b) -> a:~~: bSource # pred :: (a:~~: b) -> a:~~: bSource # toEnum ::Int -> a:~~: bSource # fromEnum :: (a:~~: b) ->Int Source # enumFrom :: (a:~~: b) -> [a:~~: b]Source # enumFromThen :: (a:~~: b) -> (a:~~: b) -> [a:~~: b]Source # enumFromTo :: (a:~~: b) -> (a:~~: b) -> [a:~~: b]Source # enumFromThenTo :: (a:~~: b) -> (a:~~: b) -> (a:~~: b) -> [a:~~: b]Source #
Eq (a:~~: b)Source #	Since: 4.10.0.0
Instance details Defined inData.Type.Equality Methods (==) :: (a:~~: b) -> (a:~~: b) ->Bool # (/=) :: (a:~~: b) -> (a:~~: b) ->Bool #
(Typeable i,Typeable j,Typeable a,Typeable b, a~~ b) =>Data (a:~~: b)Source #	Since: 4.10.0.0
Instance details Defined inData.Data Methods gfoldl :: (forall d b0.Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> (a:~~: b) -> c (a:~~: b)Source # gunfold :: (forall b0 r.Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) ->Constr -> c (a:~~: b)Source # toConstr :: (a:~~: b) ->Constr Source # dataTypeOf :: (a:~~: b) ->DataType Source # dataCast1 ::Typeable t => (forall d.Data d => c (t d)) ->Maybe (c (a:~~: b))Source # dataCast2 ::Typeable t => (forall d e. (Data d,Data e) => c (t d e)) ->Maybe (c (a:~~: b))Source # gmapT :: (forall b0.Data b0 => b0 -> b0) -> (a:~~: b) -> a:~~: bSource # gmapQl :: (r -> r' -> r) -> r -> (forall d.Data d => d -> r') -> (a:~~: b) -> rSource # gmapQr :: (r' -> r -> r) -> r -> (forall d.Data d => d -> r') -> (a:~~: b) -> rSource # gmapQ :: (forall d.Data d => d -> u) -> (a:~~: b) -> [u]Source # gmapQi ::Int -> (forall d.Data d => d -> u) -> (a:~~: b) -> uSource # gmapM ::Monad m => (forall d.Data d => d -> m d) -> (a:~~: b) -> m (a:~~: b)Source # gmapMp ::MonadPlus m => (forall d.Data d => d -> m d) -> (a:~~: b) -> m (a:~~: b)Source # gmapMo ::MonadPlus m => (forall d.Data d => d -> m d) -> (a:~~: b) -> m (a:~~: b)Source #
Ord (a:~~: b)Source #	Since: 4.10.0.0
Instance details Defined inData.Type.Equality Methods compare :: (a:~~: b) -> (a:~~: b) ->Ordering # (<) :: (a:~~: b) -> (a:~~: b) ->Bool # (<=) :: (a:~~: b) -> (a:~~: b) ->Bool # (>) :: (a:~~: b) -> (a:~~: b) ->Bool # (>=) :: (a:~~: b) -> (a:~~: b) ->Bool # max :: (a:~~: b) -> (a:~~: b) -> a:~~: b# min :: (a:~~: b) -> (a:~~: b) -> a:~~: b#
a~~ b =>Read (a:~~: b)Source #	Since: 4.10.0.0
Instance details Defined inData.Type.Equality Methods readsPrec ::Int ->ReadS (a:~~: b)Source # readList ::ReadS [a:~~: b]Source # readPrec ::ReadPrec (a:~~: b)Source # readListPrec ::ReadPrec [a:~~: b]Source #
Show (a:~~: b)Source #	Since: 4.10.0.0
Instance details Defined inData.Type.Equality Methods showsPrec ::Int -> (a:~~: b) ->ShowS Source # show :: (a:~~: b) ->String Source # showList :: [a:~~: b] ->ShowS Source #

Type-safe cast

cast ::forall a b. (Typeable a,Typeable b) => a ->Maybe bSource #

The type-safe cast operation

eqT ::forall a b. (Typeable a,Typeable b) =>Maybe (a:~: b)Source #

Extract a witness of equality of two types

Since: 4.7.0.0

gcast ::forall a b c. (Typeable a,Typeable b) => c a ->Maybe (c b)Source #

A flexible variation parameterised in a type constructor

Generalized casts for higher-order kinds

gcast1 ::forall c t t' a. (Typeable t,Typeable t') => c (t a) ->Maybe (c (t' a))Source #

Cast overk1 -> k2

gcast2 ::forall c t t' a b. (Typeable t,Typeable t') => c (t a b) ->Maybe (c (t' a b))Source #

Cast overk1 -> k2 -> k3

A canonical proxy type

dataProxy tSource #

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 EitherProxy

>>>Proxy :: Proxy FunctorProxy

>>>Proxy :: Proxy complicatedStructureProxy

Constructors

Proxy

Instances

Generic1 (Proxy :: k ->Type)Source #
Instance details Defined inGHC.Generics Associated Types typeRep1 Proxy :: k ->Type Source # Methods from1 ::Proxy a ->Rep1 Proxy aSource # to1 ::Rep1 Proxy a ->Proxy aSource #
Monad (Proxy ::Type ->Type)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods (>>=) ::Proxy a -> (a ->Proxy b) ->Proxy bSource # (>>) ::Proxy a ->Proxy b ->Proxy bSource # return :: a ->Proxy aSource # fail ::String ->Proxy aSource #
Functor (Proxy ::Type ->Type)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods fmap :: (a -> b) ->Proxy a ->Proxy bSource # (<$) :: a ->Proxy b ->Proxy aSource #
Applicative (Proxy ::Type ->Type)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods pure :: a ->Proxy aSource # (<>) ::Proxy (a -> b) ->Proxy a ->Proxy bSource # liftA2 :: (a -> b -> c) ->Proxy a ->Proxy b ->Proxy cSource # (>) ::Proxy a ->Proxy b ->Proxy bSource # (<*) ::Proxy a ->Proxy b ->Proxy aSource #
Foldable (Proxy ::Type ->Type)Source #	Since: 4.7.0.0
Instance details Defined inData.Foldable Methods fold ::Monoid m =>Proxy m -> mSource # foldMap ::Monoid m => (a -> m) ->Proxy a -> mSource # foldr :: (a -> b -> b) -> b ->Proxy a -> bSource # foldr' :: (a -> b -> b) -> b ->Proxy a -> bSource # foldl :: (b -> a -> b) -> b ->Proxy a -> bSource # foldl' :: (b -> a -> b) -> b ->Proxy a -> bSource # foldr1 :: (a -> a -> a) ->Proxy a -> aSource # foldl1 :: (a -> a -> a) ->Proxy a -> aSource # toList ::Proxy a -> [a]Source # null ::Proxy a ->Bool Source # length ::Proxy a ->Int Source # elem ::Eq a => a ->Proxy a ->Bool Source # maximum ::Ord a =>Proxy a -> aSource # minimum ::Ord a =>Proxy a -> aSource # sum ::Num a =>Proxy a -> aSource # product ::Num a =>Proxy a -> aSource #
Traversable (Proxy ::Type ->Type)Source #	Since: 4.7.0.0
Instance details Defined inData.Traversable Methods traverse ::Applicative f => (a -> f b) ->Proxy a -> f (Proxy b)Source # sequenceA ::Applicative f =>Proxy (f a) -> f (Proxy a)Source # mapM ::Monad m => (a -> m b) ->Proxy a -> m (Proxy b)Source # sequence ::Monad m =>Proxy (m a) -> m (Proxy a)Source #
MonadPlus (Proxy ::Type ->Type)Source #	Since: 4.9.0.0
Instance details Defined inData.Proxy Methods mzero ::Proxy aSource # mplus ::Proxy a ->Proxy a ->Proxy aSource #
Alternative (Proxy ::Type ->Type)Source #	Since: 4.9.0.0
Instance details Defined inData.Proxy Methods empty ::Proxy aSource # (<\|>) ::Proxy a ->Proxy a ->Proxy aSource # some ::Proxy a ->Proxy [a]Source # many ::Proxy a ->Proxy [a]Source #
MonadZip (Proxy ::Type ->Type)Source #	Since: 4.9.0.0
Instance details Defined inControl.Monad.Zip Methods mzip ::Proxy a ->Proxy b ->Proxy (a, b)Source # mzipWith :: (a -> b -> c) ->Proxy a ->Proxy b ->Proxy cSource # munzip ::Proxy (a, b) -> (Proxy a,Proxy b)Source #
Show1 (Proxy ::Type ->Type)Source #	Since: 4.9.0.0
Instance details Defined inData.Functor.Classes Methods liftShowsPrec :: (Int -> a ->ShowS) -> ([a] ->ShowS) ->Int ->Proxy a ->ShowS Source # liftShowList :: (Int -> a ->ShowS) -> ([a] ->ShowS) -> [Proxy a] ->ShowS Source #
Read1 (Proxy ::Type ->Type)Source #	Since: 4.9.0.0
Instance details Defined inData.Functor.Classes Methods liftReadsPrec :: (Int ->ReadS a) ->ReadS [a] ->Int ->ReadS (Proxy a)Source # liftReadList :: (Int ->ReadS a) ->ReadS [a] ->ReadS [Proxy a]Source # liftReadPrec ::ReadPrec a ->ReadPrec [a] ->ReadPrec (Proxy a)Source # liftReadListPrec ::ReadPrec a ->ReadPrec [a] ->ReadPrec [Proxy a]Source #
Ord1 (Proxy ::Type ->Type)Source #	Since: 4.9.0.0
Instance details Defined inData.Functor.Classes Methods liftCompare :: (a -> b ->Ordering) ->Proxy a ->Proxy b ->Ordering Source #
Eq1 (Proxy ::Type ->Type)Source #	Since: 4.9.0.0
Instance details Defined inData.Functor.Classes Methods liftEq :: (a -> b ->Bool) ->Proxy a ->Proxy b ->Bool Source #
Contravariant (Proxy ::Type ->Type)Source #
Instance details Defined inData.Functor.Contravariant Methods contramap :: (a -> b) ->Proxy b ->Proxy aSource # (>$) :: b ->Proxy b ->Proxy aSource #
Bounded (Proxy t)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods minBound ::Proxy tSource # maxBound ::Proxy tSource #
Enum (Proxy s)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods succ ::Proxy s ->Proxy sSource # pred ::Proxy s ->Proxy sSource # toEnum ::Int ->Proxy sSource # fromEnum ::Proxy s ->Int Source # enumFrom ::Proxy s -> [Proxy s]Source # enumFromThen ::Proxy s ->Proxy s -> [Proxy s]Source # enumFromTo ::Proxy s ->Proxy s -> [Proxy s]Source # enumFromThenTo ::Proxy s ->Proxy s ->Proxy s -> [Proxy s]Source #
Eq (Proxy s)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods (==) ::Proxy s ->Proxy s ->Bool # (/=) ::Proxy s ->Proxy s ->Bool #
Data t =>Data (Proxy t)Source #	Since: 4.7.0.0
Instance details Defined inData.Data Methods gfoldl :: (forall d b.Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) ->Proxy t -> c (Proxy t)Source # gunfold :: (forall b r.Data b => c (b -> r) -> c r) -> (forall r. r -> c r) ->Constr -> c (Proxy t)Source # toConstr ::Proxy t ->Constr Source # dataTypeOf ::Proxy t ->DataType Source # dataCast1 ::Typeable t0 => (forall d.Data d => c (t0 d)) ->Maybe (c (Proxy t))Source # dataCast2 ::Typeable t0 => (forall d e. (Data d,Data e) => c (t0 d e)) ->Maybe (c (Proxy t))Source # gmapT :: (forall b.Data b => b -> b) ->Proxy t ->Proxy tSource # gmapQl :: (r -> r' -> r) -> r -> (forall d.Data d => d -> r') ->Proxy t -> rSource # gmapQr :: (r' -> r -> r) -> r -> (forall d.Data d => d -> r') ->Proxy t -> rSource # gmapQ :: (forall d.Data d => d -> u) ->Proxy t -> [u]Source # gmapQi ::Int -> (forall d.Data d => d -> u) ->Proxy t -> uSource # gmapM ::Monad m => (forall d.Data d => d -> m d) ->Proxy t -> m (Proxy t)Source # gmapMp ::MonadPlus m => (forall d.Data d => d -> m d) ->Proxy t -> m (Proxy t)Source # gmapMo ::MonadPlus m => (forall d.Data d => d -> m d) ->Proxy t -> m (Proxy t)Source #
Ord (Proxy s)Source #	Since: 4.7.0.0
Instance details Defined inData.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)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods readsPrec ::Int ->ReadS (Proxy t)Source # readList ::ReadS [Proxy t]Source # readPrec ::ReadPrec (Proxy t)Source # readListPrec ::ReadPrec [Proxy t]Source #
Show (Proxy s)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods showsPrec ::Int ->Proxy s ->ShowS Source # show ::Proxy s ->String Source # showList :: [Proxy s] ->ShowS Source #
Ix (Proxy s)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods range :: (Proxy s,Proxy s) -> [Proxy s]Source # index :: (Proxy s,Proxy s) ->Proxy s ->Int Source # unsafeIndex :: (Proxy s,Proxy s) ->Proxy s ->Int inRange :: (Proxy s,Proxy s) ->Proxy s ->Bool Source # rangeSize :: (Proxy s,Proxy s) ->Int Source # unsafeRangeSize :: (Proxy s,Proxy s) ->Int
Generic (Proxy t)Source #
Instance details Defined inGHC.Generics Associated Types typeRep (Proxy t) ::Type ->Type Source # Methods from ::Proxy t ->Rep (Proxy t) xSource # to ::Rep (Proxy t) x ->Proxy tSource #
Semigroup (Proxy s)Source #	Since: 4.9.0.0
Instance details Defined inData.Proxy Methods (<>) ::Proxy s ->Proxy s ->Proxy sSource # sconcat ::NonEmpty (Proxy s) ->Proxy sSource # stimes ::Integral b => b ->Proxy s ->Proxy sSource #
Monoid (Proxy s)Source #	Since: 4.7.0.0
Instance details Defined inData.Proxy Methods mempty ::Proxy sSource # mappend ::Proxy s ->Proxy s ->Proxy sSource # mconcat :: [Proxy s] ->Proxy sSource #
typeRep1 (Proxy :: k ->Type)Source #	Since: 4.6.0.0
Instance details Defined inGHC.Generics typeRep1 (Proxy :: k ->Type) =D1 (MetaData "Proxy" "Data.Proxy" "base"False) (C1 (MetaCons "Proxy"PrefixI False) (U1 :: k ->Type))
typeRep (Proxy t)Source #	Since: 4.6.0.0
Instance details Defined inGHC.Generics typeRep (Proxy t) =D1 (MetaData "Proxy" "Data.Proxy" "base"False) (C1 (MetaCons "Proxy"PrefixI False) (U1 ::Type ->Type))

Type representations

typeTypeRep =SomeTypeRep Source #

A quantified type representation.

rnfTypeRep ::TypeRep -> ()Source #

Force aTypeRep to normal form.

showsTypeRep ::TypeRep ->ShowS Source #

Show a type representation

mkFunTy ::TypeRep ->TypeRep ->TypeRep Source #

Build a function type.

Observing type representations

funResultTy ::TypeRep ->TypeRep ->Maybe TypeRep Source #

Applies a type to a function type. Returns:Just u if the first argument represents a function of typet -> u and the second argument represents a function of typet. Otherwise, returnsNothing.

splitTyConApp ::TypeRep -> (TyCon, [TypeRep])Source #

Splits a type constructor application. Note that if the type constructor is polymorphic, this will not return the kinds that were used.

typeRepArgs ::TypeRep -> [TypeRep]Source #

Observe the argument types of a type representation

typeRepTyCon ::TypeRep ->TyCon Source #

Observe the type constructor of a quantified type representation.

typeRepFingerprint ::TypeRep ->Fingerprint Source #

Takes a value of typea and returns a concrete representation of that type.

Since: 4.7.0.0

Type constructors

dataTyCon #

Instances

Eq TyCon
Instance details Defined inGHC.Classes Methods (==) ::TyCon ->TyCon ->Bool # (/=) ::TyCon ->TyCon ->Bool #
Ord TyCon
Instance details Defined inGHC.Classes 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 #
Show TyConSource #	Since: 2.1
Instance details Defined inGHC.Show Methods showsPrec ::Int ->TyCon ->ShowS Source # show ::TyCon ->String Source # showList :: [TyCon] ->ShowS Source #

tyConPackage ::TyCon ->String Source #

tyConModule ::TyCon ->String Source #

tyConName ::TyCon ->String Source #

rnfTyCon ::TyCon -> ()Source #

tyConFingerprint ::TyCon ->Fingerprint Source #

For backwards compatibility

typeOf1 ::forall t (a ::Type).Typeable t => t a ->TypeRep Source #

typeOf2 ::forall t (a ::Type) (b ::Type).Typeable t => t a b ->TypeRep Source #

typeOf3 ::forall t (a ::Type) (b ::Type) (c ::Type).Typeable t => t a b c ->TypeRep Source #

typeOf4 ::forall t (a ::Type) (b ::Type) (c ::Type) (d ::Type).Typeable t => t a b c d ->TypeRep Source #

typeOf5 ::forall t (a ::Type) (b ::Type) (c ::Type) (d ::Type) (e ::Type).Typeable t => t a b c d e ->TypeRep Source #

typeOf6 ::forall t (a ::Type) (b ::Type) (c ::Type) (d ::Type) (e ::Type) (f ::Type).Typeable t => t a b c d e f ->TypeRep Source #

typeOf7 ::forall t (a ::Type) (b ::Type) (c ::Type) (d ::Type) (e ::Type) (f ::Type) (g ::Type).Typeable t => t a b c d e f g ->TypeRep Source #

Movatterモバイル変換

Compatibility Notes

The Typeable class

Propositional equality

Type-safe cast

Generalized casts for higher-order kinds

A canonical proxy type

Type representations

Observing type representations

Type constructors

For backwards compatibility