module Agda.TypeChecking.Monad.Signature where
import Control.Applicative
import Control.Monad.State
import Control.Monad.Reader
import Data.List
import Data.Map (Map)
import qualified Data.Map as Map
import Data.Maybe
import Agda.Syntax.Abstract.Name
import Agda.Syntax.Common
import Agda.Syntax.Internal as I
import Agda.Syntax.Position
import qualified Agda.Compiler.JS.Parser as JS
import Agda.TypeChecking.Monad.Base
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.Substitute
import Agda.TypeChecking.CompiledClause.Compile
import Agda.TypeChecking.Polarity
import Agda.TypeChecking.ProjectionLike
import Agda.Utils.Map as Map
import Agda.Utils.Maybe
import Agda.Utils.Monad
import Agda.Utils.Size
import Agda.Utils.Permutation
import Agda.Utils.Pretty
import qualified Agda.Utils.HashMap as HMap
#include "../../undefined.h"
import Agda.Utils.Impossible
modifySignature :: (Signature -> Signature) -> TCM ()
modifySignature f = modify $ \s -> s { stSignature = f $ stSignature s }
modifyImportedSignature :: (Signature -> Signature) -> TCM ()
modifyImportedSignature f = modify $ \s -> s { stImports = f $ stImports s }
getSignature :: TCM Signature
getSignature = gets stSignature
getImportedSignature :: TCM Signature
getImportedSignature = gets stImports
setSignature :: Signature -> TCM ()
setSignature sig = modifySignature $ const sig
setImportedSignature :: Signature -> TCM ()
setImportedSignature sig = modify $ \s -> s { stImports = sig }
withSignature :: Signature -> TCM a -> TCM a
withSignature sig m =
do sig0 <- getSignature
setSignature sig
r <- m
setSignature sig0
return r
lookupDefinition :: QName -> Signature -> Maybe Definition
lookupDefinition q sig = HMap.lookup q $ sigDefinitions sig
updateDefinition :: QName -> (Definition -> Definition) -> Signature -> Signature
updateDefinition q f sig = sig { sigDefinitions = HMap.adjust f q (sigDefinitions sig) }
updateTheDef :: (Defn -> Defn) -> (Definition -> Definition)
updateTheDef f def = def { theDef = f (theDef def) }
updateDefType :: (Type -> Type) -> (Definition -> Definition)
updateDefType f def = def { defType = f (defType def) }
updateDefArgOccurrences :: ([Occurrence] -> [Occurrence]) -> (Definition -> Definition)
updateDefArgOccurrences f def = def { defArgOccurrences = f (defArgOccurrences def) }
updateDefPolarity :: ([Polarity] -> [Polarity]) -> (Definition -> Definition)
updateDefPolarity f def = def { defPolarity = f (defPolarity def) }
updateDefCompiledRep :: (CompiledRepresentation -> CompiledRepresentation) -> (Definition -> Definition)
updateDefCompiledRep f def = def { defCompiledRep = f (defCompiledRep def) }
updateFunClauses :: ([Clause] -> [Clause]) -> (Defn -> Defn)
updateFunClauses f def@Function{ funClauses = cs} = def { funClauses = f cs }
updateFunClauses f _ = __IMPOSSIBLE__
addConstant :: QName -> Definition -> TCM ()
addConstant q d = do
reportSLn "tc.signature" 20 $ "adding constant " ++ show q ++ " to signature"
tel <- getContextTelescope
let tel' = replaceEmptyName "r" $ killRange $ case theDef d of
Constructor{} -> fmap (setHiding Hidden) tel
_ -> tel
let d' = abstract tel' $ d { defName = q }
reportSLn "tc.signature" 30 $ "lambda-lifted definition = " ++ show d'
modifySignature $ \sig -> sig
{ sigDefinitions = HMap.insertWith (+++) q d' $ sigDefinitions sig }
i <- currentOrFreshMutualBlock
setMutualBlock i q
where
new +++ old = new { defDisplay = defDisplay new ++ defDisplay old }
setTerminates :: QName -> Bool -> TCM ()
setTerminates q b = modifySignature $ updateDefinition q $ updateTheDef $ setT
where
setT def@Function{} = def { funTerminates = Just b }
setT 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
modifyFunClauses q (++ abstract tel cls)
addHaskellCode :: QName -> HaskellType -> HaskellCode -> TCM ()
addHaskellCode q hsTy hsDef = modifySignature $ updateDefinition q $ updateDefCompiledRep $ addHs
where
addHs crep = crep { compiledHaskell = Just $ HsDefn hsTy hsDef }
addHaskellExport :: QName -> HaskellType -> String -> TCM ()
addHaskellExport q hsTy hsName = modifySignature $ updateDefinition q $ updateDefCompiledRep $ addHs
where
addHs crep = crep { exportHaskell = Just (HsExport hsTy hsName)}
addHaskellType :: QName -> HaskellType -> TCM ()
addHaskellType q hsTy = modifySignature $ updateDefinition q $ updateDefCompiledRep $ addHs
where
addHs crep = crep { compiledHaskell = Just $ HsType hsTy }
addEpicCode :: QName -> EpicCode -> TCM ()
addEpicCode q epDef = modifySignature $ updateDefinition q $ updateDefCompiledRep $ addEp
where
addEp crep = crep { compiledEpic = Just epDef }
addJSCode :: QName -> String -> TCM ()
addJSCode q jsDef =
case JS.parse jsDef of
Left e ->
modifySignature $ updateDefinition q $ updateDefCompiledRep $ addJS (Just e)
Right s ->
typeError (CompilationError ("Failed to parse ECMAScript (..." ++ s ++ ") for " ++ show q))
where
addJS e crep = crep { compiledJS = e }
markStatic :: QName -> TCM ()
markStatic q = modifySignature $ updateDefinition q $ mark
where
mark def@Defn{theDef = fun@Function{}} =
def{theDef = fun{funStatic = True}}
mark def = def
unionSignatures :: [Signature] -> Signature
unionSignatures ss = foldr unionSignature emptySignature ss
where
unionSignature (Sig a b) (Sig c d) = Sig (Map.union a c) (HMap.union b d)
addSection :: ModuleName -> Nat -> TCM ()
addSection m fv = do
tel <- getContextTelescope
let sec = Section tel fv
modifySignature $ \sig -> sig { sigSections = Map.insert m sec $ sigSections sig }
lookupSection :: ModuleName -> TCM Telescope
lookupSection m = do
sig <- sigSections <$> getSignature
isig <- sigSections <$> getImportedSignature
return $ maybe EmptyTel secTelescope $ Map.lookup m sig `mplus` Map.lookup m isig
addDisplayForms :: QName -> TCM ()
addDisplayForms x = do
def <- getConstInfo x
args <- getContextArgs
add (drop (projectionArgs $ theDef def) args) x x []
where
add args top x vs0 = do
def <- getConstInfo x
let cs = defClauses def
case cs of
[ Clause{ namedClausePats = pats, clauseBody = b } ]
| all (isVar . namedArg) pats
, Just (m, Def y es) <- strip (b `apply` vs0)
, Just vs <- mapM isApplyElim es -> do
let ps = raise 1 $ map unArg vs
df = Display 0 ps $ DTerm $ Def top $ map Apply args
reportSLn "tc.display.section" 20 $ "adding display form " ++ show y ++ " --> " ++ show top
++ "\n " ++ show df
addDisplayForm y df
add args top y vs
_ -> do
let reason = case cs of
[] -> "no clauses"
_:_:_ -> "many clauses"
[ Clause{ clauseBody = b } ] -> case strip b of
Nothing -> "bad body"
Just (m, Def y es)
| m < length args -> "too few args"
| m > length args -> "too many args"
| otherwise -> "args=" ++ show args ++ " es=" ++ show es
Just (m, v) -> "not a def body"
reportSLn "tc.display.section" 30 $ "no display form from " ++ show x ++ " because " ++ reason
return ()
strip (Body v) = return (0, unSpine v)
strip NoBody = Nothing
strip (Bind b) = do
(n, v) <- strip $ absBody b
return (n + 1, ignoreSharing v)
isVar VarP{} = True
isVar _ = False
applySection
:: ModuleName
-> Telescope
-> ModuleName
-> Args
-> Map QName QName
-> Map ModuleName ModuleName
-> TCM ()
applySection new ptel old ts rd rm = do
sig <- getSignature
isig <- getImportedSignature
let ss = getOld partOfOldM sigSections [sig, isig]
ds = getOldH partOfOldD sigDefinitions [sig, isig]
reportSLn "tc.mod.apply" 10 $ render $ vcat
[ text "applySection"
, text "new =" <+> text (show new)
, text "ptel =" <+> text (show ptel)
, text "old =" <+> text (show old)
, text "ts =" <+> text (show ts)
]
reportSLn "tc.mod.apply" 80 $ "sections: " ++ show ss ++ "\n" ++
"definitions: " ++ show ds
reportSLn "tc.mod.apply" 80 $ render $ vcat
[ text "arguments: " <+> text (show ts)
]
mapM_ (copyDef ts) ds
mapM_ (copySec ts) ss
mapM_ computePolarity (Map.elems rd)
where
getOld partOfOld fromSig sigs =
Map.toList $ Map.filterKeys partOfOld $ Map.unions $ map fromSig sigs
getOldH partOfOld fromSig sigs =
HMap.toList $ HMap.filterWithKey (const . partOfOld) $ HMap.unions $ map fromSig sigs
partOfOldM x = x `isSubModuleOf` old
partOfOldD x = x `isInModule` old
copyName x = Map.findWithDefault x x rd
copyDef :: Args -> (QName, Definition) -> TCM ()
copyDef ts (x, d) =
case Map.lookup x rd of
Nothing -> return ()
Just y -> do
addConstant y =<< nd y
makeProjection y
unless (isCon || size ptel > 0) $ do
addDisplayForms y
where
t = defType d `apply` ts
pol = defPolarity d `apply` ts
occ = defArgOccurrences d `apply` ts
nd y = Defn (defArgInfo d) y t pol occ [] (1) noCompiledRep <$> def
oldDef = theDef d
isCon = case oldDef of { Constructor{} -> True ; _ -> False }
mutual = case oldDef of { Function{funMutual = m} -> m ; _ -> [] }
extlam = case oldDef of { Function{funExtLam = e} -> e ; _ -> Nothing }
with = case oldDef of { Function{funWith = w} -> copyName <$> w ; _ -> Nothing }
proj = case oldDef of
Function{funProjection = Just p@Projection{projIndex = n}} | size ts < n
-> Just $ p { projIndex = n size ts
, projDropPars = projDropPars p `apply` ts
}
_ -> 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, recConType = t, recTel = tel } -> return $
oldDef { recPars = np size ts
, recClause = Just cl
, recConType = apply t ts
, recTel = apply tel ts
}
_ -> do
cc <- compileClauses Nothing [cl]
let newDef = Function
{ funClauses = [cl]
, funCompiled = Just $ cc
, funDelayed = NotDelayed
, funInv = NotInjective
, funMutual = mutual
, funAbstr = ConcreteDef
, funProjection = proj
, funStatic = False
, funCopy = True
, funTerminates = Just True
, funExtLam = extlam
, funWith = with
}
reportSLn "tc.mod.apply" 80 $ "new def for " ++ show x ++ "\n " ++ show newDef
return newDef
head = case oldDef of
Function{funProjection = Just Projection{ projDropPars = f}}
-> f
_ -> Def x []
cl = Clause { clauseRange = getRange $ defClauses d
, clauseTel = EmptyTel
, clausePerm = idP 0
, namedClausePats = []
, clauseBody = Body $ head `apply` ts
, clauseType = Just $ defaultArg t
}
copySec :: Args -> (ModuleName, Section) -> TCM ()
copySec ts (x, sec) = case Map.lookup x rm of
Nothing -> return ()
Just y ->
addCtxTel (apply tel ts) $ addSection y 0
where
tel = secTelescope sec
addDisplayForm :: QName -> DisplayForm -> TCM ()
addDisplayForm x df = do
d <- makeOpen df
modifyImportedSignature (add d)
modifySignature (add d)
where
add df sig = sig { sigDefinitions = HMap.adjust addDf x defs }
where
addDf def = def { defDisplay = df : defDisplay def }
defs = sigDefinitions sig
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 })} -> canonicalName $ extract body
Datatype{dataClause = Just (Clause{ clauseBody = body })} -> canonicalName $ extract body
_ -> return x
where
extract NoBody = __IMPOSSIBLE__
extract (Body (Def x _)) = x
extract (Body (Shared p)) = extract (Body $ derefPtr p)
extract (Body _) = __IMPOSSIBLE__
extract (Bind b) = extract (unAbs b)
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 :: QName -> TCM Induction
whatInduction c = do
def <- theDef <$> getConstInfo c
case def of
Datatype{ dataInduction = i } -> return i
Record{ recRecursive = False} -> return Inductive
Record{ recInduction = i } -> return 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__
class (Functor m, Applicative m, Monad m) => HasConstInfo m where
getConstInfo :: QName -> m Definition
instance HasConstInfo (TCMT IO) where
getConstInfo q = join $ pureTCM $ \st env ->
let defs = sigDefinitions $ stSignature st
idefs = sigDefinitions $ stImports st
in case catMaybes [HMap.lookup q defs, HMap.lookup q idefs] of
[] -> fail $ "Unbound name: " ++ show q ++ " " ++ showQNameId q
[d] -> mkAbs env d
ds -> fail $ "Ambiguous name: " ++ show q
where
mkAbs env d
| treatAbstractly' q' env =
case makeAbstract d of
Just d -> return d
Nothing -> notInScope $ qnameToConcrete q
| otherwise = return d
where
q' = case theDef d of
Constructor{} -> dropLastModule q
_ -> q
dropLastModule q@QName{ qnameModule = m } =
q{ qnameModule = mnameFromList $ init' $ mnameToList m }
init' [] = __IMPOSSIBLE__
init' xs = init xs
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 = modifySignature $ updateDefinition q $ updateDefPolarity $ const pol
getArgOccurrences :: QName -> TCM [Occurrence]
getArgOccurrences d = defArgOccurrences <$> getConstInfo d
getArgOccurrence :: QName -> Nat -> TCM Occurrence
getArgOccurrence d i = do
def <- getConstInfo d
return $ case theDef def of
Constructor{} -> StrictPos
_ -> (defArgOccurrences def ++ repeat Mixed) !! i
setArgOccurrences :: QName -> [Occurrence] -> TCM ()
setArgOccurrences d os =
modifySignature $ updateDefinition d $ updateDefArgOccurrences $ const os
getMutual :: QName -> TCM [QName]
getMutual d = do
def <- theDef <$> getConstInfo d
return $ case def of
Function { funMutual = m } -> m
Datatype { dataMutual = m } -> m
Record { recMutual = m } -> m
_ -> []
setMutual :: QName -> [QName] -> TCM ()
setMutual d m = modifySignature $ updateDefinition d $ updateTheDef $ \ def ->
case def of
Function{} -> def { funMutual = m }
Datatype{} -> def {dataMutual = m }
Record{} -> def { recMutual = m }
_ -> __IMPOSSIBLE__
mutuallyRecursive :: QName -> QName -> TCM Bool
mutuallyRecursive d d' = (d `elem`) <$> getMutual d'
getSecFreeVars :: ModuleName -> TCM Nat
getSecFreeVars m = do
sig <- sigSections <$> getSignature
isig <- sigSections <$> getImportedSignature
top <- currentModule
case top `isSubModuleOf` m || top == m of
True -> return $ maybe 0 secFreeVars $
Map.lookup m sig <|> Map.lookup m isig
False -> return 0
getModuleFreeVars :: ModuleName -> TCM Nat
getModuleFreeVars m = sum <$> ((:) <$> getAnonymousVariables m <*> mapM getSecFreeVars ms)
where
ms = map mnameFromList . inits . mnameToList $ m
getDefFreeVars :: QName -> TCM Nat
getDefFreeVars q = getModuleFreeVars (qnameModule q)
freeVarsToApply :: QName -> TCM Args
freeVarsToApply x = genericTake <$> getDefFreeVars x <*> getContextArgs
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 " ++ show m ++ ": " ++ show (defName d) ++ " " ++
unwords (map show . take (size vs) . reverse . map (fst . unDom) $ ctx)
return $ d `apply` vs
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 Datatype {} = Just Axiom
makeAbs Function {} = Just Axiom
makeAbs Constructor{} = Nothing
makeAbs d@Record{} = Just Axiom
makeAbs d = Just d
inAbstractMode :: TCM a -> TCM a
inAbstractMode = local $ \e -> e { envAbstractMode = AbstractMode,
envAllowDestructiveUpdate = False }
inConcreteMode :: TCM a -> TCM a
inConcreteMode = local $ \e -> e { envAbstractMode = ConcreteMode }
ignoreAbstractMode :: MonadReader TCEnv m => m a -> m a
ignoreAbstractMode = local $ \e -> e { envAbstractMode = IgnoreAbstractMode,
envAllowDestructiveUpdate = False }
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 = envCurrentModule env
m = qnameModule q
typeOfConst :: QName -> TCM Type
typeOfConst q = defType <$> (instantiateDef =<< getConstInfo q)
relOfConst :: QName -> TCM Relevance
relOfConst q = defRelevance <$> getConstInfo q
colOfConst :: QName -> TCM [Color]
colOfConst q = defColors <$> getConstInfo q
sortOfConst :: QName -> TCM Sort
sortOfConst q =
do d <- theDef <$> getConstInfo q
case d of
Datatype{dataSort = s} -> return s
_ -> fail $ "Expected " ++ show q ++ " to be a datatype."
isProjection :: QName -> TCM (Maybe Projection)
isProjection qn = isProjection_ . theDef <$> getConstInfo qn
isProjection_ :: Defn -> Maybe Projection
isProjection_ def =
case def of
Function { funProjection = result } -> result
_ -> Nothing
isProperProjection :: Defn -> Bool
isProperProjection = isJust . (projProper <=< isProjection_)
projectionArgs :: Defn -> Int
projectionArgs = maybe 0 (pred . projIndex) . isProjection_
applyDef :: QName -> I.Arg Term -> TCM Term
applyDef f a = do
res <- (projProper =<<) <$> isProjection f
case res of
Nothing -> return $ Def f [Apply a]
Just f' -> return $ unArg a `applyE` [Proj f']
getDefType :: QName -> Type -> TCM (Maybe Type)
getDefType f t = do
def <- getConstInfo f
let a = defType def
caseMaybe (isProjection_ $ theDef def) (return $ Just a) $
\ (Projection{ projIndex = n }) -> do
let npars | n == 0 = __IMPOSSIBLE__
| otherwise = n 1
case ignoreSharing $ unEl t of
Def d es -> do
flip (ifM $ eligibleForProjectionLike d) (return Nothing) $ do
let pars = fromMaybe __IMPOSSIBLE__ $ allApplyElims $ take npars es
return $ Just $ a `apply` pars
_ -> return Nothing