futhark-0.17.2: src/Language/Futhark/TypeChecker/Terms.hs
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE Trustworthy #-}
{-# LANGUAGE TupleSections #-}
-- | Facilities for type-checking Futhark terms. Checking a term
-- requires a little more context to track uniqueness and such.
--
-- Type inference is implemented through a variation of
-- Hindley-Milner. The main complication is supporting the rich
-- number of built-in language constructs, as well as uniqueness
-- types. This is mostly done in an ad hoc way, and many programs
-- will require the programmer to fall back on type annotations.
module Language.Futhark.TypeChecker.Terms
( checkOneExp,
checkFunDef,
)
where
import Control.Monad.Except
import Control.Monad.RWS hiding (Sum)
import Control.Monad.State
import Control.Monad.Writer hiding (Sum)
import Data.Bifunctor
import Data.Char (isAscii)
import Data.Either
import Data.List (find, foldl', group, isPrefixOf, nub, sort, transpose, (\\))
import qualified Data.List.NonEmpty as NE
import qualified Data.Map.Strict as M
import Data.Maybe
import qualified Data.Set as S
import Futhark.IR.Primitive (intByteSize)
import Futhark.Util.Pretty hiding (bool, group, space)
import Language.Futhark hiding (unscopeType)
import Language.Futhark.Semantic (includeToString)
import Language.Futhark.Traversals
import Language.Futhark.TypeChecker.Monad hiding (BoundV)
import qualified Language.Futhark.TypeChecker.Monad as TypeM
import Language.Futhark.TypeChecker.Types hiding (checkTypeDecl)
import qualified Language.Futhark.TypeChecker.Types as Types
import Language.Futhark.TypeChecker.Unify hiding (Usage)
import Prelude hiding (mod)
--- Uniqueness
data Usage
= Consumed SrcLoc
| Observed SrcLoc
deriving (Eq, Ord, Show)
type Names = S.Set VName
-- | The consumption set is a Maybe so we can distinguish whether a
-- consumption took place, but the variable went out of scope since,
-- or no consumption at all took place.
data Occurence = Occurence
{ observed :: Names,
consumed :: Maybe Names,
location :: SrcLoc
}
deriving (Eq, Show)
instance Located Occurence where
locOf = locOf . location
observation :: Aliasing -> SrcLoc -> Occurence
observation = flip Occurence Nothing . S.map aliasVar
consumption :: Aliasing -> SrcLoc -> Occurence
consumption = Occurence S.empty . Just . S.map aliasVar
-- | A null occurence is one that we can remove without affecting
-- anything.
nullOccurence :: Occurence -> Bool
nullOccurence occ = S.null (observed occ) && isNothing (consumed occ)
-- | A seminull occurence is one that does not contain references to
-- any variables in scope. The big difference is that a seminull
-- occurence may denote a consumption, as long as the array that was
-- consumed is now out of scope.
seminullOccurence :: Occurence -> Bool
seminullOccurence occ = S.null (observed occ) && maybe True S.null (consumed occ)
type Occurences = [Occurence]
type UsageMap = M.Map VName [Usage]
usageMap :: Occurences -> UsageMap
usageMap = foldl comb M.empty
where
comb m (Occurence obs cons loc) =
let m' = S.foldl' (ins $ Observed loc) m obs
in S.foldl' (ins $ Consumed loc) m' $ fromMaybe mempty cons
ins v m k = M.insertWith (++) k [v] m
combineOccurences :: VName -> Usage -> Usage -> TermTypeM Usage
combineOccurences _ (Observed loc) (Observed _) = return $ Observed loc
combineOccurences name (Consumed wloc) (Observed rloc) =
useAfterConsume (baseName name) rloc wloc
combineOccurences name (Observed rloc) (Consumed wloc) =
useAfterConsume (baseName name) rloc wloc
combineOccurences name (Consumed loc1) (Consumed loc2) =
consumeAfterConsume (baseName name) (max loc1 loc2) (min loc1 loc2)
checkOccurences :: Occurences -> TermTypeM ()
checkOccurences = void . M.traverseWithKey comb . usageMap
where
comb _ [] = return ()
comb name (u : us) = foldM_ (combineOccurences name) u us
allObserved :: Occurences -> Names
allObserved = S.unions . map observed
allConsumed :: Occurences -> Names
allConsumed = S.unions . map (fromMaybe mempty . consumed)
allOccuring :: Occurences -> Names
allOccuring occs = allConsumed occs <> allObserved occs
anyConsumption :: Occurences -> Maybe Occurence
anyConsumption = find (isJust . consumed)
seqOccurences :: Occurences -> Occurences -> Occurences
seqOccurences occurs1 occurs2 =
filter (not . nullOccurence) $ map filt occurs1 ++ occurs2
where
filt occ =
occ {observed = observed occ `S.difference` postcons}
postcons = allConsumed occurs2
altOccurences :: Occurences -> Occurences -> Occurences
altOccurences occurs1 occurs2 =
filter (not . nullOccurence) $ map filt1 occurs1 ++ map filt2 occurs2
where
filt1 occ =
occ
{ consumed = S.difference <$> consumed occ <*> pure cons2,
observed = observed occ `S.difference` cons2
}
filt2 occ =
occ
{ consumed = consumed occ,
observed = observed occ `S.difference` cons1
}
cons1 = allConsumed occurs1
cons2 = allConsumed occurs2
--- Scope management
data Checking
= CheckingApply (Maybe (QualName VName)) Exp StructType StructType
| CheckingReturn StructType StructType
| CheckingAscription StructType StructType
| CheckingLetGeneralise Name
| CheckingParams (Maybe Name)
| CheckingPattern UncheckedPattern InferredType
| CheckingLoopBody StructType StructType
| CheckingLoopInitial StructType StructType
| CheckingRecordUpdate [Name] StructType StructType
| CheckingRequired [StructType] StructType
| CheckingBranches StructType StructType
instance Pretty Checking where
ppr (CheckingApply f e expected actual) =
header
</> "Expected:" <+> align (ppr expected)
</> "Actual: " <+> align (ppr actual)
where
header =
case f of
Nothing ->
"Cannot apply function to"
<+> pquote (shorten $ pretty $ flatten $ ppr e) <> " (invalid type)."
Just fname ->
"Cannot apply" <+> pquote (ppr fname) <+> "to"
<+> pquote (shorten $ pretty $ flatten $ ppr e) <> " (invalid type)."
ppr (CheckingReturn expected actual) =
"Function body does not have expected type."
</> "Expected:" <+> align (ppr expected)
</> "Actual: " <+> align (ppr actual)
ppr (CheckingAscription expected actual) =
"Expression does not have expected type from explicit ascription."
</> "Expected:" <+> align (ppr expected)
</> "Actual: " <+> align (ppr actual)
ppr (CheckingLetGeneralise fname) =
"Cannot generalise type of" <+> pquote (ppr fname) <> "."
ppr (CheckingParams fname) =
"Invalid use of parameters in" <+> pquote fname' <> "."
where
fname' = maybe "anonymous function" ppr fname
ppr (CheckingPattern pat NoneInferred) =
"Invalid pattern" <+> pquote (ppr pat) <> "."
ppr (CheckingPattern pat (Ascribed t)) =
"Pattern" <+> pquote (ppr pat)
<+> "cannot match value of type"
</> indent 2 (ppr t)
ppr (CheckingLoopBody expected actual) =
"Loop body does not have expected type."
</> "Expected:" <+> align (ppr expected)
</> "Actual: " <+> align (ppr actual)
ppr (CheckingLoopInitial expected actual) =
"Initial loop values do not have expected type."
</> "Expected:" <+> align (ppr expected)
</> "Actual: " <+> align (ppr actual)
ppr (CheckingRecordUpdate fs expected actual) =
"Type mismatch when updating record field" <+> pquote fs' <> "."
</> "Existing:" <+> align (ppr expected)
</> "New: " <+> align (ppr actual)
where
fs' = mconcat $ punctuate "." $ map ppr fs
ppr (CheckingRequired [expected] actual) =
"Expression must must have type" <+> ppr expected <> "."
</> "Actual type:" <+> align (ppr actual)
ppr (CheckingRequired expected actual) =
"Type of expression must must be one of " <+> expected' <> "."
</> "Actual type:" <+> align (ppr actual)
where
expected' = commasep (map ppr expected)
ppr (CheckingBranches t1 t2) =
"Conditional branches differ in type."
</> "Former:" <+> ppr t1
</> "Latter:" <+> ppr t2
-- | Whether something is a global or a local variable.
data Locality = Local | Global
deriving (Show)
data ValBinding
= -- | Aliases in parameters indicate the lexical
-- closure.
BoundV Locality [TypeParam] PatternType
| OverloadedF [PrimType] [Maybe PrimType] (Maybe PrimType)
| EqualityF
| WasConsumed SrcLoc
deriving (Show)
-- | Type checking happens with access to this environment. The
-- 'TermScope' will be extended during type-checking as bindings come into
-- scope.
data TermEnv = TermEnv
{ termScope :: TermScope,
termChecking :: Maybe Checking,
termLevel :: Level
}
data TermScope = TermScope
{ scopeVtable :: M.Map VName ValBinding,
scopeTypeTable :: M.Map VName TypeBinding,
scopeModTable :: M.Map VName Mod,
scopeNameMap :: NameMap
}
deriving (Show)
instance Semigroup TermScope where
TermScope vt1 tt1 mt1 nt1 <> TermScope vt2 tt2 mt2 nt2 =
TermScope (vt2 `M.union` vt1) (tt2 `M.union` tt1) (mt1 `M.union` mt2) (nt2 `M.union` nt1)
envToTermScope :: Env -> TermScope
envToTermScope env =
TermScope
{ scopeVtable = vtable,
scopeTypeTable = envTypeTable env,
scopeNameMap = envNameMap env,
scopeModTable = envModTable env
}
where
vtable = M.mapWithKey valBinding $ envVtable env
valBinding k (TypeM.BoundV tps v) =
BoundV Global tps $
v
`setAliases` (if arrayRank v > 0 then S.singleton (AliasBound k) else mempty)
withEnv :: TermEnv -> Env -> TermEnv
withEnv tenv env = tenv {termScope = termScope tenv <> envToTermScope env}
overloadedTypeVars :: Constraints -> Names
overloadedTypeVars = mconcat . map f . M.elems
where
f (_, HasFields fs _) = mconcat $ map typeVars $ M.elems fs
f _ = mempty
-- | Get the type of an expression, with top level type variables
-- substituted. Never call 'typeOf' directly (except in a few
-- carefully inspected locations)!
expType :: Exp -> TermTypeM PatternType
expType = normPatternType . typeOf
-- | Get the type of an expression, with all type variables
-- substituted. Slower than 'expType', but sometimes necessary.
-- Never call 'typeOf' directly (except in a few carefully inspected
-- locations)!
expTypeFully :: Exp -> TermTypeM PatternType
expTypeFully = normTypeFully . typeOf
-- Wrap a function name to give it a vacuous Eq instance for SizeSource.
newtype FName = FName (Maybe (QualName VName))
deriving (Show)
instance Eq FName where
_ == _ = True
instance Ord FName where
compare _ _ = EQ
-- | What was the source of some existential size? This is used for
-- using the same existential variable if the same source is
-- encountered in multiple locations.
data SizeSource
= SourceArg FName (ExpBase NoInfo VName)
| SourceBound (ExpBase NoInfo VName)
| SourceSlice
(Maybe (DimDecl VName))
(Maybe (ExpBase NoInfo VName))
(Maybe (ExpBase NoInfo VName))
(Maybe (ExpBase NoInfo VName))
deriving (Eq, Ord, Show)
-- | The state is a set of constraints and a counter for generating
-- type names. This is distinct from the usual counter we use for
-- generating unique names, as these will be user-visible.
data TermTypeState = TermTypeState
{ stateConstraints :: Constraints,
stateCounter :: !Int,
-- | Mapping function arguments encountered to
-- the sizes they ended up generating (when
-- they could not be substituted directly).
-- This happens for function arguments that are
-- not constants or names.
stateDimTable :: M.Map SizeSource VName
}
newtype TermTypeM a
= TermTypeM
( RWST
TermEnv
Occurences
TermTypeState
TypeM
a
)
deriving
( Monad,
Functor,
Applicative,
MonadReader TermEnv,
MonadWriter Occurences,
MonadState TermTypeState,
MonadError TypeError
)
instance MonadUnify TermTypeM where
getConstraints = gets stateConstraints
putConstraints x = modify $ \s -> s {stateConstraints = x}
newTypeVar loc desc = do
i <- incCounter
v <- newID $ mkTypeVarName desc i
constrain v $ NoConstraint Lifted $ mkUsage' loc
return $ Scalar $ TypeVar mempty Nonunique (typeName v) []
curLevel = asks termLevel
newDimVar loc rigidity name = do
i <- incCounter
dim <- newID $ mkTypeVarName name i
case rigidity of
Rigid rsrc -> constrain dim $ UnknowableSize loc rsrc
Nonrigid -> constrain dim $ Size Nothing $ mkUsage' loc
return dim
unifyError loc notes bcs doc = do
checking <- asks termChecking
case checking of
Just checking' ->
throwError $
TypeError (srclocOf loc) notes $
ppr checking' <> line </> doc <> ppr bcs
Nothing ->
throwError $ TypeError (srclocOf loc) notes $ doc <> ppr bcs
matchError loc notes bcs t1 t2 = do
checking <- asks termChecking
case checking of
Just checking'
| hasNoBreadCrumbs bcs ->
throwError $
TypeError (srclocOf loc) notes $
ppr checking'
| otherwise ->
throwError $
TypeError (srclocOf loc) notes $
ppr checking' <> line </> doc <> ppr bcs
Nothing ->
throwError $ TypeError (srclocOf loc) notes $ doc <> ppr bcs
where
doc =
"Types"
</> indent 2 (ppr t1)
</> "and"
</> indent 2 (ppr t2)
</> "do not match."
onFailure :: Checking -> TermTypeM a -> TermTypeM a
onFailure c = local $ \env -> env {termChecking = Just c}
runTermTypeM :: TermTypeM a -> TypeM (a, Occurences)
runTermTypeM (TermTypeM m) = do
initial_scope <- (initialTermScope <>) . envToTermScope <$> askEnv
let initial_tenv =
TermEnv
{ termScope = initial_scope,
termChecking = Nothing,
termLevel = 0
}
evalRWST m initial_tenv $ TermTypeState mempty 0 mempty
liftTypeM :: TypeM a -> TermTypeM a
liftTypeM = TermTypeM . lift
localScope :: (TermScope -> TermScope) -> TermTypeM a -> TermTypeM a
localScope f = local $ \tenv -> tenv {termScope = f $ termScope tenv}
incCounter :: TermTypeM Int
incCounter = do
s <- get
put s {stateCounter = stateCounter s + 1}
return $ stateCounter s
extSize :: SrcLoc -> SizeSource -> TermTypeM (DimDecl VName, Maybe VName)
extSize loc e = do
prev <- gets $ M.lookup e . stateDimTable
case prev of
Nothing -> do
let rsrc = case e of
SourceArg (FName fname) e' ->
RigidArg fname $ prettyOneLine e'
SourceBound e' ->
RigidBound $ prettyOneLine e'
SourceSlice d i j s ->
RigidSlice d $ prettyOneLine $ DimSlice i j s
d <- newDimVar loc (Rigid rsrc) "argdim"
modify $ \s -> s {stateDimTable = M.insert e d $ stateDimTable s}
return
( NamedDim $ qualName d,
Just d
)
Just d ->
return
( NamedDim $ qualName d,
Nothing
)
-- Any argument sizes created with 'extSize' inside the given action
-- will be removed once the action finishes. This is to ensure that
-- just because e.g. @n+1@ appears as a size in one branch of a
-- conditional, that doesn't mean it's also available in the other branch.
noSizeEscape :: TermTypeM a -> TermTypeM a
noSizeEscape m = do
dimtable <- gets stateDimTable
x <- m
modify $ \s -> s {stateDimTable = dimtable}
return x
constrain :: VName -> Constraint -> TermTypeM ()
constrain v c = do
lvl <- curLevel
modifyConstraints $ M.insert v (lvl, c)
incLevel :: TermTypeM a -> TermTypeM a
incLevel = local $ \env -> env {termLevel = termLevel env + 1}
initialTermScope :: TermScope
initialTermScope =
TermScope
{ scopeVtable = initialVtable,
scopeTypeTable = mempty,
scopeNameMap = topLevelNameMap,
scopeModTable = mempty
}
where
initialVtable = M.fromList $ mapMaybe addIntrinsicF $ M.toList intrinsics
prim = Scalar . Prim
arrow x y = Scalar $ Arrow mempty Unnamed x y
addIntrinsicF (name, IntrinsicMonoFun pts t) =
Just (name, BoundV Global [] $ arrow pts' $ prim t)
where
pts' = case pts of
[pt] -> prim pt
_ -> tupleRecord $ map prim pts
addIntrinsicF (name, IntrinsicOverloadedFun ts pts rts) =
Just (name, OverloadedF ts pts rts)
addIntrinsicF (name, IntrinsicPolyFun tvs pts rt) =
Just
( name,
BoundV Global tvs $
fromStruct $ Scalar $ Arrow mempty Unnamed pts' rt
)
where
pts' = case pts of
[pt] -> pt
_ -> tupleRecord pts
addIntrinsicF (name, IntrinsicEquality) =
Just (name, EqualityF)
addIntrinsicF _ = Nothing
instance MonadTypeChecker TermTypeM where
warn loc problem = liftTypeM $ warn loc problem
newName = liftTypeM . newName
newID = liftTypeM . newID
checkQualName space name loc = snd <$> checkQualNameWithEnv space name loc
bindNameMap m = localScope $ \scope ->
scope {scopeNameMap = m <> scopeNameMap scope}
bindVal v (TypeM.BoundV tps t) = localScope $ \scope ->
scope {scopeVtable = M.insert v vb $ scopeVtable scope}
where
vb = BoundV Local tps $ fromStruct t
lookupType loc qn = do
outer_env <- liftTypeM askEnv
(scope, qn'@(QualName qs name)) <- checkQualNameWithEnv Type qn loc
case M.lookup name $ scopeTypeTable scope of
Nothing -> unknownType loc qn
Just (TypeAbbr l ps def) ->
return (qn', ps, qualifyTypeVars outer_env (map typeParamName ps) qs def, l)
lookupMod loc qn = do
(scope, qn'@(QualName _ name)) <- checkQualNameWithEnv Term qn loc
case M.lookup name $ scopeModTable scope of
Nothing -> unknownVariable Term qn loc
Just m -> return (qn', m)
lookupVar loc qn = do
outer_env <- liftTypeM askEnv
(scope, qn'@(QualName qs name)) <- checkQualNameWithEnv Term qn loc
let usage = mkUsage loc $ "use of " ++ quote (pretty qn)
t <- case M.lookup name $ scopeVtable scope of
Nothing ->
typeError loc mempty $
"Unknown variable" <+> pquote (ppr qn) <> "."
Just (WasConsumed wloc) -> useAfterConsume (baseName name) loc wloc
Just (BoundV _ tparams t)
| "_" `isPrefixOf` baseString name -> underscoreUse loc qn
| otherwise -> do
(tnames, t') <- instantiateTypeScheme loc tparams t
return $ qualifyTypeVars outer_env tnames qs t'
Just EqualityF -> do
argtype <- newTypeVar loc "t"
equalityType usage argtype
return $
Scalar $
Arrow mempty Unnamed argtype $
Scalar $ Arrow mempty Unnamed argtype $ Scalar $ Prim Bool
Just (OverloadedF ts pts rt) -> do
argtype <- newTypeVar loc "t"
mustBeOneOf ts usage argtype
let (pts', rt') = instOverloaded argtype pts rt
arrow xt yt = Scalar $ Arrow mempty Unnamed xt yt
return $ fromStruct $ foldr arrow rt' pts'
observe $ Ident name (Info t) loc
return (qn', t)
where
instOverloaded argtype pts rt =
( map (maybe (toStruct argtype) (Scalar . Prim)) pts,
maybe (toStruct argtype) (Scalar . Prim) rt
)
checkNamedDim loc v = do
(v', t) <- lookupVar loc v
onFailure (CheckingRequired [Scalar $ Prim $ Signed Int32] (toStruct t)) $
unify (mkUsage loc "use as array size") (toStruct t) $
Scalar $ Prim $ Signed Int32
return v'
typeError loc notes s = do
checking <- asks termChecking
case checking of
Just checking' ->
throwError $ TypeError (srclocOf loc) notes (ppr checking' <> line </> s)
Nothing ->
throwError $ TypeError (srclocOf loc) notes s
checkQualNameWithEnv :: Namespace -> QualName Name -> SrcLoc -> TermTypeM (TermScope, QualName VName)
checkQualNameWithEnv space qn@(QualName quals name) loc = do
scope <- asks termScope
descend scope quals
where
descend scope []
| Just name' <- M.lookup (space, name) $ scopeNameMap scope =
return (scope, name')
| otherwise =
unknownVariable space qn loc
descend scope (q : qs)
| Just (QualName _ q') <- M.lookup (Term, q) $ scopeNameMap scope,
Just res <- M.lookup q' $ scopeModTable scope =
case res of
-- Check if we are referring to the magical intrinsics
-- module.
_
| baseTag q' <= maxIntrinsicTag ->
checkIntrinsic space qn loc
ModEnv q_scope -> do
(scope', QualName qs' name') <- descend (envToTermScope q_scope) qs
return (scope', QualName (q' : qs') name')
ModFun {} -> unappliedFunctor loc
| otherwise =
unknownVariable space qn loc
checkIntrinsic :: Namespace -> QualName Name -> SrcLoc -> TermTypeM (TermScope, QualName VName)
checkIntrinsic space qn@(QualName _ name) loc
| Just v <- M.lookup (space, name) intrinsicsNameMap = do
me <- liftTypeM askImportName
unless ("/prelude" `isPrefixOf` includeToString me) $
warn loc "Using intrinsic functions directly can easily crash the compiler or result in wrong code generation."
scope <- asks termScope
return (scope, v)
| otherwise =
unknownVariable space qn loc
-- | Wrap 'Types.checkTypeDecl' to also perform an observation of
-- every size in the type.
checkTypeDecl :: TypeDeclBase NoInfo Name -> TermTypeM (TypeDeclBase Info VName)
checkTypeDecl tdecl = do
(tdecl', _) <- Types.checkTypeDecl tdecl
mapM_ observeDim $ nestedDims $ unInfo $ expandedType tdecl'
return tdecl'
where
observeDim (NamedDim v) =
observe $ Ident (qualLeaf v) (Info $ Scalar $ Prim $ Signed Int32) mempty
observeDim _ = return ()
-- | Instantiate a type scheme with fresh type variables for its type
-- parameters. Returns the names of the fresh type variables, the
-- instance list, and the instantiated type.
instantiateTypeScheme ::
SrcLoc ->
[TypeParam] ->
PatternType ->
TermTypeM ([VName], PatternType)
instantiateTypeScheme loc tparams t = do
let tnames = map typeParamName tparams
(tparam_names, tparam_substs) <- unzip <$> mapM (instantiateTypeParam loc) tparams
let substs = M.fromList $ zip tnames tparam_substs
t' = applySubst (`M.lookup` substs) t
return (tparam_names, t')
-- | Create a new type name and insert it (unconstrained) in the
-- substitution map.
instantiateTypeParam :: Monoid as => SrcLoc -> TypeParam -> TermTypeM (VName, Subst (TypeBase dim as))
instantiateTypeParam loc tparam = do
i <- incCounter
v <- newID $ mkTypeVarName (takeWhile isAscii (baseString (typeParamName tparam))) i
case tparam of
TypeParamType x _ _ -> do
constrain v $ NoConstraint x $ mkUsage' loc
return (v, Subst $ Scalar $ TypeVar mempty Nonunique (typeName v) [])
TypeParamDim {} -> do
constrain v $ Size Nothing $ mkUsage' loc
return (v, SizeSubst $ NamedDim $ qualName v)
newArrayType :: SrcLoc -> String -> Int -> TermTypeM (StructType, StructType)
newArrayType loc desc r = do
v <- newID $ nameFromString desc
constrain v $ NoConstraint Unlifted $ mkUsage' loc
dims <- replicateM r $ newDimVar loc Nonrigid "dim"
let rowt = TypeVar () Nonunique (typeName v) []
return
( Array () Nonunique rowt (ShapeDecl $ map (NamedDim . qualName) dims),
Scalar rowt
)
--- Errors
useAfterConsume :: Name -> SrcLoc -> SrcLoc -> TermTypeM a
useAfterConsume name rloc wloc =
typeError rloc mempty $
"Variable" <+> pquote (pprName name) <+> "previously consumed at"
<+> text (locStrRel rloc wloc) <> ". (Possibly through aliasing.)"
consumeAfterConsume :: Name -> SrcLoc -> SrcLoc -> TermTypeM a
consumeAfterConsume name loc1 loc2 =
typeError loc2 mempty $
"Variable" <+> pprName name <+> "previously consumed at"
<+> text (locStrRel loc2 loc1) <> "."
badLetWithValue :: SrcLoc -> TermTypeM a
badLetWithValue loc =
typeError
loc
mempty
"New value for elements in let-with shares data with source array. This is illegal, as it prevents in-place modification."
returnAliased :: Name -> Name -> SrcLoc -> TermTypeM ()
returnAliased fname name loc =
typeError loc mempty $
"Unique return value of" <+> pquote (pprName fname)
<+> "is aliased to"
<+> pquote (pprName name) <> ", which is not consumed."
uniqueReturnAliased :: Name -> SrcLoc -> TermTypeM a
uniqueReturnAliased fname loc =
typeError loc mempty $
"A unique tuple element of return value of"
<+> pquote (pprName fname)
<+> "is aliased to some other tuple component."
unexpectedType :: MonadTypeChecker m => SrcLoc -> StructType -> [StructType] -> m a
unexpectedType loc _ [] =
typeError loc mempty $
"Type of expression at" <+> text (locStr loc)
<+> "cannot have any type - possibly a bug in the type checker."
unexpectedType loc t ts =
typeError loc mempty $
"Type of expression at" <+> text (locStr loc) <+> "must be one of"
<+> commasep (map ppr ts) <> ", but is"
<+> ppr t <> "."
--- Basic checking
-- | Determine if the two types of identical, ignoring uniqueness.
-- Mismatched dimensions are turned into fresh rigid type variables.
-- Causes a 'TypeError' if they fail to match, and otherwise returns
-- one of them.
unifyBranchTypes :: SrcLoc -> PatternType -> PatternType -> TermTypeM (PatternType, [VName])
unifyBranchTypes loc t1 t2 =
onFailure (CheckingBranches (toStruct t1) (toStruct t2)) $
unifyMostCommon (mkUsage loc "unification of branch results") t1 t2
unifyBranches :: SrcLoc -> Exp -> Exp -> TermTypeM (PatternType, [VName])
unifyBranches loc e1 e2 = do
e1_t <- expTypeFully e1
e2_t <- expTypeFully e2
unifyBranchTypes loc e1_t e2_t
--- General binding.
doNotShadow :: [String]
doNotShadow = ["&&", "||"]
data InferredType
= NoneInferred
| Ascribed PatternType
checkPattern' ::
UncheckedPattern ->
InferredType ->
TermTypeM Pattern
checkPattern' (PatternParens p loc) t =
PatternParens <$> checkPattern' p t <*> pure loc
checkPattern' (Id name _ loc) _
| name' `elem` doNotShadow =
typeError loc mempty $ "The" <+> text name' <+> "operator may not be redefined."
where
name' = nameToString name
checkPattern' (Id name NoInfo loc) (Ascribed t) = do
name' <- newID name
return $ Id name' (Info t) loc
checkPattern' (Id name NoInfo loc) NoneInferred = do
name' <- newID name
t <- newTypeVar loc "t"
return $ Id name' (Info t) loc
checkPattern' (Wildcard _ loc) (Ascribed t) =
return $ Wildcard (Info $ t `setUniqueness` Nonunique) loc
checkPattern' (Wildcard NoInfo loc) NoneInferred = do
t <- newTypeVar loc "t"
return $ Wildcard (Info t) loc
checkPattern' (TuplePattern ps loc) (Ascribed t)
| Just ts <- isTupleRecord t,
length ts == length ps =
TuplePattern <$> zipWithM checkPattern' ps (map Ascribed ts) <*> pure loc
checkPattern' p@(TuplePattern ps loc) (Ascribed t) = do
ps_t <- replicateM (length ps) (newTypeVar loc "t")
unify (mkUsage loc "matching a tuple pattern") (tupleRecord ps_t) $ toStruct t
t' <- normTypeFully t
checkPattern' p $ Ascribed t'
checkPattern' (TuplePattern ps loc) NoneInferred =
TuplePattern <$> mapM (`checkPattern'` NoneInferred) ps <*> pure loc
checkPattern' (RecordPattern p_fs _) _
| Just (f, fp) <- find (("_" `isPrefixOf`) . nameToString . fst) p_fs =
typeError fp mempty $
"Underscore-prefixed fields are not allowed."
</> "Did you mean" <> dquotes (text (drop 1 (nameToString f)) <> "=_") <> "?"
checkPattern' (RecordPattern p_fs loc) (Ascribed (Scalar (Record t_fs)))
| sort (map fst p_fs) == sort (M.keys t_fs) =
RecordPattern . M.toList <$> check <*> pure loc
where
check =
traverse (uncurry checkPattern') $
M.intersectionWith
(,)
(M.fromList p_fs)
(fmap Ascribed t_fs)
checkPattern' p@(RecordPattern fields loc) (Ascribed t) = do
fields' <- traverse (const $ newTypeVar loc "t") $ M.fromList fields
when (sort (M.keys fields') /= sort (map fst fields)) $
typeError loc mempty $ "Duplicate fields in record pattern" <+> ppr p <> "."
unify (mkUsage loc "matching a record pattern") (Scalar (Record fields')) $ toStruct t
t' <- normTypeFully t
checkPattern' p $ Ascribed t'
checkPattern' (RecordPattern fs loc) NoneInferred =
RecordPattern . M.toList <$> traverse (`checkPattern'` NoneInferred) (M.fromList fs) <*> pure loc
checkPattern' (PatternAscription p (TypeDecl t NoInfo) loc) maybe_outer_t = do
(t', st_nodims, _) <- checkTypeExp t
(st, _) <- instantiateEmptyArrayDims loc "impl" Nonrigid st_nodims
let st' = fromStruct st
case maybe_outer_t of
Ascribed outer_t -> do
unify (mkUsage loc "explicit type ascription") (toStruct st) (toStruct outer_t)
-- We also have to make sure that uniqueness matches. This is
-- done explicitly, because it is ignored by unification.
st'' <- normTypeFully st'
outer_t' <- normTypeFully outer_t
case unifyTypesU unifyUniqueness st'' outer_t' of
Just outer_t'' ->
PatternAscription <$> checkPattern' p (Ascribed outer_t'')
<*> pure (TypeDecl t' (Info st))
<*> pure loc
Nothing ->
typeError loc mempty $
"Cannot match type" <+> pquote (ppr outer_t') <+> "with expected type"
<+> pquote (ppr st'') <> "."
NoneInferred ->
PatternAscription <$> checkPattern' p (Ascribed st')
<*> pure (TypeDecl t' (Info st))
<*> pure loc
where
unifyUniqueness u1 u2 = if u2 `subuniqueOf` u1 then Just u1 else Nothing
checkPattern' (PatternLit e NoInfo loc) (Ascribed t) = do
e' <- checkExp e
t' <- expTypeFully e'
unify (mkUsage loc "matching against literal") (toStruct t') (toStruct t)
return $ PatternLit e' (Info t') loc
checkPattern' (PatternLit e NoInfo loc) NoneInferred = do
e' <- checkExp e
t' <- expTypeFully e'
return $ PatternLit e' (Info t') loc
checkPattern' (PatternConstr n NoInfo ps loc) (Ascribed (Scalar (Sum cs)))
| Just ts <- M.lookup n cs = do
ps' <- zipWithM checkPattern' ps $ map Ascribed ts
return $ PatternConstr n (Info (Scalar (Sum cs))) ps' loc
checkPattern' (PatternConstr n NoInfo ps loc) (Ascribed t) = do
t' <- newTypeVar loc "t"
ps' <- mapM (`checkPattern'` NoneInferred) ps
mustHaveConstr usage n t' (patternStructType <$> ps')
unify usage t' (toStruct t)
t'' <- normTypeFully t
return $ PatternConstr n (Info t'') ps' loc
where
usage = mkUsage loc "matching against constructor"
checkPattern' (PatternConstr n NoInfo ps loc) NoneInferred = do
ps' <- mapM (`checkPattern'` NoneInferred) ps
t <- newTypeVar loc "t"
mustHaveConstr usage n t (patternStructType <$> ps')
return $ PatternConstr n (Info $ fromStruct t) ps' loc
where
usage = mkUsage loc "matching against constructor"
patternNameMap :: Pattern -> NameMap
patternNameMap = M.fromList . map asTerm . S.toList . patternNames
where
asTerm v = ((Term, baseName v), qualName v)
checkPattern ::
UncheckedPattern ->
InferredType ->
(Pattern -> TermTypeM a) ->
TermTypeM a
checkPattern p t m = do
checkForDuplicateNames [p]
p' <- onFailure (CheckingPattern p t) $ checkPattern' p t
bindNameMap (patternNameMap p') $ m p'
binding :: [Ident] -> TermTypeM a -> TermTypeM a
binding bnds = check . handleVars
where
handleVars m =
localScope (`bindVars` bnds) $ do
-- Those identifiers that can potentially also be sizes are
-- added as type constraints. This is necessary so that we
-- can properly detect scope violations during unification.
-- We do this for *all* identifiers, not just those that are
-- integers, because they may become integers later due to
-- inference...
forM_ bnds $ \ident ->
constrain (identName ident) $ ParamSize $ srclocOf ident
m
bindVars :: TermScope -> [Ident] -> TermScope
bindVars = foldl bindVar
bindVar :: TermScope -> Ident -> TermScope
bindVar scope (Ident name (Info tp) _) =
let inedges = boundAliases $ aliases tp
update (BoundV l tparams in_t)
-- If 'name' is record or sum-typed, don't alias the
-- components to 'name', because these no identity
-- beyond their components.
| Array {} <- tp = BoundV l tparams (in_t `addAliases` S.insert (AliasBound name))
| otherwise = BoundV l tparams in_t
update b = b
tp' = tp `addAliases` S.insert (AliasBound name)
in scope
{ scopeVtable =
M.insert name (BoundV Local [] tp') $
adjustSeveral update inedges $
scopeVtable scope
}
adjustSeveral f = flip $ foldl $ flip $ M.adjust f
-- Check whether the bound variables have been used correctly
-- within their scope.
check m = do
(a, usages) <- collectBindingsOccurences m
checkOccurences usages
mapM_ (checkIfUsed usages) bnds
return a
-- Collect and remove all occurences in @bnds@. This relies
-- on the fact that no variables shadow any other.
collectBindingsOccurences m = pass $ do
(x, usage) <- listen m
let (relevant, rest) = split usage
return ((x, relevant), const rest)
where
split =
unzip
. map
( \occ ->
let (obs1, obs2) = divide $ observed occ
occ_cons = divide <$> consumed occ
con1 = fst <$> occ_cons
con2 = snd <$> occ_cons
in ( occ {observed = obs1, consumed = con1},
occ {observed = obs2, consumed = con2}
)
)
names = S.fromList $ map identName bnds
divide s = (s `S.intersection` names, s `S.difference` names)
bindingTypes ::
[Either (VName, TypeBinding) (VName, Constraint)] ->
TermTypeM a ->
TermTypeM a
bindingTypes types m = do
lvl <- curLevel
modifyConstraints (<> M.map (lvl,) (M.fromList constraints))
localScope extend m
where
(tbinds, constraints) = partitionEithers types
extend scope =
scope
{ scopeTypeTable = M.fromList tbinds <> scopeTypeTable scope
}
bindingTypeParams :: [TypeParam] -> TermTypeM a -> TermTypeM a
bindingTypeParams tparams =
binding (mapMaybe typeParamIdent tparams)
. bindingTypes (concatMap typeParamType tparams)
where
typeParamType (TypeParamType l v loc) =
[ Left (v, TypeAbbr l [] (Scalar (TypeVar () Nonunique (typeName v) []))),
Right (v, ParamType l loc)
]
typeParamType (TypeParamDim v loc) =
[Right (v, ParamSize loc)]
typeParamIdent :: TypeParam -> Maybe Ident
typeParamIdent (TypeParamDim v loc) =
Just $ Ident v (Info $ Scalar $ Prim $ Signed Int32) loc
typeParamIdent _ = Nothing
bindingIdent ::
IdentBase NoInfo Name ->
PatternType ->
(Ident -> TermTypeM a) ->
TermTypeM a
bindingIdent (Ident v NoInfo vloc) t m =
bindSpaced [(Term, v)] $ do
v' <- checkName Term v vloc
let ident = Ident v' (Info t) vloc
binding [ident] $ m ident
bindingParams ::
[UncheckedTypeParam] ->
[UncheckedPattern] ->
([TypeParam] -> [Pattern] -> TermTypeM a) ->
TermTypeM a
bindingParams tps orig_ps m = do
checkForDuplicateNames orig_ps
checkTypeParams tps $ \tps' -> bindingTypeParams tps' $ do
let descend ps' (p : ps) =
checkPattern p NoneInferred $ \p' ->
binding (S.toList $ patternIdents p') $ descend (p' : ps') ps
descend ps' [] = do
-- Perform an observation of every type parameter. This
-- prevents unused-name warnings for otherwise unused
-- dimensions.
mapM_ observe $ mapMaybe typeParamIdent tps'
m tps' $ reverse ps'
descend [] orig_ps
bindingPattern ::
PatternBase NoInfo Name ->
InferredType ->
(Pattern -> TermTypeM a) ->
TermTypeM a
bindingPattern p t m = do
checkForDuplicateNames [p]
checkPattern p t $ \p' -> binding (S.toList $ patternIdents p') $ do
-- Perform an observation of every declared dimension. This
-- prevents unused-name warnings for otherwise unused dimensions.
mapM_ observe $ patternDims p'
m p'
patternDims :: Pattern -> [Ident]
patternDims (PatternParens p _) = patternDims p
patternDims (TuplePattern pats _) = concatMap patternDims pats
patternDims (PatternAscription p (TypeDecl _ (Info t)) _) =
patternDims p <> mapMaybe (dimIdent (srclocOf p)) (nestedDims t)
where
dimIdent _ AnyDim = Nothing
dimIdent _ (ConstDim _) = Nothing
dimIdent _ NamedDim {} = Nothing
patternDims _ = []
sliceShape ::
Maybe (SrcLoc, Rigidity) ->
[DimIndex] ->
TypeBase (DimDecl VName) as ->
TermTypeM (TypeBase (DimDecl VName) as, [VName])
sliceShape r slice t@(Array als u et (ShapeDecl orig_dims)) =
runWriterT $ setDims <$> adjustDims slice orig_dims
where
setDims [] = stripArray (length orig_dims) t
setDims dims' = Array als u et $ ShapeDecl dims'
-- If the result is supposed to be AnyDim or a nonrigid size
-- variable, then don't bother trying to create
-- non-existential sizes. This is necessary to make programs
-- type-check without too much ceremony; see
-- e.g. tests/inplace5.fut.
isRigid Rigid {} = True
isRigid _ = False
refine_sizes = maybe False (isRigid . snd) r
sliceSize orig_d i j stride =
case r of
Just (loc, Rigid _) -> do
(d, ext) <-
lift $
extSize loc $
SourceSlice orig_d' (bareExp <$> i) (bareExp <$> j) (bareExp <$> stride)
tell $ maybeToList ext
return d
Just (loc, Nonrigid) ->
lift $ NamedDim . qualName <$> newDimVar loc Nonrigid "slice_dim"
Nothing ->
pure AnyDim
where
-- The original size does not matter if the slice is fully specified.
orig_d'
| isJust i, isJust j = Nothing
| otherwise = Just orig_d
adjustDims (DimFix {} : idxes') (_ : dims) =
adjustDims idxes' dims
-- Pattern match some known slices to be non-existential.
adjustDims (DimSlice i j stride : idxes') (_ : dims)
| refine_sizes,
maybe True ((== Just 0) . isInt32) i,
Just j' <- maybeDimFromExp =<< j,
maybe True ((== Just 1) . isInt32) stride =
(j' :) <$> adjustDims idxes' dims
adjustDims (DimSlice Nothing Nothing stride : idxes') (d : dims)
| refine_sizes,
maybe True (maybe False ((== 1) . abs) . isInt32) stride =
(d :) <$> adjustDims idxes' dims
adjustDims (DimSlice i j stride : idxes') (d : dims) =
(:) <$> sliceSize d i j stride <*> adjustDims idxes' dims
adjustDims _ dims =
pure dims
sliceShape _ _ t = pure (t, [])
--- Main checkers
-- | @require ts e@ causes a 'TypeError' if @expType e@ is not one of
-- the types in @ts@. Otherwise, simply returns @e@.
require :: String -> [PrimType] -> Exp -> TermTypeM Exp
require why ts e = do
mustBeOneOf ts (mkUsage (srclocOf e) why) . toStruct =<< expType e
return e
unifies :: String -> StructType -> Exp -> TermTypeM Exp
unifies why t e = do
unify (mkUsage (srclocOf e) why) t . toStruct =<< expType e
return e
-- The closure of a lambda or local function are those variables that
-- it references, and which local to the current top-level function.
lexicalClosure :: [Pattern] -> Occurences -> TermTypeM Aliasing
lexicalClosure params closure = do
vtable <- asks $ scopeVtable . termScope
let isLocal v = case v `M.lookup` vtable of
Just (BoundV Local _ _) -> True
_ -> False
return $
S.map AliasBound $
S.filter isLocal $
allOccuring closure S.\\ mconcat (map patternNames params)
noAliasesIfOverloaded :: PatternType -> TermTypeM PatternType
noAliasesIfOverloaded t@(Scalar (TypeVar _ u tn [])) = do
subst <- fmap snd . M.lookup (typeLeaf tn) <$> getConstraints
case subst of
Just Overloaded {} -> return $ Scalar $ TypeVar mempty u tn []
_ -> return t
noAliasesIfOverloaded t =
return t
-- Check the common parts of ascription and coercion.
checkAscript ::
SrcLoc ->
UncheckedTypeDecl ->
UncheckedExp ->
(StructType -> StructType) ->
TermTypeM (TypeDecl, Exp)
checkAscript loc decl e shapef = do
decl' <- checkTypeDecl decl
e' <- checkExp e
t <- expTypeFully e'
(decl_t_nonrigid, _) <-
instantiateEmptyArrayDims loc "impl" Nonrigid $
shapef $
unInfo $ expandedType decl'
onFailure (CheckingAscription (unInfo $ expandedType decl') (toStruct t)) $
unify (mkUsage loc "type ascription") decl_t_nonrigid (toStruct t)
-- We also have to make sure that uniqueness matches. This is done
-- explicitly, because uniqueness is ignored by unification.
t' <- normTypeFully t
decl_t' <- normTypeFully $ unInfo $ expandedType decl'
unless (t' `subtypeOf` anySizes decl_t') $
typeError loc mempty $
"Type" <+> pquote (ppr t') <+> "is not a subtype of"
<+> pquote (ppr decl_t') <> "."
return (decl', e')
unscopeType ::
SrcLoc ->
M.Map VName Ident ->
PatternType ->
TermTypeM (PatternType, [VName])
unscopeType tloc unscoped t = do
(t', m) <- runStateT (traverseDims onDim t) mempty
return (t' `addAliases` S.map unAlias, M.elems m)
where
onDim _ p (NamedDim d)
| Just loc <- srclocOf <$> M.lookup (qualLeaf d) unscoped =
if p == PosImmediate || p == PosParam
then inst loc $ qualLeaf d
else return AnyDim
onDim _ _ d = return d
inst loc d = do
prev <- gets $ M.lookup d
case prev of
Just d' -> return $ NamedDim $ qualName d'
Nothing -> do
d' <- lift $ newDimVar tloc (Rigid $ RigidOutOfScope loc d) "d"
modify $ M.insert d d'
return $ NamedDim $ qualName d'
unAlias (AliasBound v) | v `M.member` unscoped = AliasFree v
unAlias a = a
-- 'checkApplyExp' is like 'checkExp', but tries to find the "root
-- function", for better error messages.
checkApplyExp :: UncheckedExp -> TermTypeM (Exp, ApplyOp)
checkApplyExp (Apply e1 e2 _ _ loc) = do
(e1', (fname, i)) <- checkApplyExp e1
arg <- checkArg e2
t <- expType e1'
(t1, rt, argext, exts) <- checkApply loc (fname, i) t arg
return
( Apply e1' (argExp arg) (Info (diet t1, argext)) (Info rt, Info exts) loc,
(fname, i + 1)
)
checkApplyExp e = do
e' <- checkExp e
return
( e',
( case e' of
Var qn _ _ -> Just qn
_ -> Nothing,
0
)
)
checkExp :: UncheckedExp -> TermTypeM Exp
checkExp (Literal val loc) =
return $ Literal val loc
checkExp (StringLit vs loc) =
return $ StringLit vs loc
checkExp (IntLit val NoInfo loc) = do
t <- newTypeVar loc "t"
mustBeOneOf anyNumberType (mkUsage loc "integer literal") t
return $ IntLit val (Info $ fromStruct t) loc
checkExp (FloatLit val NoInfo loc) = do
t <- newTypeVar loc "t"
mustBeOneOf anyFloatType (mkUsage loc "float literal") t
return $ FloatLit val (Info $ fromStruct t) loc
checkExp (TupLit es loc) =
TupLit <$> mapM checkExp es <*> pure loc
checkExp (RecordLit fs loc) = do
fs' <- evalStateT (mapM checkField fs) mempty
return $ RecordLit fs' loc
where
checkField (RecordFieldExplicit f e rloc) = do
errIfAlreadySet f rloc
modify $ M.insert f rloc
RecordFieldExplicit f <$> lift (checkExp e) <*> pure rloc
checkField (RecordFieldImplicit name NoInfo rloc) = do
errIfAlreadySet name rloc
(QualName _ name', t) <- lift $ lookupVar rloc $ qualName name
modify $ M.insert name rloc
return $ RecordFieldImplicit name' (Info t) rloc
errIfAlreadySet f rloc = do
maybe_sloc <- gets $ M.lookup f
case maybe_sloc of
Just sloc ->
lift $
typeError rloc mempty $
"Field" <+> pquote (ppr f)
<+> "previously defined at"
<+> text (locStrRel rloc sloc) <> "."
Nothing -> return ()
checkExp (ArrayLit all_es _ loc) =
-- Construct the result type and unify all elements with it. We
-- only create a type variable for empty arrays; otherwise we use
-- the type of the first element. This significantly cuts down on
-- the number of type variables generated for pathologically large
-- multidimensional array literals.
case all_es of
[] -> do
et <- newTypeVar loc "t"
t <- arrayOfM loc et (ShapeDecl [ConstDim 0]) Unique
return $ ArrayLit [] (Info t) loc
e : es -> do
e' <- checkExp e
et <- expType e'
es' <- mapM (unifies "type of first array element" (toStruct et) <=< checkExp) es
et' <- normTypeFully et
t <- arrayOfM loc et' (ShapeDecl [ConstDim $ length all_es]) Unique
return $ ArrayLit (e' : es') (Info t) loc
checkExp (Range start maybe_step end _ loc) = do
start' <- require "use in range expression" anySignedType =<< checkExp start
start_t <- toStruct <$> expTypeFully start'
maybe_step' <- case maybe_step of
Nothing -> return Nothing
Just step -> do
let warning = warn loc "First and second element of range are identical, this will produce an empty array."
case (start, step) of
(Literal x _, Literal y _) -> when (x == y) warning
(Var x_name _ _, Var y_name _ _) -> when (x_name == y_name) warning
_ -> return ()
Just <$> (unifies "use in range expression" start_t =<< checkExp step)
let unifyRange e = unifies "use in range expression" start_t =<< checkExp e
end' <- case end of
DownToExclusive e -> DownToExclusive <$> unifyRange e
UpToExclusive e -> UpToExclusive <$> unifyRange e
ToInclusive e -> ToInclusive <$> unifyRange e
-- Special case some ranges to give them a known size.
let dimFromBound = dimFromExp (SourceBound . bareExp)
(dim, retext) <-
case (isInt32 start', isInt32 <$> maybe_step', end') of
(Just 0, Just (Just 1), UpToExclusive end'') ->
dimFromBound end''
(Just 0, Nothing, UpToExclusive end'') ->
dimFromBound end''
(Just 1, Just (Just 2), ToInclusive end'') ->
dimFromBound end''
_ -> do
d <- newDimVar loc (Rigid RigidRange) "range_dim"
return (NamedDim $ qualName d, Just d)
t <- arrayOfM loc start_t (ShapeDecl [dim]) Unique
let ret = (Info (t `setAliases` mempty), Info $ maybeToList retext)
return $ Range start' maybe_step' end' ret loc
checkExp (Ascript e decl loc) = do
(decl', e') <- checkAscript loc decl e id
return $ Ascript e' decl' loc
checkExp (Coerce e decl _ loc) = do
-- We instantiate the declared types with all dimensions as nonrigid
-- fresh type variables, which we then use to unify with the type of
-- 'e'. This lets 'e' have whatever sizes it wants, but the overall
-- type must still match. Eventually we will throw away those sizes
-- (they will end up being unified with various sizes in 'e', which
-- is fine).
(decl', e') <- checkAscript loc decl e anySizes
-- Now we instantiate the declared type again, but this time we keep
-- around the sizes as existentials. This is the result of the
-- ascription as a whole. We use matchDims to obtain the aliasing
-- of 'e'.
(decl_t_rigid, ext) <-
instantiateDimsInReturnType loc Nothing $ unInfo $ expandedType decl'
t <- expTypeFully e'
t' <- matchDims (const pure) t $ fromStruct decl_t_rigid
return $ Coerce e' decl' (Info t', Info ext) loc
checkExp (BinOp (op, oploc) NoInfo (e1, _) (e2, _) NoInfo NoInfo loc) = do
(op', ftype) <- lookupVar oploc op
e1_arg <- checkArg e1
e2_arg <- checkArg e2
-- Note that the application to the first operand cannot fix any
-- existential sizes, because it must by necessity be a function.
(p1_t, rt, p1_ext, _) <- checkApply loc (Just op', 0) ftype e1_arg
(p2_t, rt', p2_ext, retext) <- checkApply loc (Just op', 1) rt e2_arg
return $
BinOp
(op', oploc)
(Info ftype)
(argExp e1_arg, Info (toStruct p1_t, p1_ext))
(argExp e2_arg, Info (toStruct p2_t, p2_ext))
(Info rt')
(Info retext)
loc
checkExp (Project k e NoInfo loc) = do
e' <- checkExp e
t <- expType e'
kt <- mustHaveField (mkUsage loc $ "projection of field " ++ quote (pretty k)) k t
return $ Project k e' (Info kt) loc
checkExp (If e1 e2 e3 _ loc) =
sequentially checkCond $ \e1' _ -> do
((e2', e3'), dflow) <- tapOccurences $ checkExp e2 `alternative` checkExp e3
(brancht, retext) <- unifyBranches loc e2' e3'
let t' = addAliases brancht (`S.difference` S.map AliasBound (allConsumed dflow))
zeroOrderType
(mkUsage loc "returning value of this type from 'if' expression")
"type returned from branch"
t'
return $ If e1' e2' e3' (Info t', Info retext) loc
where
checkCond = do
e1' <- checkExp e1
let bool = Scalar $ Prim Bool
e1_t <- toStruct <$> expType e1'
onFailure (CheckingRequired [bool] e1_t) $
unify (mkUsage (srclocOf e1') "use as 'if' condition") bool e1_t
return e1'
checkExp (Parens e loc) =
Parens <$> checkExp e <*> pure loc
checkExp (QualParens (modname, modnameloc) e loc) = do
(modname', mod) <- lookupMod loc modname
case mod of
ModEnv env -> local (`withEnv` qualifyEnv modname' env) $ do
e' <- checkExp e
return $ QualParens (modname', modnameloc) e' loc
ModFun {} ->
typeError loc mempty $ "Module" <+> ppr modname <+> " is a parametric module."
where
qualifyEnv modname' env =
env {envNameMap = M.map (qualify' modname') $ envNameMap env}
qualify' modname' (QualName qs name) =
QualName (qualQuals modname' ++ [qualLeaf modname'] ++ qs) name
checkExp (Var qn NoInfo loc) = do
-- The qualifiers of a variable is divided into two parts: first a
-- possibly-empty sequence of module qualifiers, followed by a
-- possible-empty sequence of record field accesses. We use scope
-- information to perform the split, by taking qualifiers off the
-- end until we find a module.
(qn', t, fields) <- findRootVar (qualQuals qn) (qualLeaf qn)
foldM checkField (Var qn' (Info t) loc) fields
where
findRootVar qs name =
(whenFound <$> lookupVar loc (QualName qs name)) `catchError` notFound qs name
whenFound (qn', t) = (qn', t, [])
notFound qs name err
| null qs = throwError err
| otherwise = do
(qn', t, fields) <-
findRootVar (init qs) (last qs)
`catchError` const (throwError err)
return (qn', t, fields ++ [name])
checkField e k = do
t <- expType e
let usage = mkUsage loc $ "projection of field " ++ quote (pretty k)
kt <- mustHaveField usage k t
return $ Project k e (Info kt) loc
checkExp (Negate arg loc) = do
arg' <- require "numeric negation" anyNumberType =<< checkExp arg
return $ Negate arg' loc
checkExp e@Apply {} = fst <$> checkApplyExp e
checkExp (LetPat pat e body _ loc) =
sequentially (checkExp e) $ \e' e_occs -> do
-- Not technically an ascription, but we want the pattern to have
-- exactly the type of 'e'.
t <- expType e'
case anyConsumption e_occs of
Just c ->
let msg = "type computed with consumption at " ++ locStr (location c)
in zeroOrderType (mkUsage loc "consumption in right-hand side of 'let'-binding") msg t
_ -> return ()
incLevel $
bindingPattern pat (Ascribed t) $ \pat' -> do
body' <- checkExp body
(body_t, retext) <-
unscopeType loc (patternMap pat') =<< expTypeFully body'
return $ LetPat pat' e' body' (Info body_t, Info retext) loc
checkExp (LetFun name (tparams, params, maybe_retdecl, NoInfo, e) body NoInfo loc) =
sequentially (checkBinding (name, maybe_retdecl, tparams, params, e, loc)) $
\(tparams', params', maybe_retdecl', rettype, _, e') closure -> do
closure' <- lexicalClosure params' closure
bindSpaced [(Term, name)] $ do
name' <- checkName Term name loc
let arrow (xp, xt) yt = Scalar $ Arrow () xp xt yt
ftype = foldr (arrow . patternParam) rettype params'
entry = BoundV Local tparams' $ ftype `setAliases` closure'
bindF scope =
scope
{ scopeVtable =
M.insert name' entry $ scopeVtable scope,
scopeNameMap =
M.insert (Term, name) (qualName name') $
scopeNameMap scope
}
body' <- localScope bindF $ checkExp body
-- We fake an ident here, but it's OK as it can't be a size
-- anyway.
let fake_ident = Ident name' (Info $ fromStruct ftype) mempty
(body_t, _) <-
unscopeType loc (M.singleton name' fake_ident)
=<< expTypeFully body'
return $
LetFun
name'
(tparams', params', maybe_retdecl', Info rettype, e')
body'
(Info body_t)
loc
checkExp (LetWith dest src idxes ve body NoInfo loc) =
sequentially (checkIdent src) $ \src' _ -> do
(t, _) <- newArrayType (srclocOf src) "src" $ length idxes
unify (mkUsage loc "type of target array") t $ toStruct $ unInfo $ identType src'
-- Need the fully normalised type here to get the proper aliasing information.
src_t <- normTypeFully $ unInfo $ identType src'
idxes' <- mapM checkDimIndex idxes
(elemt, _) <- sliceShape (Just (loc, Nonrigid)) idxes' =<< normTypeFully t
unless (unique src_t) $
typeError loc mempty $
"Source" <+> pquote (pprName (identName src))
<+> "has type"
<+> ppr src_t <> ", which is not unique."
vtable <- asks $ scopeVtable . termScope
forM_ (aliases src_t) $ \v ->
case aliasVar v `M.lookup` vtable of
Just (BoundV Local _ v_t)
| not $ unique v_t ->
typeError loc mempty $
"Source" <+> pquote (pprName (identName src))
<+> "aliases"
<+> pquote (pprName (aliasVar v)) <> ", which is not consumable."
_ -> return ()
sequentially (unifies "type of target array" (toStruct elemt) =<< checkExp ve) $ \ve' _ -> do
ve_t <- expTypeFully ve'
when (AliasBound (identName src') `S.member` aliases ve_t) $
badLetWithValue loc
bindingIdent dest (src_t `setAliases` S.empty) $ \dest' -> do
body' <- consuming src' $ checkExp body
(body_t, _) <-
unscopeType loc (M.singleton (identName dest') dest')
=<< expTypeFully body'
return $ LetWith dest' src' idxes' ve' body' (Info body_t) loc
checkExp (Update src idxes ve loc) = do
(t, _) <- newArrayType (srclocOf src) "src" $ length idxes
idxes' <- mapM checkDimIndex idxes
(elemt, _) <- sliceShape (Just (loc, Nonrigid)) idxes' =<< normTypeFully t
sequentially (checkExp ve >>= unifies "type of target array" elemt) $ \ve' _ ->
sequentially (checkExp src >>= unifies "type of target array" t) $ \src' _ -> do
src_t <- expTypeFully src'
unless (unique src_t) $
typeError loc mempty $
"Source" <+> pquote (ppr src)
<+> "has type"
<+> ppr src_t <> ", which is not unique."
let src_als = aliases src_t
ve_t <- expTypeFully ve'
unless (S.null $ src_als `S.intersection` aliases ve_t) $ badLetWithValue loc
consume loc src_als
return $ Update src' idxes' ve' loc
-- Record updates are a bit hacky, because we do not have row typing
-- (yet?). For now, we only permit record updates where we know the
-- full type up to the field we are updating.
checkExp (RecordUpdate src fields ve NoInfo loc) = do
src' <- checkExp src
ve' <- checkExp ve
a <- expTypeFully src'
let usage = mkUsage loc "record update"
r <- foldM (flip $ mustHaveField usage) a fields
ve_t <- expType ve'
let r' = anySizes $ toStruct r
ve_t' = anySizes $ toStruct ve_t
onFailure (CheckingRecordUpdate fields r' ve_t') $
unify usage r' ve_t'
maybe_a' <- onRecordField (const ve_t) fields <$> expTypeFully src'
case maybe_a' of
Just a' -> return $ RecordUpdate src' fields ve' (Info a') loc
Nothing ->
typeError loc mempty $
"Full type of"
</> indent 2 (ppr src)
</> textwrap " is not known at this point. Add a size annotation to the original record to disambiguate."
checkExp (Index e idxes _ loc) = do
(t, _) <- newArrayType loc "e" $ length idxes
e' <- unifies "being indexed at" t =<< checkExp e
idxes' <- mapM checkDimIndex idxes
-- XXX, the RigidSlice here will be overridden in sliceShape with a proper value.
(t', retext) <-
sliceShape (Just (loc, Rigid (RigidSlice Nothing ""))) idxes'
=<< expTypeFully e'
-- Remove aliases if the result is an overloaded type, because that
-- will certainly not be aliased.
t'' <- noAliasesIfOverloaded t'
return $ Index e' idxes' (Info t'', Info retext) loc
checkExp (Assert e1 e2 NoInfo loc) = do
e1' <- require "being asserted" [Bool] =<< checkExp e1
e2' <- checkExp e2
return $ Assert e1' e2' (Info (pretty e1)) loc
checkExp (Lambda params body rettype_te NoInfo loc) =
removeSeminullOccurences $
noUnique $
incLevel $
bindingParams [] params $ \_ params' -> do
rettype_checked <- traverse checkTypeExp rettype_te
let declared_rettype =
case rettype_checked of
Just (_, st, _) -> Just st
Nothing -> Nothing
(body', closure) <-
tapOccurences $ checkFunBody params' body declared_rettype loc
body_t <- expTypeFully body'
params'' <- mapM updateTypes params'
(rettype', rettype_st) <-
case rettype_checked of
Just (te, st, _) ->
return (Just te, st)
Nothing -> do
ret <-
inferReturnSizes params'' $
toStruct $
inferReturnUniqueness params'' body_t
return (Nothing, ret)
checkGlobalAliases params' body_t loc
verifyFunctionParams Nothing params'
closure' <- lexicalClosure params'' closure
return $ Lambda params'' body' rettype' (Info (closure', rettype_st)) loc
where
-- Inferring the sizes of the return type of a lambda is a lot
-- like let-generalisation. We wish to remove any rigid sizes
-- that were created when checking the body, except for those that
-- are visible in types that existed before we entered the body,
-- are parameters, or are used in parameters.
inferReturnSizes params' ret = do
cur_lvl <- curLevel
let named (Named x, _) = Just x
named (Unnamed, _) = Nothing
param_names = mapMaybe (named . patternParam) params'
pos_sizes =
typeDimNamesPos (foldFunType (map patternStructType params') ret)
hide k (lvl, _) =
lvl >= cur_lvl && k `notElem` param_names && k `S.notMember` pos_sizes
hidden_sizes <-
S.fromList . M.keys . M.filterWithKey hide <$> getConstraints
let onDim (NamedDim name)
| not (qualLeaf name `S.member` hidden_sizes) = NamedDim name
| otherwise = AnyDim
onDim d = d
return $ first onDim ret
checkExp (OpSection op _ loc) = do
(op', ftype) <- lookupVar loc op
return $ OpSection op' (Info ftype) loc
checkExp (OpSectionLeft op _ e _ _ loc) = do
(op', ftype) <- lookupVar loc op
e_arg <- checkArg e
(t1, rt, argext, retext) <- checkApply loc (Just op', 0) ftype e_arg
case rt of
Scalar (Arrow _ _ t2 rettype) ->
return $
OpSectionLeft
op'
(Info ftype)
(argExp e_arg)
(Info (toStruct t1, argext), Info $ toStruct t2)
(Info rettype, Info retext)
loc
_ ->
typeError loc mempty $
"Operator section with invalid operator of type" <+> ppr ftype
checkExp (OpSectionRight op _ e _ NoInfo loc) = do
(op', ftype) <- lookupVar loc op
e_arg <- checkArg e
case ftype of
Scalar (Arrow as1 m1 t1 (Scalar (Arrow as2 m2 t2 ret))) -> do
(t2', ret', argext, _) <-
checkApply
loc
(Just op', 1)
(Scalar $ Arrow as2 m2 t2 $ Scalar $ Arrow as1 m1 t1 ret)
e_arg
return $
OpSectionRight
op'
(Info ftype)
(argExp e_arg)
(Info $ toStruct t1, Info (toStruct t2', argext))
(Info $ addAliases ret (<> aliases ret'))
loc
_ ->
typeError loc mempty $
"Operator section with invalid operator of type" <+> ppr ftype
checkExp (ProjectSection fields NoInfo loc) = do
a <- newTypeVar loc "a"
let usage = mkUsage loc "projection at"
b <- foldM (flip $ mustHaveField usage) a fields
return $ ProjectSection fields (Info $ Scalar $ Arrow mempty Unnamed a b) loc
checkExp (IndexSection idxes NoInfo loc) = do
(t, _) <- newArrayType loc "e" $ length idxes
idxes' <- mapM checkDimIndex idxes
(t', _) <- sliceShape Nothing idxes' t
return $ IndexSection idxes' (Info $ fromStruct $ Scalar $ Arrow mempty Unnamed t t') loc
checkExp (DoLoop _ mergepat mergeexp form loopbody NoInfo loc) =
sequentially (checkExp mergeexp) $ \mergeexp' _ -> do
zeroOrderType
(mkUsage (srclocOf mergeexp) "use as loop variable")
"type used as loop variable"
=<< expTypeFully mergeexp'
-- The handling of dimension sizes is a bit intricate, but very
-- similar to checking a function, followed by checking a call to
-- it. The overall procedure is as follows:
--
-- (1) All empty dimensions in the merge pattern are instantiated
-- with nonrigid size variables. All explicitly specified
-- dimensions are preserved.
--
-- (2) The body of the loop is type-checked. The result type is
-- combined with the merge pattern type to determine which sizes are
-- variant, and these are turned into size parameters for the merge
-- pattern.
--
-- (3) We now conceptually have a function parameter type and return
-- type. We check that it can be called with the initial merge
-- values as argument. The result of this is the type of the loop
-- as a whole.
--
-- (There is also a convergence loop for inferring uniqueness, but
-- that's orthogonal to the size handling.)
(merge_t, new_dims) <-
instantiateEmptyArrayDims loc "loop" Nonrigid
. anySizes -- dim handling (1)
=<< expTypeFully mergeexp'
-- dim handling (2)
let checkLoopReturnSize mergepat' loopbody' = do
loopbody_t <- expTypeFully loopbody'
pat_t <- normTypeFully $ patternType mergepat'
-- We are ignoring the dimensions here, because any mismatches
-- should be turned into fresh size variables.
onFailure (CheckingLoopBody (toStruct (anySizes pat_t)) (toStruct loopbody_t)) $
expect
(mkUsage (srclocOf loopbody) "matching loop body to loop pattern")
(toStruct (anySizes pat_t))
(toStruct loopbody_t)
pat_t' <- normTypeFully pat_t
loopbody_t' <- normTypeFully loopbody_t
-- For each new_dims, figure out what they are instantiated
-- with in the initial value. This is used to determine
-- whether a size is invariant because it always matches the
-- initial instantiation of that size.
let initSubst (NamedDim v, d) = Just (v, d)
initSubst _ = Nothing
init_substs <-
M.fromList . mapMaybe initSubst . snd
. anyDimOnMismatch pat_t'
<$> expTypeFully mergeexp'
-- Figure out which of the 'new_dims' dimensions are variant.
-- This works because we know that each dimension from
-- new_dims in the pattern is unique and distinct.
--
-- Our logic here is a bit reversed: the *mismatches* (from
-- new_dims) are what we want to extract and turn into size
-- parameters.
let mismatchSubst (NamedDim v, d)
| qualLeaf v `elem` new_dims =
case M.lookup v init_substs of
Just d'
| d' == d ->
return $ Just (qualLeaf v, SizeSubst d)
_ -> do
tell [qualLeaf v]
return Nothing
mismatchSubst _ = return Nothing
(init_substs', sparams) =
runWriter $
M.fromList . catMaybes
<$> mapM
mismatchSubst
(snd $ anyDimOnMismatch pat_t' loopbody_t')
-- Make sure that any of new_dims that are invariant will be
-- replaced with the invariant size in the loop body. Failure
-- to do this can cause type annotations to still refer to
-- new_dims.
let dimToInit (v, SizeSubst d) =
constrain v $ Size (Just d) (mkUsage loc "size of loop parameter")
dimToInit _ =
return ()
mapM_ dimToInit $ M.toList init_substs'
mergepat'' <- applySubst (`M.lookup` init_substs') <$> updateTypes mergepat'
return (nub sparams, mergepat'')
-- First we do a basic check of the loop body to figure out which of
-- the merge parameters are being consumed. For this, we first need
-- to check the merge pattern, which requires the (initial) merge
-- expression.
--
-- Play a little with occurences to ensure it does not look like
-- none of the merge variables are being used.
((sparams, mergepat', form', loopbody'), bodyflow) <-
case form of
For i uboundexp -> do
uboundexp' <- require "being the bound in a 'for' loop" anySignedType =<< checkExp uboundexp
bound_t <- expTypeFully uboundexp'
bindingIdent i bound_t $ \i' ->
noUnique $
bindingPattern mergepat (Ascribed merge_t) $
\mergepat' -> onlySelfAliasing $
tapOccurences $ do
loopbody' <- noSizeEscape $ checkExp loopbody
(sparams, mergepat'') <- checkLoopReturnSize mergepat' loopbody'
return
( sparams,
mergepat'',
For i' uboundexp',
loopbody'
)
ForIn xpat e -> do
(arr_t, _) <- newArrayType (srclocOf e) "e" 1
e' <- unifies "being iterated in a 'for-in' loop" arr_t =<< checkExp e
t <- expTypeFully e'
case t of
_
| Just t' <- peelArray 1 t ->
bindingPattern xpat (Ascribed t') $ \xpat' ->
noUnique $
bindingPattern mergepat (Ascribed merge_t) $
\mergepat' -> onlySelfAliasing $
tapOccurences $ do
loopbody' <- noSizeEscape $ checkExp loopbody
(sparams, mergepat'') <- checkLoopReturnSize mergepat' loopbody'
return
( sparams,
mergepat'',
ForIn xpat' e',
loopbody'
)
| otherwise ->
typeError (srclocOf e) mempty $
"Iteratee of a for-in loop must be an array, but expression has type"
<+> ppr t
While cond ->
noUnique $
bindingPattern mergepat (Ascribed merge_t) $ \mergepat' ->
onlySelfAliasing $
tapOccurences $
sequentially
( checkExp cond
>>= unifies "being the condition of a 'while' loop" (Scalar $ Prim Bool)
)
$ \cond' _ -> do
loopbody' <- noSizeEscape $ checkExp loopbody
(sparams, mergepat'') <- checkLoopReturnSize mergepat' loopbody'
return
( sparams,
mergepat'',
While cond',
loopbody'
)
mergepat'' <- do
loopbody_t <- expTypeFully loopbody'
convergePattern mergepat' (allConsumed bodyflow) loopbody_t $
mkUsage (srclocOf loopbody') "being (part of) the result of the loop body"
let consumeMerge (Id _ (Info pt) ploc) mt
| unique pt = consume ploc $ aliases mt
consumeMerge (TuplePattern pats _) t
| Just ts <- isTupleRecord t =
zipWithM_ consumeMerge pats ts
consumeMerge (PatternParens pat _) t =
consumeMerge pat t
consumeMerge (PatternAscription pat _ _) t =
consumeMerge pat t
consumeMerge _ _ =
return ()
consumeMerge mergepat'' =<< expTypeFully mergeexp'
-- dim handling (3)
let sparams_anydim = M.fromList $ zip sparams $ repeat $ SizeSubst AnyDim
loopt_anydims =
applySubst (`M.lookup` sparams_anydim) $
patternType mergepat''
(merge_t', _) <-
instantiateEmptyArrayDims loc "loopres" Nonrigid $ toStruct loopt_anydims
mergeexp_t <- toStruct <$> expTypeFully mergeexp'
onFailure (CheckingLoopInitial (toStruct loopt_anydims) mergeexp_t) $
unify
(mkUsage (srclocOf mergeexp') "matching initial loop values to pattern")
merge_t'
mergeexp_t
(loopt, retext) <- instantiateDimsInType loc RigidLoop loopt_anydims
-- We set all of the uniqueness to be unique. This is intentional,
-- and matches what happens for function calls. Those arrays that
-- really *cannot* be consumed will alias something unconsumable,
-- and will be caught that way.
let bound_here = patternNames mergepat'' <> S.fromList sparams <> form_bound
form_bound =
case form' of
For v _ -> S.singleton $ identName v
ForIn forpat _ -> patternNames forpat
While {} -> mempty
loopt' =
second (`S.difference` S.map AliasBound bound_here) $
loopt `setUniqueness` Unique
-- Eliminate those new_dims that turned into sparams so it won't
-- look like we have ambiguous sizes lying around.
modifyConstraints $ M.filterWithKey $ \k _ -> k `notElem` sparams
return $ DoLoop sparams mergepat'' mergeexp' form' loopbody' (Info (loopt', retext)) loc
where
convergePattern pat body_cons body_t body_loc = do
let consumed_merge = patternNames pat `S.intersection` body_cons
uniquePat (Wildcard (Info t) wloc) =
Wildcard (Info $ t `setUniqueness` Nonunique) wloc
uniquePat (PatternParens p ploc) =
PatternParens (uniquePat p) ploc
uniquePat (Id name (Info t) iloc)
| name `S.member` consumed_merge =
let t' = t `setUniqueness` Unique `setAliases` mempty
in Id name (Info t') iloc
| otherwise =
let t' = t `setUniqueness` Nonunique
in Id name (Info t') iloc
uniquePat (TuplePattern pats ploc) =
TuplePattern (map uniquePat pats) ploc
uniquePat (RecordPattern fs ploc) =
RecordPattern (map (fmap uniquePat) fs) ploc
uniquePat (PatternAscription p t ploc) =
PatternAscription p t ploc
uniquePat p@PatternLit {} = p
uniquePat (PatternConstr n t ps ploc) =
PatternConstr n t (map uniquePat ps) ploc
-- Make the pattern unique where needed.
pat' = uniquePat pat
pat_t <- normTypeFully $ patternType pat'
unless (toStructural body_t `subtypeOf` toStructural pat_t) $
unexpectedType (srclocOf body_loc) (toStruct body_t) [toStruct pat_t]
-- Check that the new values of consumed merge parameters do not
-- alias something bound outside the loop, AND that anything
-- returned for a unique merge parameter does not alias anything
-- else returned. We also update the aliases for the pattern.
bound_outside <- asks $ S.fromList . M.keys . scopeVtable . termScope
let combAliases t1 t2 =
case t1 of
Scalar Record {} -> t1
_ -> t1 `addAliases` (<> aliases t2)
checkMergeReturn (Id pat_v (Info pat_v_t) patloc) t
| unique pat_v_t,
v : _ <-
S.toList $
S.map aliasVar (aliases t) `S.intersection` bound_outside =
lift $
typeError loc mempty $
"Return value for loop parameter"
<+> pquote (pprName pat_v)
<+> "aliases"
<+> pprName v <> "."
| otherwise = do
(cons, obs) <- get
unless (S.null $ aliases t `S.intersection` cons) $
lift $
typeError loc mempty $
"Return value for loop parameter"
<+> pquote (pprName pat_v)
<+> "aliases other consumed loop parameter."
when
( unique pat_v_t
&& not (S.null (aliases t `S.intersection` (cons <> obs)))
)
$ lift $
typeError loc mempty $
"Return value for consuming loop parameter"
<+> pquote (pprName pat_v)
<+> "aliases previously returned value."
if unique pat_v_t
then put (cons <> aliases t, obs)
else put (cons, obs <> aliases t)
return $ Id pat_v (Info (combAliases pat_v_t t)) patloc
checkMergeReturn (Wildcard (Info pat_v_t) patloc) t =
return $ Wildcard (Info (combAliases pat_v_t t)) patloc
checkMergeReturn (PatternParens p _) t =
checkMergeReturn p t
checkMergeReturn (PatternAscription p _ _) t =
checkMergeReturn p t
checkMergeReturn (RecordPattern pfs patloc) (Scalar (Record tfs)) =
RecordPattern . M.toList <$> sequence pfs' <*> pure patloc
where
pfs' =
M.intersectionWith
checkMergeReturn
(M.fromList pfs)
tfs
checkMergeReturn (TuplePattern pats patloc) t
| Just ts <- isTupleRecord t =
TuplePattern
<$> zipWithM checkMergeReturn pats ts
<*> pure patloc
checkMergeReturn p _ =
return p
(pat'', (pat_cons, _)) <-
runStateT (checkMergeReturn pat' body_t) (mempty, mempty)
let body_cons' = body_cons <> S.map aliasVar pat_cons
if body_cons' == body_cons && patternType pat'' == patternType pat
then return pat'
else convergePattern pat'' body_cons' body_t body_loc
checkExp (Constr name es NoInfo loc) = do
t <- newTypeVar loc "t"
es' <- mapM checkExp es
ets <- mapM expTypeFully es'
mustHaveConstr (mkUsage loc "use of constructor") name t (toStruct <$> ets)
-- A sum value aliases *anything* that went into its construction.
let als = foldMap aliases ets
return $ Constr name es' (Info $ fromStruct t `addAliases` (<> als)) loc
checkExp (Match e cs _ loc) =
sequentially (checkExp e) $ \e' _ -> do
mt <- expTypeFully e'
(cs', t, retext) <- checkCases mt cs
zeroOrderType
(mkUsage loc "being returned 'match'")
"type returned from pattern match"
t
return $ Match e' cs' (Info t, Info retext) loc
checkExp (Attr info e loc) =
Attr info <$> checkExp e <*> pure loc
checkCases ::
PatternType ->
NE.NonEmpty (CaseBase NoInfo Name) ->
TermTypeM (NE.NonEmpty (CaseBase Info VName), PatternType, [VName])
checkCases mt rest_cs =
case NE.uncons rest_cs of
(c, Nothing) -> do
(c', t, retext) <- checkCase mt c
return (c' NE.:| [], t, retext)
(c, Just cs) -> do
(((c', c_t, _), (cs', cs_t, _)), dflow) <-
tapOccurences $ checkCase mt c `alternative` checkCases mt cs
(brancht, retext) <- unifyBranchTypes (srclocOf c) c_t cs_t
let t =
addAliases
brancht
(`S.difference` S.map AliasBound (allConsumed dflow))
return (NE.cons c' cs', t, retext)
checkCase ::
PatternType ->
CaseBase NoInfo Name ->
TermTypeM (CaseBase Info VName, PatternType, [VName])
checkCase mt (CasePat p e loc) =
bindingPattern p (Ascribed mt) $ \p' -> do
e' <- checkExp e
(t, retext) <- unscopeType loc (patternMap p') =<< expTypeFully e'
return (CasePat p' e' loc, t, retext)
-- | An unmatched pattern. Used in in the generation of
-- unmatched pattern warnings by the type checker.
data Unmatched p
= UnmatchedNum p [ExpBase Info VName]
| UnmatchedBool p
| UnmatchedConstr p
| Unmatched p
deriving (Functor, Show)
instance Pretty (Unmatched (PatternBase Info VName)) where
ppr um = case um of
(UnmatchedNum p nums) -> ppr' p <+> "where p is not one of" <+> ppr nums
(UnmatchedBool p) -> ppr' p
(UnmatchedConstr p) -> ppr' p
(Unmatched p) -> ppr' p
where
ppr' (PatternAscription p t _) = ppr p <> ":" <+> ppr t
ppr' (PatternParens p _) = parens $ ppr' p
ppr' (Id v _ _) = pprName v
ppr' (TuplePattern pats _) = parens $ commasep $ map ppr' pats
ppr' (RecordPattern fs _) = braces $ commasep $ map ppField fs
where
ppField (name, t) = text (nameToString name) <> equals <> ppr' t
ppr' Wildcard {} = "_"
ppr' (PatternLit e _ _) = ppr e
ppr' (PatternConstr n _ ps _) = "#" <> ppr n <+> sep (map ppr' ps)
unpackPat :: Pattern -> [Maybe Pattern]
unpackPat Wildcard {} = [Nothing]
unpackPat (PatternParens p _) = unpackPat p
unpackPat Id {} = [Nothing]
unpackPat (TuplePattern ps _) = Just <$> ps
unpackPat (RecordPattern fs _) = Just . snd <$> sortFields (M.fromList fs)
unpackPat (PatternAscription p _ _) = unpackPat p
unpackPat p@PatternLit {} = [Just p]
unpackPat p@PatternConstr {} = [Just p]
wildPattern :: Pattern -> Int -> Unmatched Pattern -> Unmatched Pattern
wildPattern (TuplePattern ps loc) pos um = wildTuple <$> um
where
wildTuple p = TuplePattern (take (pos - 1) ps' ++ [p] ++ drop pos ps') loc
ps' = map wildOut ps
wildOut p = Wildcard (Info (patternType p)) (srclocOf p)
wildPattern (RecordPattern fs loc) pos um = wildRecord <$> um
where
wildRecord p =
RecordPattern (take (pos - 1) fs' ++ [(fst (fs !! (pos - 1)), p)] ++ drop pos fs') loc
fs' = map wildOut fs
wildOut (f, p) = (f, Wildcard (Info (patternType p)) (srclocOf p))
wildPattern (PatternAscription p _ _) pos um = wildPattern p pos um
wildPattern (PatternParens p _) pos um = wildPattern p pos um
wildPattern (PatternConstr n t ps loc) pos um = wildConstr <$> um
where
wildConstr p = PatternConstr n t (take (pos - 1) ps' ++ [p] ++ drop pos ps') loc
ps' = map wildOut ps
wildOut p = Wildcard (Info (patternType p)) (srclocOf p)
wildPattern _ _ um = um
checkUnmatched :: Exp -> TermTypeM ()
checkUnmatched e = void $ checkUnmatched' e >> astMap tv e
where
checkUnmatched' (Match _ cs _ loc) =
let ps = fmap (\(CasePat p _ _) -> p) cs
in case unmatched id $ NE.toList ps of
[] -> return ()
ps' ->
typeError loc mempty $
"Unmatched cases in match expression:"
</> indent 2 (stack (map ppr ps'))
checkUnmatched' _ = return ()
tv =
ASTMapper
{ mapOnExp =
\e' -> checkUnmatched' e' >> return e',
mapOnName = pure,
mapOnQualName = pure,
mapOnStructType = pure,
mapOnPatternType = pure
}
-- | A data type for constructor patterns. This is used to make the
-- code for detecting unmatched constructors cleaner, by separating
-- the constructor-pattern cases from other cases.
data ConstrPat = ConstrPat
{ constrName :: Name,
constrType :: PatternType,
constrPayload :: [Pattern],
constrSrcLoc :: SrcLoc
}
-- Be aware of these fishy equality instances!
instance Eq ConstrPat where
ConstrPat c1 _ _ _ == ConstrPat c2 _ _ _ = c1 == c2
instance Ord ConstrPat where
ConstrPat c1 _ _ _ `compare` ConstrPat c2 _ _ _ = c1 `compare` c2
unmatched :: (Unmatched Pattern -> Unmatched Pattern) -> [Pattern] -> [Unmatched Pattern]
unmatched hole orig_ps
| p : _ <- orig_ps,
sameStructure labeledCols = do
(i, cols) <- labeledCols
let hole' = if isConstr p then hole else hole . wildPattern p i
case sequence cols of
Nothing -> []
Just cs
| all isPatternLit cs -> map hole' $ localUnmatched cs
| otherwise -> unmatched hole' cs
| otherwise = []
where
labeledCols = zip [1 ..] $ transpose $ map unpackPat orig_ps
localUnmatched :: [Pattern] -> [Unmatched Pattern]
localUnmatched [] = []
localUnmatched ps'@(p' : _) =
case patternType p' of
Scalar (Sum cs'') ->
-- We now know that we are matching a sum type, and thus
-- that all patterns ps' are constructors (checked by
-- 'all isPatternLit' before this function is called).
let constrs = M.keys cs''
matched = mapMaybe constr ps'
unmatched' =
map (UnmatchedConstr . buildConstr cs'') $
constrs \\ map constrName matched
in case unmatched' of
[] ->
let constrGroups = group (sort matched)
removedConstrs = mapMaybe stripConstrs constrGroups
transposed = (fmap . fmap) transpose removedConstrs
findUnmatched (pc, trans) = do
col <- trans
case col of
[] -> []
((i, _) : _) -> unmatched (wilder i pc) (map snd col)
wilder i pc s = (`PatternParens` mempty) <$> wildPattern pc i s
in concatMap findUnmatched transposed
_ -> unmatched'
Scalar (Prim t) | not (any idOrWild ps') ->
-- We now know that we are matching a sum type, and thus
-- that all patterns ps' are literals (checked by 'all
-- isPatternLit' before this function is called).
case t of
Bool ->
let matched = nub $ mapMaybe (pExp >=> bool) $ filter isPatternLit ps'
in map (UnmatchedBool . buildBool (Scalar (Prim t))) $ [True, False] \\ matched
_ ->
let matched = mapMaybe pExp $ filter isPatternLit ps'
in [UnmatchedNum (buildId (Info $ Scalar $ Prim t) "p") matched]
_ -> []
isConstr PatternConstr {} = True
isConstr (PatternParens p _) = isConstr p
isConstr _ = False
stripConstrs :: [ConstrPat] -> Maybe (Pattern, [[(Int, Pattern)]])
stripConstrs (pc@ConstrPat {} : cs') = Just (unConstr pc, stripConstr pc : map stripConstr cs')
stripConstrs [] = Nothing
stripConstr :: ConstrPat -> [(Int, Pattern)]
stripConstr (ConstrPat _ _ ps' _) = zip [1 ..] ps'
sameStructure [] = True
sameStructure (x : xs) = all (\y -> length y == length x') xs'
where
(x' : xs') = map snd (x : xs)
pExp (PatternLit e' _ _) = Just e'
pExp _ = Nothing
constr (PatternConstr c (Info t) ps loc) = Just $ ConstrPat c t ps loc
constr (PatternParens p _) = constr p
constr (PatternAscription p' _ _) = constr p'
constr _ = Nothing
unConstr p =
PatternConstr (constrName p) (Info $ constrType p) (constrPayload p) (constrSrcLoc p)
isPatternLit PatternLit {} = True
isPatternLit (PatternAscription p' _ _) = isPatternLit p'
isPatternLit (PatternParens p' _) = isPatternLit p'
isPatternLit PatternConstr {} = True
isPatternLit _ = False
idOrWild Id {} = True
idOrWild Wildcard {} = True
idOrWild (PatternAscription p' _ _) = idOrWild p'
idOrWild (PatternParens p' _) = idOrWild p'
idOrWild _ = False
bool (Literal (BoolValue b) _) = Just b
bool _ = Nothing
buildConstr m c =
let t = Scalar $ Sum m
cs = m M.! c
wildCS = map (\ct -> Wildcard (Info ct) mempty) cs
in if null wildCS
then PatternConstr c (Info t) [] mempty
else PatternParens (PatternConstr c (Info t) wildCS mempty) mempty
buildBool t b =
PatternLit (Literal (BoolValue b) mempty) (Info (addSizes t)) mempty
buildId t n =
-- The VName tag here will never be used since the value
-- exists exclusively for printing warnings.
Id (VName (nameFromString n) (-1)) t mempty
checkIdent :: IdentBase NoInfo Name -> TermTypeM Ident
checkIdent (Ident name _ loc) = do
(QualName _ name', vt) <- lookupVar loc (qualName name)
return $ Ident name' (Info vt) loc
checkDimIndex :: DimIndexBase NoInfo Name -> TermTypeM DimIndex
checkDimIndex (DimFix i) =
DimFix <$> (require "use as index" anySignedType =<< checkExp i)
checkDimIndex (DimSlice i j s) =
DimSlice <$> check i <*> check j <*> check s
where
check =
maybe (return Nothing) $
fmap Just . unifies "use as index" (Scalar $ Prim $ Signed Int32) <=< checkExp
sequentially :: TermTypeM a -> (a -> Occurences -> TermTypeM b) -> TermTypeM b
sequentially m1 m2 = do
(a, m1flow) <- collectOccurences m1
(b, m2flow) <- collectOccurences $ m2 a m1flow
occur $ m1flow `seqOccurences` m2flow
return b
type Arg = (Exp, PatternType, Occurences, SrcLoc)
argExp :: Arg -> Exp
argExp (e, _, _, _) = e
argType :: Arg -> PatternType
argType (_, t, _, _) = t
checkArg :: UncheckedExp -> TermTypeM Arg
checkArg arg = do
(arg', dflow) <- collectOccurences $ checkExp arg
arg_t <- expType arg'
return (arg', arg_t, dflow, srclocOf arg')
instantiateDimsInType ::
SrcLoc ->
RigidSource ->
TypeBase (DimDecl VName) als ->
TermTypeM (TypeBase (DimDecl VName) als, [VName])
instantiateDimsInType tloc rsrc =
instantiateEmptyArrayDims tloc "d" $ Rigid rsrc
instantiateDimsInReturnType ::
SrcLoc ->
Maybe (QualName VName) ->
TypeBase (DimDecl VName) als ->
TermTypeM (TypeBase (DimDecl VName) als, [VName])
instantiateDimsInReturnType tloc fname =
instantiateEmptyArrayDims tloc "ret" $ Rigid $ RigidRet fname
-- Some information about the function/operator we are trying to
-- apply, and how many arguments it has previously accepted. Used for
-- generating nicer type errors.
type ApplyOp = (Maybe (QualName VName), Int)
checkApply ::
SrcLoc ->
ApplyOp ->
PatternType ->
Arg ->
TermTypeM (PatternType, PatternType, Maybe VName, [VName])
checkApply
loc
(fname, _)
(Scalar (Arrow as pname tp1 tp2))
(argexp, argtype, dflow, argloc) =
onFailure (CheckingApply fname argexp (toStruct tp1) (toStruct argtype)) $ do
expect (mkUsage argloc "use as function argument") (toStruct tp1) (toStruct argtype)
-- Perform substitutions of instantiated variables in the types.
tp1' <- normTypeFully tp1
(tp2', ext) <- instantiateDimsInReturnType loc fname =<< normTypeFully tp2
argtype' <- normTypeFully argtype
-- Check whether this would produce an impossible return type.
let (_, tp2_paramdims, _) = dimUses $ toStruct tp2'
case filter (`S.member` tp2_paramdims) ext of
[] -> return ()
ext_paramdims -> do
let onDim (NamedDim qn)
| qualLeaf qn `elem` ext_paramdims = AnyDim
onDim d = d
typeError loc mempty $
"Anonymous size would appear in function parameter of return type:"
</> indent 2 (ppr (first onDim tp2'))
</> textwrap "This is usually because a higher-order function is used with functional arguments that return anonymous sizes, which are then used as parameters of other function arguments."
occur [observation as loc]
checkOccurences dflow
case anyConsumption dflow of
Just c ->
let msg = "type of expression with consumption at " ++ locStr (location c)
in zeroOrderType (mkUsage argloc "potential consumption in expression") msg tp1
_ -> return ()
occurs <- (dflow `seqOccurences`) <$> consumeArg argloc argtype' (diet tp1')
checkIfConsumable loc $ S.map AliasBound $ allConsumed occurs
occur occurs
(argext, parsubst) <-
case pname of
Named pname' -> do
(d, argext) <- sizeSubst tp1' argexp
return
( argext,
(`M.lookup` M.singleton pname' (SizeSubst d))
)
_ -> return (Nothing, const Nothing)
let tp2'' = applySubst parsubst $ returnType tp2' (diet tp1') argtype'
return (tp1', tp2'', argext, ext)
where
sizeSubst (Scalar (Prim (Signed Int32))) e = dimFromArg fname e
sizeSubst _ _ = return (AnyDim, Nothing)
checkApply loc fname tfun@(Scalar TypeVar {}) arg = do
tv <- newTypeVar loc "b"
unify (mkUsage loc "use as function") (toStruct tfun) $
Scalar $ Arrow mempty Unnamed (toStruct (argType arg)) tv
tfun' <- normPatternType tfun
checkApply loc fname tfun' arg
checkApply loc (fname, prev_applied) ftype (argexp, _, _, _) = do
let fname' = maybe "expression" (pquote . ppr) fname
typeError loc mempty $
if prev_applied == 0
then
"Cannot apply" <+> fname' <+> "as function, as it has type:"
</> indent 2 (ppr ftype)
else
"Cannot apply" <+> fname' <+> "to argument #" <> ppr (prev_applied + 1)
<+> pquote (shorten $ pretty $ flatten $ ppr argexp) <> ","
<+/> "as"
<+> fname'
<+> "only takes"
<+> ppr prev_applied
<+> arguments <> "."
where
arguments
| prev_applied == 1 = "argument"
| otherwise = "arguments"
isInt32 :: Exp -> Maybe Int32
isInt32 (Literal (SignedValue (Int32Value k')) _) = Just $ fromIntegral k'
isInt32 (IntLit k' _ _) = Just $ fromInteger k'
isInt32 (Negate x _) = negate <$> isInt32 x
isInt32 _ = Nothing
maybeDimFromExp :: Exp -> Maybe (DimDecl VName)
maybeDimFromExp (Var v _ _) = Just $ NamedDim v
maybeDimFromExp (Parens e _) = maybeDimFromExp e
maybeDimFromExp (QualParens _ e _) = maybeDimFromExp e
maybeDimFromExp e = ConstDim . fromIntegral <$> isInt32 e
dimFromExp :: (Exp -> SizeSource) -> Exp -> TermTypeM (DimDecl VName, Maybe VName)
dimFromExp rf (Parens e _) = dimFromExp rf e
dimFromExp rf (QualParens _ e _) = dimFromExp rf e
dimFromExp rf e
| Just d <- maybeDimFromExp e =
return (d, Nothing)
| otherwise =
extSize (srclocOf e) $ rf e
dimFromArg :: Maybe (QualName VName) -> Exp -> TermTypeM (DimDecl VName, Maybe VName)
dimFromArg fname = dimFromExp $ SourceArg (FName fname) . bareExp
-- | @returnType ret_type arg_diet arg_type@ gives result of applying
-- an argument the given types to a function with the given return
-- type, consuming the argument with the given diet.
returnType ::
PatternType ->
Diet ->
PatternType ->
PatternType
returnType (Array _ Unique et shape) _ _ =
Array mempty Unique et shape
returnType (Array als Nonunique et shape) d arg =
Array (als <> arg_als) Unique et shape -- Intentional!
where
arg_als = aliases $ maskAliases arg d
returnType (Scalar (Record fs)) d arg =
Scalar $ Record $ fmap (\et -> returnType et d arg) fs
returnType (Scalar (Prim t)) _ _ =
Scalar $ Prim t
returnType (Scalar (TypeVar _ Unique t targs)) _ _ =
Scalar $ TypeVar mempty Unique t targs
returnType (Scalar (TypeVar als Nonunique t targs)) d arg =
Scalar $ TypeVar (als <> arg_als) Unique t targs -- Intentional!
where
arg_als = aliases $ maskAliases arg d
returnType (Scalar (Arrow old_als v t1 t2)) d arg =
Scalar $ Arrow als v (t1 `setAliases` mempty) (t2 `setAliases` als)
where
-- Make sure to propagate the aliases of an existing closure.
als = old_als <> aliases (maskAliases arg d)
returnType (Scalar (Sum cs)) d arg =
Scalar $ Sum $ (fmap . fmap) (\et -> returnType et d arg) cs
-- | @t `maskAliases` d@ removes aliases (sets them to 'mempty') from
-- the parts of @t@ that are denoted as consumed by the 'Diet' @d@.
maskAliases ::
Monoid as =>
TypeBase shape as ->
Diet ->
TypeBase shape as
maskAliases t Consume = t `setAliases` mempty
maskAliases t Observe = t
maskAliases (Scalar (Record ets)) (RecordDiet ds) =
Scalar $ Record $ M.intersectionWith maskAliases ets ds
maskAliases t FuncDiet {} = t
maskAliases _ _ = error "Invalid arguments passed to maskAliases."
consumeArg :: SrcLoc -> PatternType -> Diet -> TermTypeM [Occurence]
consumeArg loc (Scalar (Record ets)) (RecordDiet ds) =
concat . M.elems <$> traverse (uncurry $ consumeArg loc) (M.intersectionWith (,) ets ds)
consumeArg loc (Array _ Nonunique _ _) Consume =
typeError loc mempty "Consuming parameter passed non-unique argument."
consumeArg loc (Scalar (TypeVar _ Nonunique _ _)) Consume =
typeError loc mempty "Consuming parameter passed non-unique argument."
consumeArg loc (Scalar (Arrow _ _ t1 _)) (FuncDiet d _)
| not $ contravariantArg t1 d =
typeError loc mempty "Non-consuming higher-order parameter passed consuming argument."
where
contravariantArg (Array _ Unique _ _) Observe =
False
contravariantArg (Scalar (TypeVar _ Unique _ _)) Observe =
False
contravariantArg (Scalar (Record ets)) (RecordDiet ds) =
and (M.intersectionWith contravariantArg ets ds)
contravariantArg (Scalar (Arrow _ _ tp tr)) (FuncDiet dp dr) =
contravariantArg tp dp && contravariantArg tr dr
contravariantArg _ _ =
True
consumeArg loc (Scalar (Arrow _ _ _ t2)) (FuncDiet _ pd) =
consumeArg loc t2 pd
consumeArg loc at Consume = return [consumption (aliases at) loc]
consumeArg loc at _ = return [observation (aliases at) loc]
-- | Type-check a single expression in isolation. This expression may
-- turn out to be polymorphic, in which case the list of type
-- parameters will be non-empty.
checkOneExp :: UncheckedExp -> TypeM ([TypeParam], Exp)
checkOneExp e = fmap fst . runTermTypeM $ do
e' <- checkExp e
let t = toStruct $ typeOf e'
(tparams, _, _, _) <-
letGeneralise (nameFromString "<exp>") (srclocOf e) [] [] t
fixOverloadedTypes $ typeVars t
e'' <- updateTypes e'
checkUnmatched e''
causalityCheck e''
literalOverflowCheck e''
return (tparams, e'')
-- Verify that all sum type constructors and empty array literals have
-- a size that is known (rigid or a type parameter). This is to
-- ensure that we can actually determine their shape at run-time.
causalityCheck :: Exp -> TermTypeM ()
causalityCheck binding_body = do
constraints <- getConstraints
let checkCausality what known t loc
| (d, dloc) : _ <-
mapMaybe (unknown constraints known) $
S.toList $ typeDimNames $ toStruct t =
Just $ lift $ causality what loc d dloc t
| otherwise = Nothing
checkParamCausality known p =
checkCausality (ppr p) known (patternType p) (srclocOf p)
onExp ::
S.Set VName ->
Exp ->
StateT (S.Set VName) (Either TypeError) Exp
onExp known (Var v (Info t) loc)
| Just bad <- checkCausality (pquote (ppr v)) known t loc =
bad
onExp known (ArrayLit [] (Info t) loc)
| Just bad <- checkCausality "empty array" known t loc =
bad
onExp known (Lambda params _ _ _ _)
| bad : _ <- mapMaybe (checkParamCausality known) params =
bad
onExp known e@(Coerce what _ (_, Info ext) _) = do
modify (S.fromList ext <>)
void $ onExp known what
return e
onExp known e@(LetPat _ bindee_e body_e (_, Info ext) _) = do
sequencePoint known bindee_e body_e ext
return e
onExp known e@(Apply f arg (Info (_, p)) (_, Info ext) _) = do
sequencePoint known arg f $ maybeToList p ++ ext
return e
onExp
known
e@( BinOp
(f, floc)
ft
(x, Info (_, xp))
(y, Info (_, yp))
_
(Info ext)
_
) = do
args_known <-
lift $
execStateT (sequencePoint known x y $ catMaybes [xp, yp]) mempty
void $ onExp (args_known <> known) (Var f ft floc)
modify ((args_known <> S.fromList ext) <>)
return e
onExp known e = do
recurse known e
case e of
DoLoop _ _ _ _ _ (Info (_, ext)) _ ->
modify (<> S.fromList ext)
If _ _ _ (_, Info ext) _ ->
modify (<> S.fromList ext)
Index _ _ (_, Info ext) _ ->
modify (<> S.fromList ext)
Match _ _ (_, Info ext) _ ->
modify (<> S.fromList ext)
Range _ _ _ (_, Info ext) _ ->
modify (<> S.fromList ext)
_ ->
return ()
return e
recurse known = void . astMap mapper
where
mapper = identityMapper {mapOnExp = onExp known}
sequencePoint known x y ext = do
new_known <- lift $ execStateT (onExp known x) mempty
void $ onExp (new_known <> known) y
modify ((new_known <> S.fromList ext) <>)
either throwError (const $ return ()) $
evalStateT (onExp mempty binding_body) mempty
where
unknown constraints known v = do
guard $ v `S.notMember` known
loc <- unknowable constraints v
return (v, loc)
unknowable constraints v =
case snd <$> M.lookup v constraints of
Just (UnknowableSize loc _) -> Just loc
_ -> Nothing
causality what loc d dloc t =
Left $
TypeError loc mempty $
"Causality check: size" <+/> pquote (pprName d)
<+/> "needed for type of"
<+> what <> colon
</> indent 2 (ppr t)
</> "But"
<+> pquote (pprName d)
<+> "is computed at"
<+/> text (locStrRel loc dloc) <> "."
</> ""
</> "Hint:"
<+> align
( textwrap "Bind the expression producing" <+> pquote (pprName d)
<+> "with 'let' beforehand."
)
-- | Traverse the expression, emitting warnings if any of the literals overflow
-- their inferred types
--
-- Note: currently unable to detect float underflow (such as 1e-400 -> 0)
literalOverflowCheck :: Exp -> TermTypeM ()
literalOverflowCheck = void . check
where
check e@(IntLit x ty loc) =
e <$ case ty of
Info (Scalar (Prim t)) -> warnBounds (inBoundsI x t) x t loc
_ -> error "Inferred type of int literal is not a number"
check e@(FloatLit x ty loc) =
e <$ case ty of
Info (Scalar (Prim (FloatType t))) -> warnBounds (inBoundsF x t) x t loc
_ -> error "Inferred type of float literal is not a float"
check e@(Negate (IntLit x ty loc1) loc2) =
e <$ case ty of
Info (Scalar (Prim t)) -> warnBounds (inBoundsI (- x) t) (- x) t (loc1 <> loc2)
_ -> error "Inferred type of int literal is not a number"
check e = astMap identityMapper {mapOnExp = check} e
bitWidth ty = 8 * intByteSize ty :: Int
inBoundsI x (Signed t) = x >= -2 ^ (bitWidth t - 1) && x < 2 ^ (bitWidth t - 1)
inBoundsI x (Unsigned t) = x >= 0 && x < 2 ^ bitWidth t
inBoundsI x (FloatType Float32) = not $ isInfinite (fromIntegral x :: Float)
inBoundsI x (FloatType Float64) = not $ isInfinite (fromIntegral x :: Double)
inBoundsI _ Bool = error "Inferred type of int literal is not a number"
inBoundsF x Float32 = not $ isInfinite (realToFrac x :: Float)
inBoundsF x Float64 = not $ isInfinite x
warnBounds inBounds x ty loc =
unless inBounds $
typeError loc mempty $
"Literal " <> ppr x
<> " out of bounds for inferred type "
<> ppr ty
<> "."
-- | Type-check a top-level (or module-level) function definition.
-- Despite the name, this is also used for checking constant
-- definitions, by treating them as 0-ary functions.
checkFunDef ::
( Name,
Maybe UncheckedTypeExp,
[UncheckedTypeParam],
[UncheckedPattern],
UncheckedExp,
SrcLoc
) ->
TypeM
( VName,
[TypeParam],
[Pattern],
Maybe (TypeExp VName),
StructType,
[VName],
Exp
)
checkFunDef (fname, maybe_retdecl, tparams, params, body, loc) =
fmap fst $
runTermTypeM $ do
(tparams', params', maybe_retdecl', rettype', retext, body') <-
checkBinding (fname, maybe_retdecl, tparams, params, body, loc)
-- Since this is a top-level function, we also resolve overloaded
-- types, using either defaults or complaining about ambiguities.
fixOverloadedTypes $
typeVars rettype' <> foldMap (typeVars . patternType) params'
-- Then replace all inferred types in the body and parameters.
body'' <- updateTypes body'
params'' <- updateTypes params'
maybe_retdecl'' <- traverse updateTypes maybe_retdecl'
rettype'' <- normTypeFully rettype'
-- Check if pattern matches are exhaustive and yield
-- errors if not.
checkUnmatched body''
-- Check if the function body can actually be evaluated.
causalityCheck body''
literalOverflowCheck body''
bindSpaced [(Term, fname)] $ do
fname' <- checkName Term fname loc
when (nameToString fname `elem` doNotShadow) $
typeError loc mempty $
"The" <+> pprName fname <+> "operator may not be redefined."
return (fname', tparams', params'', maybe_retdecl'', rettype'', retext, body'')
-- | This is "fixing" as in "setting them", not "correcting them". We
-- only make very conservative fixing.
fixOverloadedTypes :: Names -> TermTypeM ()
fixOverloadedTypes tyvars_at_toplevel =
getConstraints >>= mapM_ fixOverloaded . M.toList . M.map snd
where
fixOverloaded (v, Overloaded ots usage)
| Signed Int32 `elem` ots = do
unify usage (Scalar (TypeVar () Nonunique (typeName v) [])) $
Scalar $ Prim $ Signed Int32
when (v `S.member` tyvars_at_toplevel) $
warn usage "Defaulting ambiguous type to i32."
| FloatType Float64 `elem` ots = do
unify usage (Scalar (TypeVar () Nonunique (typeName v) [])) $
Scalar $ Prim $ FloatType Float64
when (v `S.member` tyvars_at_toplevel) $
warn usage "Defaulting ambiguous type to f64."
| otherwise =
typeError usage mempty $
"Type is ambiguous (could be one of" <+> commasep (map ppr ots) <> ")."
</> "Add a type annotation to disambiguate the type."
fixOverloaded (_, NoConstraint _ usage) =
typeError usage mempty $
"Type of expression is ambiguous."
</> "Add a type annotation to disambiguate the type."
fixOverloaded (_, Equality usage) =
typeError usage mempty $
"Type is ambiguous (must be equality type)."
</> "Add a type annotation to disambiguate the type."
fixOverloaded (_, HasFields fs usage) =
typeError usage mempty $
"Type is ambiguous. Must be record with fields:"
</> indent 2 (stack $ map field $ M.toList fs)
</> "Add a type annotation to disambiguate the type."
where
field (l, t) = ppr l <> colon <+> align (ppr t)
fixOverloaded (_, HasConstrs cs usage) =
typeError usage mempty $
"Type is ambiguous (must be a sum type with constructors:"
<+> ppr (Sum cs) <> ")."
</> "Add a type annotation to disambiguate the type."
fixOverloaded (_, Size Nothing usage) =
typeError usage mempty "Size is ambiguous."
fixOverloaded _ = return ()
hiddenParamNames :: [Pattern] -> Names
hiddenParamNames params = hidden
where
param_all_names = mconcat $ map patternNames params
named (Named x, _) = Just x
named (Unnamed, _) = Nothing
param_names =
S.fromList $ mapMaybe (named . patternParam) params
hidden = param_all_names `S.difference` param_names
inferredReturnType :: SrcLoc -> [Pattern] -> PatternType -> TermTypeM StructType
inferredReturnType loc params t =
-- The inferred type may refer to names that are bound by the
-- parameter patterns, but which will not be visible in the type.
-- These we must turn into fresh type variables, which will be
-- existential in the return type.
fmap (toStruct . fst) $
unscopeType
loc
(M.filterWithKey (const . (`S.member` hidden)) $ foldMap patternMap params)
$ inferReturnUniqueness params t
where
hidden = hiddenParamNames params
checkBinding ::
( Name,
Maybe UncheckedTypeExp,
[UncheckedTypeParam],
[UncheckedPattern],
UncheckedExp,
SrcLoc
) ->
TermTypeM
( [TypeParam],
[Pattern],
Maybe (TypeExp VName),
StructType,
[VName],
Exp
)
checkBinding (fname, maybe_retdecl, tparams, params, body, loc) =
noUnique $
incLevel $
bindingParams tparams params $ \tparams' params' -> do
when (null params && any isSizeParam tparams) $
typeError
loc
mempty
"Size parameters are only allowed on bindings that also have value parameters."
maybe_retdecl' <- forM maybe_retdecl $ \retdecl -> do
(retdecl', ret_nodims, _) <- checkTypeExp retdecl
(ret, _) <- instantiateEmptyArrayDims loc "funret" Nonrigid ret_nodims
return (retdecl', ret)
body' <-
checkFunBody
params'
body
(snd <$> maybe_retdecl')
(maybe loc srclocOf maybe_retdecl)
params'' <- mapM updateTypes params'
body_t <- expTypeFully body'
(maybe_retdecl'', rettype) <- case maybe_retdecl' of
Just (retdecl', ret) -> do
let rettype_structural = toStructural ret
checkReturnAlias rettype_structural params'' body_t
when (null params) $ nothingMustBeUnique loc rettype_structural
ret' <- normTypeFully ret
return (Just retdecl', ret')
Nothing
| null params ->
return (Nothing, toStruct $ body_t `setUniqueness` Nonunique)
| otherwise -> do
body_t' <- inferredReturnType loc params'' body_t
return (Nothing, body_t')
verifyFunctionParams (Just fname) params''
(tparams'', params''', rettype'', retext) <-
letGeneralise fname loc tparams' params'' rettype
checkGlobalAliases params'' body_t loc
return (tparams'', params''', maybe_retdecl'', rettype'', retext, body')
where
checkReturnAlias rettp params' =
foldM_ (checkReturnAlias' params') S.empty . returnAliasing rettp
checkReturnAlias' params' seen (Unique, names)
| any (`S.member` S.map snd seen) $ S.toList names =
uniqueReturnAliased fname loc
| otherwise = do
notAliasingParam params' names
return $ seen `S.union` tag Unique names
checkReturnAlias' _ seen (Nonunique, names)
| any (`S.member` seen) $ S.toList $ tag Unique names =
uniqueReturnAliased fname loc
| otherwise = return $ seen `S.union` tag Nonunique names
notAliasingParam params' names =
forM_ params' $ \p ->
let consumedNonunique p' =
not (unique $ unInfo $ identType p') && (identName p' `S.member` names)
in case find consumedNonunique $ S.toList $ patternIdents p of
Just p' ->
returnAliased fname (baseName $ identName p') loc
Nothing ->
return ()
tag u = S.map (u,)
returnAliasing (Scalar (Record ets1)) (Scalar (Record ets2)) =
concat $ M.elems $ M.intersectionWith returnAliasing ets1 ets2
returnAliasing expected got =
[(uniqueness expected, S.map aliasVar $ aliases got)]
-- | Extract all the shape names that occur in positive position
-- (roughly, left side of an arrow) in a given type.
typeDimNamesPos :: TypeBase (DimDecl VName) als -> S.Set VName
typeDimNamesPos (Scalar (Arrow _ _ t1 t2)) = onParam t1 <> typeDimNamesPos t2
where
onParam :: TypeBase (DimDecl VName) als -> S.Set VName
onParam (Scalar Arrow {}) = mempty
onParam (Scalar (Record fs)) = mconcat $ map onParam $ M.elems fs
onParam (Scalar (TypeVar _ _ _ targs)) = mconcat $ map onTypeArg targs
onParam t = typeDimNames t
onTypeArg (TypeArgDim (NamedDim d) _) = S.singleton $ qualLeaf d
onTypeArg (TypeArgDim _ _) = mempty
onTypeArg (TypeArgType t _) = onParam t
typeDimNamesPos _ = mempty
checkGlobalAliases :: [Pattern] -> PatternType -> SrcLoc -> TermTypeM ()
checkGlobalAliases params body_t loc = do
vtable <- asks $ scopeVtable . termScope
let isLocal v = case v `M.lookup` vtable of
Just (BoundV Local _ _) -> True
_ -> False
let als =
filter (not . isLocal) $
S.toList $
boundArrayAliases body_t
`S.difference` foldMap patternNames params
case als of
v : _
| not $ null params ->
typeError loc mempty $
"Function result aliases the free variable "
<> pquote (pprName v)
<> "."
</> "Use" <+> pquote "copy" <+> "to break the aliasing."
_ ->
return ()
inferReturnUniqueness :: [Pattern] -> PatternType -> PatternType
inferReturnUniqueness params t =
let forbidden = aliasesMultipleTimes t
uniques = uniqueParamNames params
delve (Scalar (Record fs)) =
Scalar $ Record $ M.map delve fs
delve t'
| all (`S.member` uniques) (boundArrayAliases t'),
not $ any ((`S.member` forbidden) . aliasVar) (aliases t') =
t'
| otherwise =
t' `setUniqueness` Nonunique
in delve t
-- An alias inhibits uniqueness if it is used in disjoint values.
aliasesMultipleTimes :: PatternType -> Names
aliasesMultipleTimes = S.fromList . map fst . filter ((> 1) . snd) . M.toList . delve
where
delve (Scalar (Record fs)) =
foldl' (M.unionWith (+)) mempty $ map delve $ M.elems fs
delve t =
M.fromList $ zip (map aliasVar $ S.toList (aliases t)) $ repeat (1 :: Int)
uniqueParamNames :: [Pattern] -> Names
uniqueParamNames =
S.map identName
. S.filter (unique . unInfo . identType)
. foldMap patternIdents
boundArrayAliases :: PatternType -> S.Set VName
boundArrayAliases (Array als _ _ _) = boundAliases als
boundArrayAliases (Scalar Prim {}) = mempty
boundArrayAliases (Scalar (Record fs)) = foldMap boundArrayAliases fs
boundArrayAliases (Scalar (TypeVar als _ _ _)) = boundAliases als
boundArrayAliases (Scalar Arrow {}) = mempty
boundArrayAliases (Scalar (Sum fs)) =
mconcat $ concatMap (map boundArrayAliases) $ M.elems fs
-- | The set of in-scope variables that are being aliased.
boundAliases :: Aliasing -> S.Set VName
boundAliases = S.map aliasVar . S.filter bound
where
bound AliasBound {} = True
bound AliasFree {} = False
nothingMustBeUnique :: SrcLoc -> TypeBase () () -> TermTypeM ()
nothingMustBeUnique loc = check
where
check (Array _ Unique _ _) = bad
check (Scalar (TypeVar _ Unique _ _)) = bad
check (Scalar (Record fs)) = mapM_ check fs
check (Scalar (Sum fs)) = mapM_ (mapM_ check) fs
check _ = return ()
bad = typeError loc mempty "A top-level constant cannot have a unique type."
-- | Verify certain restrictions on function parameters, and bail out
-- on dubious constructions.
--
-- These restrictions apply to all functions (anonymous or otherwise).
-- Top-level functions have further restrictions that are checked
-- during let-generalisation.
verifyFunctionParams :: Maybe Name -> [Pattern] -> TermTypeM ()
verifyFunctionParams fname params =
onFailure (CheckingParams fname) $
verifyParams (foldMap patternNames params) =<< mapM updateTypes params
where
verifyParams forbidden (p : ps)
| d : _ <- S.toList $ patternDimNames p `S.intersection` forbidden =
typeError p mempty $
"Parameter" <+> pquote (ppr p)
<+/> "refers to size" <+> pquote (pprName d)
<> comma
<+/> textwrap "which will not be accessible to the caller"
<> comma
<+/> textwrap "possibly because it is nested in a tuple or record."
<+/> textwrap "Consider ascribing an explicit type that does not reference "
<> pquote (pprName d)
<> "."
| otherwise = verifyParams forbidden' ps
where
forbidden' =
case patternParam p of
(Named v, _) -> forbidden `S.difference` S.singleton v
_ -> forbidden
verifyParams _ [] = return ()
-- Returns the sizes of the immediate type produced,
-- the sizes of parameter types, and the sizes of return types.
dimUses :: StructType -> (Names, Names, Names)
dimUses = execWriter . traverseDims f
where
f _ PosImmediate (NamedDim v) = tell (S.singleton (qualLeaf v), mempty, mempty)
f _ PosParam (NamedDim v) = tell (mempty, S.singleton (qualLeaf v), mempty)
f _ PosReturn (NamedDim v) = tell (mempty, mempty, S.singleton (qualLeaf v))
f _ _ _ = return ()
-- | Find at all type variables in the given type that are covered by
-- the constraints, and produce type parameters that close over them.
--
-- The passed-in list of type parameters is always prepended to the
-- produced list of type parameters.
closeOverTypes ::
Name ->
SrcLoc ->
[TypeParam] ->
[StructType] ->
StructType ->
Constraints ->
TermTypeM ([TypeParam], StructType, [VName])
closeOverTypes defname defloc tparams paramts ret substs = do
(more_tparams, retext) <-
partitionEithers . catMaybes
<$> mapM closeOver (M.toList $ M.map snd to_close_over)
let retToAnyDim v = do
guard $ v `S.member` ret_sizes
UnknowableSize {} <- snd <$> M.lookup v substs
Just $ SizeSubst AnyDim
return
( tparams ++ more_tparams,
applySubst retToAnyDim ret,
retext
)
where
t = foldFunType paramts ret
to_close_over = M.filterWithKey (\k _ -> k `S.member` visible) substs
visible = typeVars t <> typeDimNames t
(produced_sizes, param_sizes, ret_sizes) = dimUses t
-- Avoid duplicate type parameters.
closeOver (k, _)
| k `elem` map typeParamName tparams =
return Nothing
closeOver (k, NoConstraint l usage) =
return $ Just $ Left $ TypeParamType l k $ srclocOf usage
closeOver (k, ParamType l loc) =
return $ Just $ Left $ TypeParamType l k loc
closeOver (k, Size Nothing usage) =
return $ Just $ Left $ TypeParamDim k $ srclocOf usage
closeOver (k, UnknowableSize _ _)
| k `S.member` param_sizes = do
notes <- dimNotes defloc $ NamedDim $ qualName k
typeError defloc notes $
"Unknowable size" <+> pquote (pprName k)
<+> "imposes constraint on type of"
<+> pquote (pprName defname)
<> ", which is inferred as:"
</> indent 2 (ppr t)
| k `S.member` produced_sizes =
return $ Just $ Right k
closeOver (_, _) =
return Nothing
letGeneralise ::
Name ->
SrcLoc ->
[TypeParam] ->
[Pattern] ->
StructType ->
TermTypeM ([TypeParam], [Pattern], StructType, [VName])
letGeneralise defname defloc tparams params rettype =
onFailure (CheckingLetGeneralise defname) $ do
now_substs <- getConstraints
-- Candidates for let-generalisation are those type variables that
--
-- (1) were not known before we checked this function, and
--
-- (2) are not used in the (new) definition of any type variables
-- known before we checked this function.
--
-- (3) are not referenced from an overloaded type (for example,
-- are the element types of an incompletely resolved record type).
-- This is a bit more restrictive than I'd like, and SML for
-- example does not have this restriction.
--
-- Criteria (1) and (2) is implemented by looking at the binding
-- level of the type variables.
let keep_type_vars = overloadedTypeVars now_substs
cur_lvl <- curLevel
let candidate k (lvl, _) = (k `S.notMember` keep_type_vars) && lvl >= cur_lvl
new_substs = M.filterWithKey candidate now_substs
(tparams', rettype', retext) <-
closeOverTypes
defname
defloc
tparams
(map patternStructType params)
rettype
new_substs
rettype'' <- updateTypes rettype'
let used_sizes =
foldMap typeDimNames $
rettype'' : map patternStructType params
case filter ((`S.notMember` used_sizes) . typeParamName) $
filter isSizeParam tparams' of
[] -> return ()
tp : _ ->
typeError defloc mempty $
"Size parameter" <+> pquote (ppr tp) <+> "unused."
-- We keep those type variables that were not closed over by
-- let-generalisation.
modifyConstraints $ M.filterWithKey $ \k _ -> k `notElem` map typeParamName tparams'
return (tparams', params, rettype'', retext)
checkFunBody ::
[Pattern] ->
UncheckedExp ->
Maybe StructType ->
SrcLoc ->
TermTypeM Exp
checkFunBody params body maybe_rettype loc = do
body' <- noSizeEscape $ checkExp body
-- Unify body return type with return annotation, if one exists.
case maybe_rettype of
Just rettype -> do
(rettype_withdims, _) <- instantiateEmptyArrayDims loc "impl" Nonrigid rettype
body_t <- expTypeFully body'
-- We need to turn any sizes provided by "hidden" parameter
-- names into existential sizes instead.
let hidden = hiddenParamNames params
(body_t', _) <-
unscopeType
loc
( M.filterWithKey (const . (`S.member` hidden)) $
foldMap patternMap params
)
body_t
let usage = mkUsage (srclocOf body) "return type annotation"
onFailure (CheckingReturn rettype (toStruct body_t')) $
expect usage rettype_withdims $ toStruct body_t'
-- We also have to make sure that uniqueness matches. This is done
-- explicitly, because uniqueness is ignored by unification.
rettype' <- normTypeFully rettype
body_t'' <- normTypeFully rettype -- Substs may have changed.
unless (body_t'' `subtypeOf` anySizes rettype') $
typeError (srclocOf body) mempty $
"Body type" </> indent 2 (ppr body_t'')
</> "is not a subtype of annotated type"
</> indent 2 (ppr rettype')
Nothing -> return ()
return body'
--- Consumption
occur :: Occurences -> TermTypeM ()
occur = tell
-- | Proclaim that we have made read-only use of the given variable.
observe :: Ident -> TermTypeM ()
observe (Ident nm (Info t) loc) =
let als = AliasBound nm `S.insert` aliases t
in occur [observation als loc]
checkIfConsumable :: SrcLoc -> Aliasing -> TermTypeM ()
checkIfConsumable loc als = do
vtable <- asks $ scopeVtable . termScope
let consumable v = case M.lookup v vtable of
Just (BoundV Local _ t)
| arrayRank t > 0 -> unique t
| Scalar TypeVar {} <- t -> unique t
| otherwise -> True
_ -> False
case filter (not . consumable) $ map aliasVar $ S.toList als of
v : _ ->
typeError loc mempty $
"Would consume variable" <+> pquote (pprName v)
<> ", which is not allowed."
[] -> return ()
-- | Proclaim that we have written to the given variable.
consume :: SrcLoc -> Aliasing -> TermTypeM ()
consume loc als = do
checkIfConsumable loc als
occur [consumption als loc]
-- | Proclaim that we have written to the given variable, and mark
-- accesses to it and all of its aliases as invalid inside the given
-- computation.
consuming :: Ident -> TermTypeM a -> TermTypeM a
consuming (Ident name (Info t) loc) m = do
consume loc $ AliasBound name `S.insert` aliases t
localScope consume' m
where
consume' scope =
scope {scopeVtable = M.insert name (WasConsumed loc) $ scopeVtable scope}
collectOccurences :: TermTypeM a -> TermTypeM (a, Occurences)
collectOccurences m = pass $ do
(x, dataflow) <- listen m
return ((x, dataflow), const mempty)
tapOccurences :: TermTypeM a -> TermTypeM (a, Occurences)
tapOccurences = listen
removeSeminullOccurences :: TermTypeM a -> TermTypeM a
removeSeminullOccurences = censor $ filter $ not . seminullOccurence
checkIfUsed :: Occurences -> Ident -> TermTypeM ()
checkIfUsed occs v
| not $ identName v `S.member` allOccuring occs,
not $ "_" `isPrefixOf` prettyName (identName v) =
warn (srclocOf v) $ "Unused variable " ++ quote (pretty $ baseName $ identName v) ++ "."
| otherwise =
return ()
alternative :: TermTypeM a -> TermTypeM b -> TermTypeM (a, b)
alternative m1 m2 = pass $ do
(x, occurs1) <- listen $ noSizeEscape m1
(y, occurs2) <- listen $ noSizeEscape m2
checkOccurences occurs1
checkOccurences occurs2
let usage = occurs1 `altOccurences` occurs2
return ((x, y), const usage)
-- | Make all bindings nonunique.
noUnique :: TermTypeM a -> TermTypeM a
noUnique = localScope (\scope -> scope {scopeVtable = M.map set $ scopeVtable scope})
where
set (BoundV l tparams t) = BoundV l tparams $ t `setUniqueness` Nonunique
set (OverloadedF ts pts rt) = OverloadedF ts pts rt
set EqualityF = EqualityF
set (WasConsumed loc) = WasConsumed loc
onlySelfAliasing :: TermTypeM a -> TermTypeM a
onlySelfAliasing = localScope (\scope -> scope {scopeVtable = M.mapWithKey set $ scopeVtable scope})
where
set k (BoundV l tparams t) =
BoundV l tparams $
t `addAliases` S.intersection (S.singleton (AliasBound k))
set _ (OverloadedF ts pts rt) = OverloadedF ts pts rt
set _ EqualityF = EqualityF
set _ (WasConsumed loc) = WasConsumed loc
arrayOfM ::
(Pretty (ShapeDecl dim), Monoid as) =>
SrcLoc ->
TypeBase dim as ->
ShapeDecl dim ->
Uniqueness ->
TermTypeM (TypeBase dim as)
arrayOfM loc t shape u = do
zeroOrderType (mkUsage loc "use as array element") "type used in array" t
return $ arrayOf t shape u
updateTypes :: ASTMappable e => e -> TermTypeM e
updateTypes = astMap tv
where
tv =
ASTMapper
{ mapOnExp = astMap tv,
mapOnName = pure,
mapOnQualName = pure,
mapOnStructType = normTypeFully,
mapOnPatternType = normTypeFully
}