{-# LANGUAGE CPP #-}
{-# LANGUAGE NondecreasingIndentation #-}
module Agda.TypeChecking.Monad.Signature where
import Prelude hiding (null)
import Control.Arrow (first, second, (***))
import Control.Applicative hiding (empty)
import Control.Monad.State
import Control.Monad.Reader
import Control.Monad.Writer
import Control.Monad.Trans.Maybe
import qualified Data.List as List
import Data.Set (Set)
import qualified Data.Set as Set
import Data.Map (Map)
import qualified Data.Map as Map
import Data.Maybe
import Data.Monoid
import Agda.Syntax.Abstract.Name
import Agda.Syntax.Abstract (Ren, ScopeCopyInfo(..))
import Agda.Syntax.Common
import Agda.Syntax.Internal as I
import Agda.Syntax.Internal.Names
import Agda.Syntax.Position
import Agda.Syntax.Treeless (Compiled(..), TTerm)
import Agda.TypeChecking.Monad.Base
import Agda.TypeChecking.Monad.Debug
import Agda.TypeChecking.Monad.Context
import Agda.TypeChecking.Monad.Options
import Agda.TypeChecking.Monad.Env
import Agda.TypeChecking.Monad.Mutual
import Agda.TypeChecking.Monad.Open
import Agda.TypeChecking.Monad.State
import Agda.TypeChecking.Monad.Trace
import Agda.TypeChecking.DropArgs
import Agda.TypeChecking.Warnings
import Agda.TypeChecking.Positivity.Occurrence
import Agda.TypeChecking.Substitute
import {-# SOURCE #-} Agda.TypeChecking.Telescope
import {-# SOURCE #-} Agda.TypeChecking.CompiledClause.Compile
import {-# SOURCE #-} Agda.TypeChecking.Polarity
import {-# SOURCE #-} Agda.TypeChecking.ProjectionLike
import Agda.Utils.Except ( ExceptT )
import Agda.Utils.Functor
import Agda.Utils.Lens
import Agda.Utils.List
import Agda.Utils.Map as Map
import Agda.Utils.Maybe
import Agda.Utils.Monad
import Agda.Utils.Null
import Agda.Utils.Permutation
import Agda.Utils.Pretty
import Agda.Utils.Size
import qualified Agda.Utils.HashMap as HMap
#include "undefined.h"
import Agda.Utils.Impossible
addConstant :: QName -> Definition -> TCM ()
addConstant q d = do
reportSLn "tc.signature" 20 $ "adding constant " ++ prettyShow q ++ " to signature"
tel <- getContextTelescope
let tel' = replaceEmptyName "r" $ killRange $ case theDef d of
Constructor{} -> fmap hideOrKeepInstance tel
Function{ funProjection = Just Projection{ projProper = Just{}, projIndex = n } } ->
let fallback = fmap hideOrKeepInstance tel in
if n > 0 then fallback else
case initLast $ telToList tel of
Nothing -> fallback
Just (doms, dom) -> telFromList $ fmap hideOrKeepInstance doms ++ [dom]
_ -> tel
let d' = abstract tel' $ d { defName = q }
reportSDoc "tc.signature" 60 $ return $ text "lambda-lifted definition =" <?> pretty d'
modifySignature $ updateDefinitions $ HMap.insertWith (+++) q d'
i <- currentOrFreshMutualBlock
setMutualBlock i q
where
new +++ old = new { defDisplay = defDisplay new ++ defDisplay old
, defInstance = defInstance new `mplus` defInstance old }
setTerminates :: QName -> Bool -> TCM ()
setTerminates q b = modifySignature $ updateDefinition q $ updateTheDef $ \case
def@Function{} -> def { funTerminates = Just b }
def -> def
modifyFunClauses :: QName -> ([Clause] -> [Clause]) -> TCM ()
modifyFunClauses q f =
modifySignature $ updateDefinition q $ updateTheDef $ updateFunClauses f
addClauses :: QName -> [Clause] -> TCM ()
addClauses q cls = do
tel <- getContextTelescope
modifySignature $ updateDefinition q $ updateTheDef
$ updateFunClauses (++ abstract tel cls)
. updateFunCopatternLHS (|| isCopatternLHS cls)
mkPragma :: String -> TCM CompilerPragma
mkPragma s = CompilerPragma <$> getCurrentRange <*> pure s
addPragma :: BackendName -> QName -> String -> TCM ()
addPragma b q s = modifySignature . updateDefinition q . addCompilerPragma b =<< mkPragma s
type HaskellCode = String
type HaskellType = String
type JSCode = String
type CoreCode = String
addDeprecatedPragma :: String -> BackendName -> QName -> String -> TCM ()
addDeprecatedPragma old b q s = do
let pq = prettyShow $ nameConcrete $ qnameName q
warning $ DeprecationWarning (unwords ["The", old, "pragma"])
(unwords ["{-# COMPILE", b, pq, s, "#-}"]) "2.6"
addPragma b q s
dataFormat :: String -> [String] -> String
dataFormat ty cons = "= data " ++ ty ++ " (" ++ List.intercalate " | " cons ++ ")"
addHaskellCode :: QName -> HaskellCode -> TCM ()
addHaskellCode q hsCode = addDeprecatedPragma "COMPILED" ghcBackendName q $ "= " ++ hsCode
addHaskellExport :: QName -> String -> TCM ()
addHaskellExport q hsName = addDeprecatedPragma "COMPILED_EXPORT" ghcBackendName q $ "as " ++ hsName
addHaskellType :: QName -> HaskellType -> TCM ()
addHaskellType q hsTy = addDeprecatedPragma "COMPILED_TYPE" ghcBackendName q $ "= type " ++ hsTy
addHaskellData :: QName -> HaskellType -> [HaskellCode] -> TCM ()
addHaskellData q hsTy hsCons = addDeprecatedPragma "COMPILED_DATA" ghcBackendName q $ dataFormat hsTy hsCons
addJSCode :: QName -> JSCode -> TCM ()
addJSCode q jsDef = addDeprecatedPragma "COMPILED_JS" jsBackendName q ("= " ++ jsDef)
addCoreCode :: QName -> CoreCode -> TCM ()
addCoreCode q crDef = addDeprecatedPragma "COMPILED_UHC" uhcBackendName q $ "= " ++ crDef
addCoreType :: QName -> CoreCode -> [CoreCode] -> TCM ()
addCoreType q crTy crCons = addDeprecatedPragma "COMPILED_DATA_UHC" uhcBackendName q $ dataFormat crTy crCons
getUniqueCompilerPragma :: BackendName -> QName -> TCM (Maybe CompilerPragma)
getUniqueCompilerPragma backend q = do
ps <- defCompilerPragmas backend <$> getConstInfo q
case ps of
[] -> return Nothing
[p] -> return $ Just p
_ -> setCurrentRange (ps !! 1) $
genericDocError $
hang (text ("Conflicting " ++ backend ++ " pragmas for") <+> pretty q <+> text "at") 2 $
vcat [ text "-" <+> pretty (getRange p) | p <- ps ]
setFunctionFlag :: FunctionFlag -> Bool -> QName -> TCM ()
setFunctionFlag flag val q = modifyGlobalDefinition q $ set (theDefLens . funFlag flag) val
markStatic :: QName -> TCM ()
markStatic = setFunctionFlag FunStatic True
markInline :: Bool -> QName -> TCM ()
markInline b = setFunctionFlag FunInline b
markInjective :: QName -> TCM ()
markInjective q = modifyGlobalDefinition q $ \def -> def { defInjective = True }
unionSignatures :: [Signature] -> Signature
unionSignatures ss = foldr unionSignature emptySignature ss
where
unionSignature (Sig a b c) (Sig a' b' c') =
Sig (Map.union a a')
(HMap.union b b')
(HMap.unionWith mappend c c')
addSection :: ModuleName -> TCM ()
addSection m = do
tel <- getContextTelescope
let sec = Section tel
whenJustM (getSection m) $ \ sec' -> do
if (sec == sec') then do
reportSLn "tc.section" 10 $ "warning: redundantly adding existing section " ++ prettyShow m
reportSLn "tc.section" 60 $ "with content " ++ prettyShow sec
else do
reportSLn "impossible" 10 $ "overwriting existing section " ++ prettyShow m
reportSLn "impossible" 60 $ "of content " ++ prettyShow sec'
reportSLn "impossible" 60 $ "with content " ++ prettyShow sec
__IMPOSSIBLE__
setModuleCheckpoint m
modifySignature $ over sigSections $ Map.insert m sec
setModuleCheckpoint :: ModuleName -> TCM ()
setModuleCheckpoint m = do
chkpt <- view eCurrentCheckpoint
stModuleCheckpoints %= Map.insert m chkpt
{-# SPECIALIZE getSection :: ModuleName -> TCM (Maybe Section) #-}
{-# SPECIALIZE getSection :: ModuleName -> ReduceM (Maybe Section) #-}
getSection :: (Functor m, ReadTCState m) => ModuleName -> m (Maybe Section)
getSection m = do
sig <- (^. stSignature . sigSections) <$> getTCState
isig <- (^. stImports . sigSections) <$> getTCState
return $ Map.lookup m sig `mplus` Map.lookup m isig
{-# SPECIALIZE lookupSection :: ModuleName -> TCM Telescope #-}
{-# SPECIALIZE lookupSection :: ModuleName -> ReduceM Telescope #-}
lookupSection :: (Functor m, ReadTCState m) => ModuleName -> m Telescope
lookupSection m = maybe EmptyTel (^. secTelescope) <$> getSection m
addDisplayForms :: QName -> TCM ()
addDisplayForms x = do
def <- getConstInfo x
args <- drop (projectionArgs $ theDef def) <$> getContextArgs
add args x x $ map Apply $ raise 1 args
where
add args top x es0 = do
def <- getConstInfo x
let cs = defClauses def
isCopy = defCopy def
case cs of
[ cl ] -> do
if not isCopy
then noDispForm x "not a copy" else do
if not $ all (isVar . namedArg) $ namedClausePats cl
then noDispForm x "properly matching patterns" else do
let n = size $ namedClausePats cl
(es1, es2) = splitAt n es0
m = n - size es1
vs1 = map unArg $ fromMaybe __IMPOSSIBLE__ $ allApplyElims es1
sub = parallelS $ reverse $ vs1 ++ replicate m (var 0)
body = applySubst sub (compiledClauseBody cl) `applyE` es2
case unSpine <$> body of
Just (Def y es) -> do
let df = Display m es $ DTerm $ Def top $ map Apply args
reportSLn "tc.display.section" 20 $ unlines
[ "adding display form " ++ prettyShow y ++ " --> " ++ prettyShow top
, show df
]
addDisplayForm y df
add args top y es
Just v -> noDispForm x $ "not a def body, but " ++ show v
Nothing -> noDispForm x $ "bad body"
[] | Constructor{ conSrcCon = h } <- theDef def -> do
let y = conName h
df = Display 0 [] $ DTerm $ Con (h {conName = top }) ConOSystem []
reportSLn "tc.display.section" 20 $ unlines
[ "adding display form " ++ prettyShow y ++ " --> " ++ prettyShow top
, show df
]
addDisplayForm y df
[] -> noDispForm x "no clauses"
(_:_:_) -> noDispForm x "many clauses"
noDispForm x reason = reportSLn "tc.display.section" 30 $
"no display form from " ++ prettyShow x ++ " because " ++ reason
isVar VarP{} = True
isVar _ = False
applySection
:: ModuleName
-> Telescope
-> ModuleName
-> Args
-> ScopeCopyInfo
-> TCM ()
applySection new ptel old ts ScopeCopyInfo{ renModules = rm, renNames = rd } = do
rd <- closeConstructors rd
applySection' new ptel old ts ScopeCopyInfo{ renModules = rm, renNames = rd }
where
closeConstructors :: Ren QName -> TCM (Ren QName)
closeConstructors rd = do
ds <- List.nub . concat <$> mapM (constructorData . fst) rd
cs <- List.nub . concat <$> mapM (dataConstructors . fst) rd
new <- concat <$> mapM rename (ds ++ cs)
reportSLn "tc.mod.apply.complete" 30 $
"also copying: " ++ prettyShow new
return $ new ++ rd
where
rename :: QName -> TCM (Ren QName)
rename x =
case lookup x rd of
Nothing -> do y <- freshName_ (prettyShow x)
return [(x, qnameFromList [y])]
Just{} -> return []
constructorData :: QName -> TCM [QName]
constructorData x = do
def <- theDef <$> getConstInfo x
return $ case def of
Constructor{ conData = d } -> [d]
_ -> []
dataConstructors :: QName -> TCM [QName]
dataConstructors x = do
def <- theDef <$> getConstInfo x
return $ case def of
Datatype{ dataCons = cs } -> cs
Record{ recConHead = h } -> [conName h]
_ -> []
applySection' :: ModuleName -> Telescope -> ModuleName -> Args -> ScopeCopyInfo -> TCM ()
applySection' new ptel old ts ScopeCopyInfo{ renNames = rd, renModules = rm } = do
reportSLn "tc.mod.apply" 10 $ render $ vcat
[ text "applySection"
, text "new =" <+> pretty new
, text "ptel =" <+> pretty ptel
, text "old =" <+> pretty old
, text "ts =" <+> pretty ts
]
mapM_ (copyDef ts) rd
mapM_ (copySec ts) rm
computePolarity (map snd rd)
where
copyName x = fromMaybe x $ lookup x rd
argsToUse x = do
let m = commonParentModule old x
reportSLn "tc.mod.apply" 80 $ "Common prefix: " ++ prettyShow m
size <$> lookupSection m
copyDef :: Args -> (QName, QName) -> TCM ()
copyDef ts (x, y) = do
def <- getConstInfo x
np <- argsToUse (qnameModule x)
hidings <- map getHiding . telToList <$> lookupSection (qnameModule x)
let ts' = zipWith setHiding hidings ts
commonTel <- lookupSection (commonParentModule old $ qnameModule x)
reportSLn "tc.mod.apply" 80 $ init $ unlines
[ "copyDef " ++ prettyShow x ++ " -> " ++ prettyShow y
, "ts' = " ++ prettyShow ts' ]
copyDef' ts' np def
where
copyDef' ts np d = do
reportSLn "tc.mod.apply" 60 $ "making new def for " ++ prettyShow y ++ " from " ++ prettyShow x ++ " with " ++ show np ++ " args " ++ show (defAbstract d)
reportSLn "tc.mod.apply" 80 $ init $ unlines
[ "args = " ++ show ts'
, "old type = " ++ prettyShow (defType d) ]
reportSLn "tc.mod.apply" 80 $
"new type = " ++ prettyShow t
addConstant y =<< nd y
makeProjection y
unless isCon $ whenJust inst $ \ c -> addNamedInstance y c
when (size ptel == 0) $ do
addDisplayForms y
where
ts' = take np ts
t = defType d `piApply` ts'
pol = defPolarity d `apply` ts'
occ = defArgOccurrences d `apply` ts'
inst = defInstance d
nd :: QName -> TCM Definition
nd y = for def $ \ df -> Defn
{ defArgInfo = defArgInfo d
, defName = y
, defType = t
, defPolarity = pol
, defArgOccurrences = occ
, defDisplay = []
, defMutual = -1
, defCompiledRep = noCompiledRep
, defInstance = inst
, defCopy = True
, defMatchable = False
, defInjective = False
, theDef = df }
oldDef = theDef d
isCon = case oldDef of { Constructor{} -> True ; _ -> False }
mutual = case oldDef of { Function{funMutual = m} -> m ; _ -> Nothing }
extlam = case oldDef of { Function{funExtLam = e} -> e ; _ -> Nothing }
with = case oldDef of { Function{funWith = w} -> copyName <$> w ; _ -> Nothing }
isVar0 t = case unArg t of Var 0 [] -> True; _ -> False
proj = case oldDef of
Function{funProjection = Just p@Projection{projIndex = n}}
| size ts' < n || (size ts' == n && maybe True isVar0 (lastMaybe ts'))
-> Just $ p { projIndex = n - size ts'
, projLams = projLams p `apply` ts'
, projProper= fmap copyName $ projProper p
}
_ -> Nothing
def =
case oldDef of
Constructor{ conPars = np, conData = d } -> return $
oldDef { conPars = np - size ts'
, conData = copyName d
}
Datatype{ dataPars = np, dataCons = cs } -> return $
oldDef { dataPars = np - size ts'
, dataClause = Just cl
, dataCons = map copyName cs
}
Record{ recPars = np, recTel = tel } -> return $
oldDef { recPars = np - size ts'
, recClause = Just cl
, recTel = apply tel ts'
}
_ -> do
cc <- compileClauses Nothing [cl]
let newDef =
set funMacro (oldDef ^. funMacro) $
set funStatic (oldDef ^. funStatic) $
set funInline True $
emptyFunction
{ funClauses = [cl]
, funCompiled = Just cc
, funMutual = mutual
, funProjection = proj
, funTerminates = Just True
, funExtLam = extlam
, funWith = with
, funCopatternLHS = isCopatternLHS [cl]
}
reportSDoc "tc.mod.apply" 80 $ return $ (text "new def for" <+> pretty x) <?> pretty newDef
return newDef
cl = Clause { clauseLHSRange = getRange $ defClauses d
, clauseFullRange = getRange $ defClauses d
, clauseTel = EmptyTel
, namedClausePats = []
, clauseBody = Just $ dropArgs pars $ case oldDef of
Function{funProjection = Just p} -> projDropParsApply p ProjSystem ts'
_ -> Def x $ map Apply ts'
, clauseType = Just $ defaultArg t
, clauseCatchall = False
, clauseUnreachable = Just False
}
where
pars = max 0 $ maybe 0 (pred . projIndex) proj
copySec :: Args -> (ModuleName, ModuleName) -> TCM ()
copySec ts (x, y) = do
totalArgs <- argsToUse x
tel <- lookupSection x
let sectionTel = apply tel $ take totalArgs ts
reportSLn "tc.mod.apply" 80 $ "Copying section " ++ prettyShow x ++ " to " ++ prettyShow y
reportSLn "tc.mod.apply" 80 $ " ts = " ++ List.intercalate "; " (map prettyShow ts)
reportSLn "tc.mod.apply" 80 $ " totalArgs = " ++ show totalArgs
reportSLn "tc.mod.apply" 80 $ " tel = " ++ List.intercalate " " (map (fst . unDom) $ telToList tel)
reportSLn "tc.mod.apply" 80 $ " sectionTel = " ++ List.intercalate " " (map (fst . unDom) $ telToList ptel)
addContext sectionTel $ addSection y
addDisplayForm :: QName -> DisplayForm -> TCM ()
addDisplayForm x df = do
d <- makeOpen df
let add = updateDefinition x $ \ def -> def{ defDisplay = d : defDisplay def }
ifM (isLocal x)
(modifySignature add)
(stImportsDisplayForms %= HMap.insertWith (++) x [d])
whenM (hasLoopingDisplayForm x) $
typeError . GenericDocError $ text "Cannot add recursive display form for" <+> pretty x
isLocal :: QName -> TCM Bool
isLocal x = HMap.member x <$> use (stSignature . sigDefinitions)
getDisplayForms :: QName -> TCM [LocalDisplayForm]
getDisplayForms q = do
ds <- either (const []) defDisplay <$> getConstInfo' q
ds1 <- HMap.lookupDefault [] q <$> use stImportsDisplayForms
ds2 <- HMap.lookupDefault [] q <$> use stImportedDisplayForms
ifM (isLocal q) (return $ ds ++ ds1 ++ ds2)
(return $ ds1 ++ ds ++ ds2)
chaseDisplayForms :: QName -> TCM (Set QName)
chaseDisplayForms q = go Set.empty [q]
where
go used [] = pure used
go used (q : qs) = do
let rhs (Display _ _ e) = e
ds <- (`Set.difference` used) . Set.unions . map (namesIn . rhs . dget)
<$> (getDisplayForms q `catchError_` \ _ -> pure [])
go (Set.union ds used) (Set.toList ds ++ qs)
hasLoopingDisplayForm :: QName -> TCM Bool
hasLoopingDisplayForm q = Set.member q <$> chaseDisplayForms q
canonicalName :: QName -> TCM QName
canonicalName x = do
def <- theDef <$> getConstInfo x
case def of
Constructor{conSrcCon = c} -> return $ conName c
Record{recClause = Just (Clause{ clauseBody = body })} -> can body
Datatype{dataClause = Just (Clause{ clauseBody = body })} -> can body
_ -> return x
where
can body = canonicalName $ extract $ fromMaybe __IMPOSSIBLE__ body
extract (Def x _) = x
extract _ = __IMPOSSIBLE__
sameDef :: QName -> QName -> TCM (Maybe QName)
sameDef d1 d2 = do
c1 <- canonicalName d1
c2 <- canonicalName d2
if (c1 == c2) then return $ Just c1 else return Nothing
whatInduction :: MonadTCM tcm => QName -> tcm Induction
whatInduction c = liftTCM $ do
def <- theDef <$> getConstInfo c
case def of
Datatype{ dataInduction = i } -> return i
Record{} | not (recRecursive def) -> return Inductive
Record{ recInduction = i } -> return $ fromMaybe Inductive i
Constructor{ conInd = i } -> return i
_ -> __IMPOSSIBLE__
singleConstructorType :: QName -> TCM Bool
singleConstructorType q = do
d <- theDef <$> getConstInfo q
case d of
Record {} -> return True
Constructor { conData = d } -> do
di <- theDef <$> getConstInfo d
return $ case di of
Record {} -> True
Datatype { dataCons = cs } -> length cs == 1
_ -> __IMPOSSIBLE__
_ -> __IMPOSSIBLE__
data SigError
= SigUnknown String
| SigAbstract
sigError :: (String -> a) -> a -> SigError -> a
sigError f a = \case
SigUnknown s -> f s
SigAbstract -> a
class (Functor m, Applicative m, Monad m, HasOptions m, MonadDebug m, MonadReader TCEnv m) => HasConstInfo m where
getConstInfo :: QName -> m Definition
getConstInfo q = getConstInfo' q >>= \case
Right d -> return d
Left (SigUnknown err) -> __IMPOSSIBLE_VERBOSE__ err
Left SigAbstract -> __IMPOSSIBLE_VERBOSE__ $
"Abstract, thus, not in scope: " ++ prettyShow q
getConstInfo' :: QName -> m (Either SigError Definition)
getConstInfo' q = Right <$> getConstInfo q
getRewriteRulesFor :: QName -> m RewriteRules
{-# SPECIALIZE getConstInfo :: QName -> TCM Definition #-}
defaultGetRewriteRulesFor :: (Monad m) => m TCState -> QName -> m RewriteRules
defaultGetRewriteRulesFor getTCState q = do
st <- getTCState
let sig = st^.stSignature
imp = st^.stImports
look s = HMap.lookup q $ s ^. sigRewriteRules
return $ mconcat $ catMaybes [look sig, look imp]
getOriginalProjection :: HasConstInfo m => QName -> m QName
getOriginalProjection q = projOrig . fromMaybe __IMPOSSIBLE__ <$> isProjection q
instance HasConstInfo (TCMT IO) where
getRewriteRulesFor = defaultGetRewriteRulesFor get
getConstInfo' q = do
st <- get
env <- ask
defaultGetConstInfo st env q
getConstInfo q = getConstInfo' q >>= \case
Right d -> return d
Left (SigUnknown err) -> fail err
Left SigAbstract -> notInScope $ qnameToConcrete q
defaultGetConstInfo
:: (HasOptions m, MonadDebug m, MonadReader TCEnv m)
=> TCState -> TCEnv -> QName -> m (Either SigError Definition)
defaultGetConstInfo st env q = do
let defs = st^.(stSignature . sigDefinitions)
idefs = st^.(stImports . sigDefinitions)
case catMaybes [HMap.lookup q defs, HMap.lookup q idefs] of
[] -> return $ Left $ SigUnknown $ "Unbound name: " ++ prettyShow q ++ " " ++ showQNameId q
[d] -> mkAbs env d
ds -> __IMPOSSIBLE_VERBOSE__ $ "Ambiguous name: " ++ prettyShow q
where
mkAbs env d
| treatAbstractly' q' env =
case makeAbstract d of
Just d -> return $ Right d
Nothing -> return $ Left SigAbstract
| otherwise = return $ Right d
where
q' = case theDef d of
Constructor{} -> dropLastModule q
_ -> q
dropLastModule q@QName{ qnameModule = m } =
q{ qnameModule = mnameFromList $ ifNull (mnameToList m) __IMPOSSIBLE__ init }
instance HasConstInfo m => HasConstInfo (MaybeT m) where
getConstInfo' = lift . getConstInfo'
getRewriteRulesFor = lift . getRewriteRulesFor
instance HasConstInfo m => HasConstInfo (ExceptT err m) where
getConstInfo' = lift . getConstInfo'
getRewriteRulesFor = lift . getRewriteRulesFor
instance (Monoid w, HasConstInfo m) => HasConstInfo (WriterT w m) where
getConstInfo' = lift . getConstInfo'
getRewriteRulesFor = lift . getRewriteRulesFor
{-# INLINE getConInfo #-}
getConInfo :: MonadTCM tcm => ConHead -> tcm Definition
getConInfo = liftTCM . getConstInfo . conName
getPolarity :: QName -> TCM [Polarity]
getPolarity q = defPolarity <$> getConstInfo q
getPolarity' :: Comparison -> QName -> TCM [Polarity]
getPolarity' CmpEq q = map (composePol Invariant) <$> getPolarity q
getPolarity' CmpLeq q = getPolarity q
setPolarity :: QName -> [Polarity] -> TCM ()
setPolarity q pol = do
reportSLn "tc.polarity.set" 20 $
"Setting polarity of " ++ prettyShow q ++ " to " ++ prettyShow pol ++ "."
modifySignature $ updateDefinition q $ updateDefPolarity $ const pol
getForcedArgs :: QName -> TCM [IsForced]
getForcedArgs q = defForced <$> getConstInfo q
getArgOccurrence :: QName -> Nat -> TCM Occurrence
getArgOccurrence d i = do
def <- getConstInfo d
return $! case theDef def of
Constructor{} -> StrictPos
_ -> fromMaybe Mixed $ defArgOccurrences def !!! i
setArgOccurrences :: QName -> [Occurrence] -> TCM ()
setArgOccurrences d os = modifyArgOccurrences d $ const os
modifyArgOccurrences :: QName -> ([Occurrence] -> [Occurrence]) -> TCM ()
modifyArgOccurrences d f =
modifySignature $ updateDefinition d $ updateDefArgOccurrences f
setTreeless :: QName -> TTerm -> TCM ()
setTreeless q t =
modifyGlobalDefinition q $ updateTheDef $ \case
fun@Function{} -> fun{ funTreeless = Just $ Compiled t [] }
_ -> __IMPOSSIBLE__
setCompiledArgUse :: QName -> [Bool] -> TCM ()
setCompiledArgUse q use =
modifyGlobalDefinition q $ updateTheDef $ \case
fun@Function{} ->
fun{ funTreeless = for (funTreeless fun) $ \ c -> c { cArgUsage = use } }
_ -> __IMPOSSIBLE__
getCompiled :: QName -> TCM (Maybe Compiled)
getCompiled q = do
(theDef <$> getConstInfo q) <&> \case
Function{ funTreeless = t } -> t
_ -> Nothing
getErasedConArgs :: QName -> TCM [Bool]
getErasedConArgs q = do
def <- getConstInfo q
case theDef def of
Constructor{ conData = d, conPars = np, conErased = es } -> return es
_ -> __IMPOSSIBLE__
setErasedConArgs :: QName -> [Bool] -> TCM ()
setErasedConArgs q args = modifyGlobalDefinition q $ updateTheDef $ \case
def@Constructor{} -> def{ conErased = args }
def -> def
getTreeless :: QName -> TCM (Maybe TTerm)
getTreeless q = fmap cTreeless <$> getCompiled q
getCompiledArgUse :: QName -> TCM [Bool]
getCompiledArgUse q = maybe [] cArgUsage <$> getCompiled q
getMutual :: QName -> TCM (Maybe [QName])
getMutual d = getMutual_ . theDef <$> getConstInfo d
getMutual_ :: Defn -> Maybe [QName]
getMutual_ = \case
Function { funMutual = m } -> m
Datatype { dataMutual = m } -> m
Record { recMutual = m } -> m
_ -> Nothing
setMutual :: QName -> [QName] -> TCM ()
setMutual d m = modifySignature $ updateDefinition d $ updateTheDef $ \ def ->
case def of
Function{} -> def { funMutual = Just m }
Datatype{} -> def {dataMutual = Just m }
Record{} -> def { recMutual = Just m }
_ -> if null m then def else __IMPOSSIBLE__
mutuallyRecursive :: QName -> QName -> TCM Bool
mutuallyRecursive d d1 = (d `elem`) . fromMaybe __IMPOSSIBLE__ <$> getMutual d1
definitelyNonRecursive_ :: Defn -> Bool
definitelyNonRecursive_ = maybe False null . getMutual_
getCurrentModuleFreeVars :: TCM Nat
getCurrentModuleFreeVars = size <$> (lookupSection =<< currentModule)
getDefModule :: HasConstInfo m => QName -> m ModuleName
getDefModule f = do
def <- getConstInfo f
return $ case theDef def of
Function{ funExtLam = Just (ExtLamInfo m) } -> m
_ -> qnameModule f
getDefFreeVars :: (Functor m, Applicative m, ReadTCState m, MonadReader TCEnv m) => QName -> m Nat
getDefFreeVars = getModuleFreeVars . qnameModule
freeVarsToApply :: (Functor m, HasConstInfo m, HasOptions m,
ReadTCState m, MonadReader TCEnv m, MonadDebug m)
=> QName -> m Args
freeVarsToApply q = do
vs <- moduleParamsToApply $ qnameModule q
t <- defType <$> getConstInfo q
let TelV tel _ = telView'UpTo (size vs) t
unless (size tel == size vs) __IMPOSSIBLE__
return $ zipWith (\ (Arg _ v) (Dom ai _) -> Arg ai v) vs $ telToList tel
{-# SPECIALIZE getModuleFreeVars :: ModuleName -> TCM Nat #-}
{-# SPECIALIZE getModuleFreeVars :: ModuleName -> ReduceM Nat #-}
getModuleFreeVars :: (Functor m, Applicative m, MonadReader TCEnv m, ReadTCState m)
=> ModuleName -> m Nat
getModuleFreeVars m = do
m0 <- commonParentModule m <$> currentModule
(+) <$> getAnonymousVariables m <*> (size <$> lookupSection m0)
moduleParamsToApply :: (Functor m, Applicative m, HasOptions m,
MonadReader TCEnv m, ReadTCState m, MonadDebug m)
=> ModuleName -> m Args
moduleParamsToApply m = do
reportSLn "tc.sig.param" 90 $ "computing module parameters of " ++ prettyShow m
n <- getModuleFreeVars m
tel <- take n . telToList <$> lookupSection m
sub <- getModuleParameterSub m
verboseS "tc.sig.param" 60 $ do
cxt <- getContext
reportSLn "tc.sig.param" 60 $ unlines $
[ " n = " ++ show n
, " cxt = " ++ show (map (fmap fst) cxt)
, " sub = " ++ show sub
]
unless (size tel == n) __IMPOSSIBLE__
let args = applySubst sub $ zipWith (\ i a -> var i <$ argFromDom a) (downFrom n) tel
reportSLn "tc.sig.param" 60 $ " args = " ++ show args
getSection m >>= \case
Nothing -> do
return args
Just (Section stel) -> do
when (size stel < size args) __IMPOSSIBLE__
return $ zipWith (\ (Dom ai _) (Arg _ v) -> Arg ai v) (telToList stel) args
inFreshModuleIfFreeParams :: TCM a -> TCM a
inFreshModuleIfFreeParams k = do
sub <- getModuleParameterSub =<< currentModule
if sub == IdS then k else do
m <- currentModule
m' <- qualifyM m . mnameFromList . (:[]) <$> freshName_ "_"
addSection m'
withCurrentModule m' k
instantiateDef :: Definition -> TCM Definition
instantiateDef d = do
vs <- freeVarsToApply $ defName d
verboseS "tc.sig.inst" 30 $ do
ctx <- getContext
m <- currentModule
reportSLn "tc.sig.inst" 30 $
"instDef in " ++ prettyShow m ++ ": " ++ prettyShow (defName d) ++ " " ++
unwords (map show $ zipWith (<$) (reverse $ map (fst . unDom) ctx) vs)
return $ d `apply` vs
instantiateRewriteRule :: (Functor m, HasConstInfo m, HasOptions m,
ReadTCState m, MonadReader TCEnv m, MonadDebug m)
=> RewriteRule -> m RewriteRule
instantiateRewriteRule rew = do
traceSLn "rewriting" 60 ("instantiating rewrite rule " ++ show (rewName rew) ++ " to the local context.") $ do
vs <- freeVarsToApply $ rewName rew
let rew' = rew `apply` vs
traceSLn "rewriting" 60 ("instantiated rewrite rule: ") $ do
traceSLn "rewriting" 60 (show rew') $ do
return rew'
instantiateRewriteRules :: (Functor m, HasConstInfo m, HasOptions m,
ReadTCState m, MonadReader TCEnv m, MonadDebug m)
=> RewriteRules -> m RewriteRules
instantiateRewriteRules = mapM instantiateRewriteRule
makeAbstract :: Definition -> Maybe Definition
makeAbstract d =
case defAbstract d of
ConcreteDef -> return d
AbstractDef -> do
def <- makeAbs $ theDef d
return d { defArgOccurrences = []
, defPolarity = []
, theDef = def
}
where
makeAbs Axiom = Just Axiom
makeAbs d@Datatype {} = Just $ AbstractDefn d
makeAbs d@Function {} = Just $ AbstractDefn d
makeAbs Constructor{} = Nothing
makeAbs d@Record{} = Just $ AbstractDefn d
makeAbs Primitive{} = __IMPOSSIBLE__
makeAbs AbstractDefn{}= __IMPOSSIBLE__
{-# SPECIALIZE inAbstractMode :: TCM a -> TCM a #-}
inAbstractMode :: MonadReader TCEnv m => m a -> m a
inAbstractMode = local $ \e -> e { envAbstractMode = AbstractMode,
envAllowDestructiveUpdate = False }
{-# SPECIALIZE inConcreteMode :: TCM a -> TCM a #-}
inConcreteMode :: MonadReader TCEnv m => m a -> m a
inConcreteMode = local $ \e -> e { envAbstractMode = ConcreteMode }
ignoreAbstractMode :: MonadReader TCEnv m => m a -> m a
ignoreAbstractMode = local $ \e -> e { envAbstractMode = IgnoreAbstractMode,
envAllowDestructiveUpdate = False }
{-# SPECIALIZE inConcreteOrAbstractMode :: QName -> (Definition -> TCM a) -> TCM a #-}
inConcreteOrAbstractMode :: (MonadReader TCEnv m, HasConstInfo m) => QName -> (Definition -> m a) -> m a
inConcreteOrAbstractMode q cont = do
def <- ignoreAbstractMode $ getConstInfo q
case defAbstract def of
AbstractDef -> inAbstractMode $ cont def
ConcreteDef -> inConcreteMode $ cont def
treatAbstractly :: MonadReader TCEnv m => QName -> m Bool
treatAbstractly q = asks $ treatAbstractly' q
treatAbstractly' :: QName -> TCEnv -> Bool
treatAbstractly' q env = case envAbstractMode env of
ConcreteMode -> True
IgnoreAbstractMode -> False
AbstractMode -> not $ current == m || current `isSubModuleOf` m
where
current = dropAnon $ envCurrentModule env
m = dropAnon $ qnameModule q
dropAnon (MName ms) = MName $ reverse $ dropWhile isNoName $ reverse ms
typeOfConst :: QName -> TCM Type
typeOfConst q = defType <$> (instantiateDef =<< getConstInfo q)
relOfConst :: QName -> TCM Relevance
relOfConst q = defRelevance <$> getConstInfo q
droppedPars :: Definition -> Int
droppedPars d = case theDef d of
Axiom{} -> 0
def@Function{} -> projectionArgs def
Datatype {dataPars = _} -> 0
Record {recPars = _} -> 0
Constructor{conPars = n} -> n
Primitive{} -> 0
AbstractDefn{} -> __IMPOSSIBLE__
{-# SPECIALIZE isProjection :: QName -> TCM (Maybe Projection) #-}
isProjection :: HasConstInfo m => QName -> m (Maybe Projection)
isProjection qn = isProjection_ . theDef <$> getConstInfo qn
isProjection_ :: Defn -> Maybe Projection
isProjection_ def =
case def of
Function { funProjection = result } -> result
_ -> Nothing
isStaticFun :: Defn -> Bool
isStaticFun = (^. funStatic)
isInlineFun :: Defn -> Bool
isInlineFun = (^. funInline)
isProperProjection :: Defn -> Bool
isProperProjection d = caseMaybe (isProjection_ d) False $ \ isP ->
if projIndex isP <= 0 then False else isJust $ projProper isP
projectionArgs :: Defn -> Int
projectionArgs = maybe 0 (max 0 . pred . projIndex) . isProjection_
usesCopatterns :: QName -> TCM Bool
usesCopatterns q = do
d <- theDef <$> getConstInfo q
return $ case d of
Function{ funCopatternLHS = b } -> b
_ -> False
applyDef :: ProjOrigin -> QName -> Arg Term -> TCM Term
applyDef o f a = do
let fallback = return $ Def f [Apply a]
caseMaybeM (isProjection f) fallback $ \ isP -> do
if projIndex isP <= 0 then fallback else do
if isNothing (projProper isP) then fallback else do
return $ unArg a `applyE` [Proj o $ projOrig isP]