Safe Haskell | None |
---|

Main functions for manipulating types and type-related things

- data TyThing
- data Type
- type KindOrType = Type
- type PredType = Type
- type ThetaType = [PredType]
- data Var
- type TyVar = Var
- isTyVar :: Var -> Bool
- mkTyVarTy :: TyVar -> Type
- mkTyVarTys :: [TyVar] -> [Type]
- getTyVar :: String -> Type -> TyVar
- getTyVar_maybe :: Type -> Maybe TyVar
- mkAppTy :: Type -> Type -> Type
- mkAppTys :: Type -> [Type] -> Type
- mkNakedAppTys :: Type -> [Type] -> Type
- splitAppTy :: Type -> (Type, Type)
- splitAppTys :: Type -> (Type, [Type])
- splitAppTy_maybe :: Type -> Maybe (Type, Type)
- repSplitAppTy_maybe :: Type -> Maybe (Type, Type)
- mkFunTy :: Type -> Type -> Type
- mkFunTys :: [Type] -> Type -> Type
- splitFunTy :: Type -> (Type, Type)
- splitFunTy_maybe :: Type -> Maybe (Type, Type)
- splitFunTys :: Type -> ([Type], Type)
- splitFunTysN :: Int -> Type -> ([Type], Type)
- funResultTy :: Type -> Type
- funArgTy :: Type -> Type
- zipFunTys :: Outputable a => [a] -> Type -> ([(a, Type)], Type)
- mkTyConApp :: TyCon -> [Type] -> Type
- mkTyConTy :: TyCon -> Type
- tyConAppTyCon_maybe :: Type -> Maybe TyCon
- tyConAppArgs_maybe :: Type -> Maybe [Type]
- tyConAppTyCon :: Type -> TyCon
- tyConAppArgs :: Type -> [Type]
- splitTyConApp_maybe :: Type -> Maybe (TyCon, [Type])
- splitTyConApp :: Type -> (TyCon, [Type])
- tyConAppArgN :: Int -> Type -> Type
- mkForAllTy :: TyVar -> Type -> Type
- mkForAllTys :: [TyVar] -> Type -> Type
- splitForAllTy_maybe :: Type -> Maybe (TyVar, Type)
- splitForAllTys :: Type -> ([TyVar], Type)
- mkPiKinds :: [TyVar] -> Kind -> Kind
- mkPiType :: Var -> Type -> Type
- mkPiTypes :: [Var] -> Type -> Type
- applyTy :: Type -> KindOrType -> Type
- applyTys :: Type -> [KindOrType] -> Type
- applyTysD :: SDoc -> Type -> [Type] -> Type
- isForAllTy :: Type -> Bool
- dropForAlls :: Type -> Type
- mkNumLitTy :: Integer -> Type
- isNumLitTy :: Type -> Maybe Integer
- mkStrLitTy :: FastString -> Type
- isStrLitTy :: Type -> Maybe FastString
- newTyConInstRhs :: TyCon -> [Type] -> Type
- carefullySplitNewType_maybe :: NameSet -> TyCon -> [Type] -> Maybe (NameSet, Type)
- mkFamilyTyConApp :: TyCon -> [Type] -> Type
- isDictLikeTy :: Type -> Bool
- mkEqPred :: Type -> Type -> PredType
- mkPrimEqPred :: Type -> Type -> Type
- mkClassPred :: Class -> [Type] -> PredType
- noParenPred :: PredType -> Bool
- isClassPred :: PredType -> Bool
- isEqPred :: PredType -> Bool
- isIPPred :: PredType -> Bool
- isIPPred_maybe :: Type -> Maybe (FastString, Type)
- data PredTree
- predTreePredType :: PredTree -> PredType
- classifyPredType :: PredType -> PredTree
- getClassPredTys :: PredType -> (Class, [Type])
- getClassPredTys_maybe :: PredType -> Maybe (Class, [Type])
- getEqPredTys :: PredType -> (Type, Type)
- getEqPredTys_maybe :: PredType -> Maybe (Type, Type)
- funTyCon :: TyCon
- isTypeVar :: Var -> Bool
- isKindVar :: Var -> Bool
- isTyVarTy :: Type -> Bool
- isFunTy :: Type -> Bool
- isDictTy :: Type -> Bool
- isPredTy :: Type -> Bool
- isKindTy :: Type -> Bool
- isUnLiftedType :: Type -> Bool
- isUnboxedTupleType :: Type -> Bool
- isAlgType :: Type -> Bool
- isClosedAlgType :: Type -> Bool
- isPrimitiveType :: Type -> Bool
- isStrictType :: Type -> Bool
- type Kind = Type
- type SimpleKind = Kind
- type MetaKindVar = TyVar
- typeKind :: Type -> Kind
- anyKind :: Kind
- liftedTypeKind :: Kind
- unliftedTypeKind :: Kind
- openTypeKind :: Kind
- constraintKind :: Kind
- superKind :: Kind
- liftedTypeKindTyCon :: TyCon
- openTypeKindTyCon :: TyCon
- unliftedTypeKindTyCon :: TyCon
- constraintKindTyCon :: TyCon
- anyKindTyCon :: TyCon
- tyVarsOfType :: Type -> VarSet
- tyVarsOfTypes :: [Type] -> TyVarSet
- expandTypeSynonyms :: Type -> Type
- typeSize :: Type -> Int
- varSetElemsKvsFirst :: VarSet -> [TyVar]
- eqType :: Type -> Type -> Bool
- eqTypeX :: RnEnv2 -> Type -> Type -> Bool
- eqTypes :: [Type] -> [Type] -> Bool
- cmpType :: Type -> Type -> Ordering
- cmpTypes :: [Type] -> [Type] -> Ordering
- eqPred :: PredType -> PredType -> Bool
- eqPredX :: RnEnv2 -> PredType -> PredType -> Bool
- cmpPred :: PredType -> PredType -> Ordering
- eqKind :: Kind -> Kind -> Bool
- seqType :: Type -> ()
- seqTypes :: [Type] -> ()
- coreView :: Type -> Maybe Type
- tcView :: Type -> Maybe Type
- type UnaryType = Type
- data RepType
- flattenRepType :: RepType -> [UnaryType]
- repType :: Type -> RepType
- typePrimRep :: UnaryType -> PrimRep
- typeRepArity :: Arity -> Type -> RepArity
- type TvSubstEnv = TyVarEnv Type
- data TvSubst = TvSubst InScopeSet TvSubstEnv
- emptyTvSubstEnv :: TvSubstEnv
- emptyTvSubst :: TvSubst
- mkTvSubst :: InScopeSet -> TvSubstEnv -> TvSubst
- mkOpenTvSubst :: TvSubstEnv -> TvSubst
- zipOpenTvSubst :: [TyVar] -> [Type] -> TvSubst
- zipTopTvSubst :: [TyVar] -> [Type] -> TvSubst
- mkTopTvSubst :: [(TyVar, Type)] -> TvSubst
- notElemTvSubst :: CoVar -> TvSubst -> Bool
- getTvSubstEnv :: TvSubst -> TvSubstEnv
- setTvSubstEnv :: TvSubst -> TvSubstEnv -> TvSubst
- zapTvSubstEnv :: TvSubst -> TvSubst
- getTvInScope :: TvSubst -> InScopeSet
- extendTvInScope :: TvSubst -> Var -> TvSubst
- extendTvInScopeList :: TvSubst -> [Var] -> TvSubst
- extendTvSubst :: TvSubst -> TyVar -> Type -> TvSubst
- extendTvSubstList :: TvSubst -> [TyVar] -> [Type] -> TvSubst
- isInScope :: Var -> TvSubst -> Bool
- composeTvSubst :: InScopeSet -> TvSubstEnv -> TvSubstEnv -> TvSubstEnv
- zipTyEnv :: [TyVar] -> [Type] -> TvSubstEnv
- isEmptyTvSubst :: TvSubst -> Bool
- unionTvSubst :: TvSubst -> TvSubst -> TvSubst
- substTy :: TvSubst -> Type -> Type
- substTys :: TvSubst -> [Type] -> [Type]
- substTyWith :: [TyVar] -> [Type] -> Type -> Type
- substTysWith :: [TyVar] -> [Type] -> [Type] -> [Type]
- substTheta :: TvSubst -> ThetaType -> ThetaType
- substTyVar :: TvSubst -> TyVar -> Type
- substTyVars :: TvSubst -> [TyVar] -> [Type]
- substTyVarBndr :: TvSubst -> TyVar -> (TvSubst, TyVar)
- cloneTyVarBndr :: TvSubst -> TyVar -> Unique -> (TvSubst, TyVar)
- deShadowTy :: TyVarSet -> Type -> Type
- lookupTyVar :: TvSubst -> TyVar -> Maybe Type
- substKiWith :: [KindVar] -> [Kind] -> Kind -> Kind
- substKisWith :: [KindVar] -> [Kind] -> [Kind] -> [Kind]
- pprType :: Type -> SDoc
- pprParendType :: Type -> SDoc
- pprTypeApp :: NamedThing a => a -> [Type] -> SDoc
- pprTyThingCategory :: TyThing -> SDoc
- pprTyThing :: TyThing -> SDoc
- pprTvBndr :: TyVar -> SDoc
- pprTvBndrs :: [TyVar] -> SDoc
- pprForAll :: [TyVar] -> SDoc
- pprSigmaType :: Type -> SDoc
- pprEqPred :: Pair Type -> SDoc
- pprTheta :: ThetaType -> SDoc
- pprThetaArrowTy :: ThetaType -> SDoc
- pprClassPred :: Class -> [Type] -> SDoc
- pprKind :: Kind -> SDoc
- pprParendKind :: Kind -> SDoc
- pprSourceTyCon :: TyCon -> SDoc

# Main data types representing Types

Types are one of:

- Unboxed
- Iff its representation is other than a pointer Unboxed types are also unlifted.
- Lifted
- Iff it has bottom as an element. Closures always have lifted types: i.e. any let-bound identifier in Core must have a lifted type. Operationally, a lifted object is one that can be entered. Only lifted types may be unified with a type variable.
- Algebraic
- Iff it is a type with one or more constructors, whether
declared with
`data`

or`newtype`

. An algebraic type is one that can be deconstructed with a case expression. This is*not*the same as lifted types, because we also include unboxed tuples in this classification. - Data
- Iff it is a type declared with
`data`

, or a boxed tuple. - Primitive
- Iff it is a built-in type that can't be expressed in Haskell.

Currently, all primitive types are unlifted, but that's not necessarily
the case: for example, `Int`

could be primitive.

Some primitive types are unboxed, such as `Int#`

, whereas some are boxed
but unlifted (such as `ByteArray#`

). The only primitive types that we
classify as algebraic are the unboxed tuples.

Some examples of type classifications that may make this a bit clearer are:

Type primitive boxed lifted algebraic ----------------------------------------------------------------------------- Int# Yes No No No ByteArray# Yes Yes No No (# a, b #) Yes No No Yes ( a, b ) No Yes Yes Yes [a] No Yes Yes Yes

A *source type* is a type that is a separate type as far as the type checker is
concerned, but which has a more low-level representation as far as Core-to-Core
passes and the rest of the back end is concerned.

You don't normally have to worry about this, as the utility functions in this module will automatically convert a source into a representation type if they are spotted, to the best of it's abilities. If you don't want this to happen, use the equivalent functions from the TcType module.

A typecheckable-thing, essentially anything that has a name

The key representation of types within the compiler

type KindOrType = TypeSource

A type of the form `p`

of kind `Constraint`

represents a value whose type is
the Haskell predicate `p`

, where a predicate is what occurs before
the `=>`

in a Haskell type.

We use `PredType`

as documentation to mark those types that we guarantee to have
this kind.

It can be expanded into its representation, but:

- The type checker must treat it as opaque
- The rest of the compiler treats it as transparent

Consider these examples:

f :: (Eq a) => a -> Int g :: (?x :: Int -> Int) => a -> Int h :: (r\l) => {r} => {l::Int | r}

Here the `Eq a`

and `?x :: Int -> Int`

and `rl`

are all called "predicates"

## Constructing and deconstructing types

mkTyVarTys :: [TyVar] -> [Type]Source

getTyVar :: String -> Type -> TyVarSource

Attempts to obtain the type variable underlying a `Type`

, and panics with the
given message if this is not a type variable type. See also `getTyVar_maybe`

mkNakedAppTys :: Type -> [Type] -> TypeSource

splitAppTy :: Type -> (Type, Type)Source

Attempts to take a type application apart, as in `splitAppTy_maybe`

,
and panics if this is not possible

splitAppTys :: Type -> (Type, [Type])Source

Recursively splits a type as far as is possible, leaving a residual type being applied to and the type arguments applied to it. Never fails, even if that means returning an empty list of type applications.

splitAppTy_maybe :: Type -> Maybe (Type, Type)Source

Attempt to take a type application apart, whether it is a function, type constructor, or plain type application. Note that type family applications are NEVER unsaturated by this!

repSplitAppTy_maybe :: Type -> Maybe (Type, Type)Source

Does the AppTy split as in `splitAppTy_maybe`

, but assumes that
any Core view stuff is already done

mkFunTy :: Type -> Type -> TypeSource

Creates a function type from the given argument and result type

splitFunTy :: Type -> (Type, Type)Source

Attempts to extract the argument and result types from a type, and
panics if that is not possible. See also `splitFunTy_maybe`

splitFunTy_maybe :: Type -> Maybe (Type, Type)Source

Attempts to extract the argument and result types from a type

splitFunTys :: Type -> ([Type], Type)Source

splitFunTysN :: Int -> Type -> ([Type], Type)Source

Split off exactly the given number argument types, and panics if that is not possible

funResultTy :: Type -> TypeSource

Extract the function result type and panic if that is not possible

zipFunTys :: Outputable a => [a] -> Type -> ([(a, Type)], Type)Source

Splits off argument types from the given type and associating them with the things in the input list from left to right. The final result type is returned, along with the resulting pairs of objects and types, albeit with the list of pairs in reverse order. Panics if there are not enough argument types for the input list.

mkTyConApp :: TyCon -> [Type] -> TypeSource

A key function: builds a `TyConApp`

or `FunTy`

as apppropriate to
its arguments. Applies its arguments to the constructor from left to right.

mkTyConTy :: TyCon -> TypeSource

Create the plain type constructor type which has been applied to no type arguments at all.

tyConAppTyCon_maybe :: Type -> Maybe TyConSource

The same as `fst . splitTyConApp`

tyConAppArgs_maybe :: Type -> Maybe [Type]Source

The same as `snd . splitTyConApp`

tyConAppTyCon :: Type -> TyConSource

tyConAppArgs :: Type -> [Type]Source

splitTyConApp_maybe :: Type -> Maybe (TyCon, [Type])Source

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor

splitTyConApp :: Type -> (TyCon, [Type])Source

Attempts to tease a type apart into a type constructor and the application
of a number of arguments to that constructor. Panics if that is not possible.
See also `splitTyConApp_maybe`

tyConAppArgN :: Int -> Type -> TypeSource

mkForAllTy :: TyVar -> Type -> TypeSource

mkForAllTys :: [TyVar] -> Type -> TypeSource

Wraps foralls over the type using the provided `TyVar`

s from left to right

splitForAllTy_maybe :: Type -> Maybe (TyVar, Type)Source

Attempts to take a forall type apart, returning the bound type variable and the remainder of the type

splitForAllTys :: Type -> ([TyVar], Type)Source

Attempts to take a forall type apart, returning all the immediate such bound
type variables and the remainder of the type. Always suceeds, even if that means
returning an empty list of `TyVar`

s

mkPiType :: Var -> Type -> TypeSource

Makes a `(->)`

type or a forall type, depending
on whether it is given a type variable or a term variable.

applyTy :: Type -> KindOrType -> TypeSource

Instantiate a forall type with one or more type arguments. Used when we have a polymorphic function applied to type args:

f t1 t2

We use `applyTys type-of-f [t1,t2]`

to compute the type of the expression.
Panics if no application is possible.

applyTys :: Type -> [KindOrType] -> TypeSource

This function is interesting because:

- The function may have more for-alls than there are args
- Less obviously, it may have fewer for-alls

For case 2. think of:

applyTys (forall a.a) [forall b.b, Int]

This really can happen, but only (I think) in situations involving
undefined. For example:
undefined :: forall a. a
Term: undefined `(forall b. b->b) `

Int
This term should have type (Int -> Int), but notice that
there are more type args than foralls in `undefined`

s type.

isForAllTy :: Type -> BoolSource

dropForAlls :: Type -> TypeSource

Equivalent to `snd . splitForAllTys`

mkNumLitTy :: Integer -> TypeSource

isNumLitTy :: Type -> Maybe IntegerSource

mkStrLitTy :: FastString -> TypeSource

isStrLitTy :: Type -> Maybe FastStringSource

newTyConInstRhs :: TyCon -> [Type] -> TypeSource

Unwrap one `layer`

of newtype on a type constructor and its arguments, using an
eta-reduced version of the `newtype`

if possible

mkFamilyTyConApp :: TyCon -> [Type] -> TypeSource

Given a family instance TyCon and its arg types, return the corresponding family type. E.g:

data family T a data instance T (Maybe b) = MkT b

Where the instance tycon is :RTL, so:

mkFamilyTyConApp :RTL Int = T (Maybe Int)

isDictLikeTy :: Type -> BoolSource

mkPrimEqPred :: Type -> Type -> TypeSource

mkClassPred :: Class -> [Type] -> PredTypeSource

noParenPred :: PredType -> BoolSource

isClassPred :: PredType -> BoolSource

isIPPred_maybe :: Type -> Maybe (FastString, Type)Source

getClassPredTys :: PredType -> (Class, [Type])Source

getEqPredTys :: PredType -> (Type, Type)Source

## Common type constructors

## Predicates on types

isUnLiftedType :: Type -> BoolSource

See Type for what an unlifted type is

isUnboxedTupleType :: Type -> BoolSource

isAlgType :: Type -> BoolSource

See Type for what an algebraic type is.
Should only be applied to *types*, as opposed to e.g. partially
saturated type constructors

isClosedAlgType :: Type -> BoolSource

See Type for what an algebraic type is.
Should only be applied to *types*, as opposed to e.g. partially
saturated type constructors. Closed type constructors are those
with a fixed right hand side, as opposed to e.g. associated types

isPrimitiveType :: Type -> BoolSource

Returns true of types that are opaque to Haskell. Most of these are unlifted, but now that we interact with .NET, we may have primtive (foreign-imported) types that are lifted

isStrictType :: Type -> BoolSource

Computes whether an argument (or let right hand side) should
be computed strictly or lazily, based only on its type.
Works just like `isUnLiftedType`

, except that it has a special case
for dictionaries (i.e. does not work purely on representation types)

# Main data types representing Kinds

The key type representing kinds in the compiler. Invariant: a kind is always in one of these forms:

FunTy k1 k2 TyConApp PrimTyCon [...] TyVar kv -- (during inference only) ForAll ... -- (for top-level coercions)

type SimpleKind = KindSource

type MetaKindVar = TyVarSource

## Finding the kind of a type

## Common Kinds and SuperKinds

## Common Kind type constructors

# Type free variables

tyVarsOfType :: Type -> VarSetSource

NB: for type synonyms tyVarsOfType does *not* expand the synonym
tyVarsOfType returns only the free variables of a type
For example, tyVarsOfType (a::k) returns {a}, not including the
kind variable {k}

tyVarsOfTypes :: [Type] -> TyVarSetSource

expandTypeSynonyms :: Type -> TypeSource

Expand out all type synonyms. Actually, it'd suffice to expand out just the ones that discard type variables (e.g. type Funny a = Int) But we don't know which those are currently, so we just expand all.

varSetElemsKvsFirst :: VarSet -> [TyVar]Source

# Type comparison

eqType :: Type -> Type -> BoolSource

Type equality on source types. Does not look through `newtypes`

or
`PredType`

s, but it does look through type synonyms.

# Forcing evaluation of types

# Other views onto Types

coreView :: Type -> Maybe TypeSource

In Core, we "look through" non-recursive newtypes and `PredTypes`

: this
function tries to obtain a different view of the supplied type given this

Strips off the *top layer only* of a type to give
its underlying representation type.
Returns Nothing if there is nothing to look through.

By being non-recursive and inlined, this case analysis gets efficiently joined onto the case analysis that the caller is already doing

tcView :: Type -> Maybe TypeSource

Similar to `coreView`

, but for the type checker, which just looks through synonyms

flattenRepType :: RepType -> [UnaryType]Source

repType :: Type -> RepTypeSource

Looks through:

- For-alls 2. Synonyms 3. Predicates 4. All newtypes, including recursive ones, but not newtype families

It's useful in the back end of the compiler.

# Type representation for the code generator

typePrimRep :: UnaryType -> PrimRepSource

Discovers the primitive representation of a more abstract `UnaryType`

typeRepArity :: Arity -> Type -> RepAritySource

# Main type substitution data types

Type substitution

The following invariants must hold of a `TvSubst`

:

- The in-scope set is needed
*only*to guide the generation of fresh uniques - In particular, the
*kind*of the type variables in the in-scope set is not relevant - The substition is only applied ONCE! This is because in general such application will not reached a fixed point.

## Manipulating type substitutions

mkTvSubst :: InScopeSet -> TvSubstEnv -> TvSubstSource

zipOpenTvSubst :: [TyVar] -> [Type] -> TvSubstSource

zipTopTvSubst :: [TyVar] -> [Type] -> TvSubstSource

mkTopTvSubst :: [(TyVar, Type)] -> TvSubstSource

Called when doing top-level substitutions. Here we expect that the free vars of the range of the substitution will be empty.

notElemTvSubst :: CoVar -> TvSubst -> BoolSource

setTvSubstEnv :: TvSubst -> TvSubstEnv -> TvSubstSource

extendTvInScope :: TvSubst -> Var -> TvSubstSource

extendTvInScopeList :: TvSubst -> [Var] -> TvSubstSource

composeTvSubst :: InScopeSet -> TvSubstEnv -> TvSubstEnv -> TvSubstEnvSource

`(compose env1 env2)(x)`

is `env1(env2(x))`

; i.e. apply `env2`

then `env1`

.
It assumes that both are idempotent.
Typically, `env1`

is the refinement to a base substitution `env2`

zipTyEnv :: [TyVar] -> [Type] -> TvSubstEnvSource

isEmptyTvSubst :: TvSubst -> BoolSource

unionTvSubst :: TvSubst -> TvSubst -> TvSubstSource

## Performing substitution on types and kinds

substTyWith :: [TyVar] -> [Type] -> Type -> TypeSource

Type substitution making use of an `TvSubst`

that
is assumed to be open, see `zipOpenTvSubst`

substTysWith :: [TyVar] -> [Type] -> [Type] -> [Type]Source

Type substitution making use of an `TvSubst`

that
is assumed to be open, see `zipOpenTvSubst`

substTyVar :: TvSubst -> TyVar -> TypeSource

substTyVars :: TvSubst -> [TyVar] -> [Type]Source

deShadowTy :: TyVarSet -> Type -> TypeSource

# Pretty-printing

pprParendType :: Type -> SDocSource

pprTypeApp :: NamedThing a => a -> [Type] -> SDocSource

pprTyThing :: TyThing -> SDocSource

pprTvBndrs :: [TyVar] -> SDocSource

pprSigmaType :: Type -> SDocSource

pprClassPred :: Class -> [Type] -> SDocSource

pprParendKind :: Kind -> SDocSource