| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Clash.Core.TermInfo
Synopsis
- termSize :: Term -> Word
- termType :: TyConMap -> Term -> Type
- multiPrimType :: PrimInfo -> Type
- multPrimErr :: PrimInfo -> String
- splitMultiPrimArgs :: HasCallStack => MultiPrimInfo -> [Either Term Type] -> ([Either Term Type], [Id])
- multiPrimInfo' :: HasCallStack => TyConMap -> PrimInfo -> MultiPrimInfo
- multiPrimInfo :: TyConMap -> PrimInfo -> Maybe MultiPrimInfo
- applyTypeToArgs :: Term -> TyConMap -> Type -> [Either Term Type] -> Type
- piResultTy :: HasCallStack => TyConMap -> Type -> Type -> Type
- piResultTyMaybe :: HasCallStack => TyConMap -> Type -> Type -> Maybe Type
- piResultTys :: HasCallStack => TyConMap -> Type -> [Type] -> Type
- isFun :: TyConMap -> Term -> Bool
- isPolyFun :: TyConMap -> Term -> Bool
- isLam :: Term -> Bool
- isLet :: Term -> Bool
- isVar :: Term -> Bool
- isLocalVar :: Term -> Bool
- isCon :: Term -> Bool
- isPrim :: Term -> Bool
- isCast :: Term -> Bool
Documentation
multiPrimType :: PrimInfo -> Type Source #
Type of multi prim primitive belonging to given primitive. See
setupMultiResultPrim for more information.
Example, given:
/v1 -> t1 -> t2 -> (t3, t4)
produces:
/v1 -> t1 -> t2 -> t3 -> t4 -> (t3, t4)
multPrimErr :: PrimInfo -> String Source #
splitMultiPrimArgs :: HasCallStack => MultiPrimInfo -> [Either Term Type] -> ([Either Term Type], [Id]) Source #
multiPrimInfo' :: HasCallStack => TyConMap -> PrimInfo -> MultiPrimInfo Source #
Same as multiPrimInfo, but produced an error if it could not produce a
MultiPrimInfo.
multiPrimInfo :: TyConMap -> PrimInfo -> Maybe MultiPrimInfo Source #
Produce MutliPrimInfo for given primitive
applyTypeToArgs :: Term -> TyConMap -> Type -> [Either Term Type] -> Type Source #
Get the result type of a polymorphic function given a list of arguments
piResultTy :: HasCallStack => TyConMap -> Type -> Type -> Type Source #
Like piResultTyMaybe, but errors out when a type application is not
valid.
Do not iterate piResultTy, because it's inefficient to substitute one
variable at a time; instead use piResultTys
piResultTyMaybe :: HasCallStack => TyConMap -> Type -> Type -> Maybe Type Source #
Like piResultTys but for a single argument.
Do not iterate piResultTyMaybe, because it's inefficient to substitute one
variable at a time; instead use piResultTys
piResultTys :: HasCallStack => TyConMap -> Type -> [Type] -> Type Source #
(piResultTys f_ty [ty1, ..., tyn]) gives the type of (f ty1 .. tyn)
where f :: f_ty
piResultTys is interesting because:
f_tymay have more foralls than there are args- Less obviously, it may have fewer foralls
Fore case 2. think of:
piResultTys (forall a . a) [forall b.b, Int]
This really can happen, such as situations involving undefineds type:
undefined :: forall a. a
undefined (forall b. b -> b) Int
This term should have the type (Int -> Int), but notice that there are
more type args than foralls in undefineds type.
For efficiency reasons, when there are no foralls, we simply drop arrows from a function type/kind.
isLocalVar :: Term -> Bool Source #