OpDecl.hs revision 1c67beb3720d0b84d8d71ee2012166a09be81fbd
{- |
Module : $Header$
Copyright : (c) Christian Maeder and Uni Bremen 2003
Licence : similar to LGPL, see HetCATS/LICENCE.txt or LIZENZ.txt
Maintainer : maeder@tzi.de
Stability : experimental
Portability : portable
analyse operation declarations
-}
module HasCASL.OpDecl where
import Data.Maybe
import Common.Id
import Common.AS_Annotation
import Common.Lib.State
import Common.Result
import Common.GlobalAnnotations
import HasCASL.As
import HasCASL.VarDecl
import HasCASL.Le
import HasCASL.Unify
import HasCASL.TypeCheck
import HasCASL.MixAna
anaAttr :: GlobalAnnos -> TypeScheme -> OpAttr -> State Env (Maybe OpAttr)
anaAttr ga (TypeScheme tvs (_ :=> ty) _) (UnitOpAttr trm ps) =
do let mTy = case ty of
FunType (ProductType [t1, t2] _) _ t3 _ ->
Just (t1,t2,t3)
FunType t1 _ (FunType t2 _ t3 _) _ ->
Just (t1,t2,t3)
_ -> Nothing
tm <- gets typeMap
mapM_ (addTypeVarDecl False) tvs
case mTy of
Nothing -> do addDiags [mkDiag Error
"unexpected type of operation" ty]
mt <- resolveTerm ga Nothing trm
putTypeMap tm
case mt of
Nothing -> return Nothing
Just t -> return $ Just $ UnitOpAttr t ps
Just (t1, t2, t3) ->
do if t1 == t2 && t2 == t3 then
return ()
else addDiags [mkDiag Error
"unexpected type of operation" ty]
mt <- resolveTerm ga (Just t3) trm
putTypeMap tm
case mt of Nothing -> return Nothing
Just t -> return $ Just $ UnitOpAttr t ps
anaAttr _ _ b = return $ Just b
filterVars :: Assumps -> Assumps
filterVars = filterAssumps (not . isVarDefn)
patternsToType :: [[VarDecl]] -> Type -> Type
patternsToType [] t = t
patternsToType (p: ps) t = FunType (tuplePatternToType p) PFunArr
(patternsToType ps t) []
tuplePatternToType :: [VarDecl] -> Type
tuplePatternToType vds = mkProductType (map ( \ (VarDecl _ t _ _) -> t) vds) []
anaOpItem :: GlobalAnnos -> OpBrand -> OpItem -> State Env OpItem
anaOpItem ga br ods@(OpDecl is sc attr ps) =
do mSc <- anaTypeScheme sc
case mSc of
Nothing -> return ods
Just s -> do
let nSc = generalize s
mAttrs <- mapM (anaAttr ga nSc) attr
us <- mapM (anaOpId br nSc attr) is
return $ OpDecl (catMaybes us) nSc (catMaybes mAttrs) ps
anaOpItem ga br (OpDefn o oldPats sc partial trm ps) =
do let (op@(OpId i _ _), extSc) = getUninstOpId sc o
mSc <- anaTypeScheme extSc
as <- gets assumps
checkUniqueVars $ concat oldPats
putAssumps $ filterVars as
mPats <- mapM (mapM anaVarDecl) oldPats
let newPats = map catMaybes mPats
monoPats = map (map makeMonomorph) newPats
toQualVar (VarDecl v t _ qs) = QualVar v t qs
pats = map (\ l -> mkTupleTerm (map toQualVar l) []) monoPats
case mSc of
Just newSc@(TypeScheme tArgs (qu :=> scTy) qs) -> do
ty <- toEnvState $ freshInst newSc
mapM (mapM addVarDecl) monoPats
mt <- resolveTerm ga (Just ty) trm
putAssumps as
case mt of
Nothing -> return $ OpDefn op newPats
newSc partial trm ps
Just lastTrm -> do
let lastSc = TypeScheme tArgs
(qu :=> patternsToType newPats scTy) qs
lamTrm = case (pats, partial) of
([], Total) -> lastTrm
_ -> LambdaTerm pats partial
lastTrm ps
addOpId i lastSc [] $ Definition br lamTrm
return $ OpDefn op [] lastSc
Total lamTrm ps
Nothing -> do
mt <- resolveTerm ga Nothing trm
putAssumps as
return $ OpDefn op newPats extSc partial
(case mt of Nothing -> trm
Just x -> x) ps
getUninstOpId :: TypeScheme -> OpId -> (OpId, TypeScheme)
getUninstOpId (TypeScheme tvs q ps) (OpId i args qs) =
(OpId i [] qs, TypeScheme (args ++ tvs) q ps)
anaOpId :: OpBrand -> TypeScheme -> [OpAttr] -> OpId -> State Env (Maybe OpId)
anaOpId br sc attrs o =
do let (OpId i _ _, newSc) = getUninstOpId sc o
mo <- addOpId i newSc attrs $ NoOpDefn br
return $ fmap (const o) mo
-- ----------------------------------------------------------------------------
-- ProgEq
-- ----------------------------------------------------------------------------
anaProgEq :: GlobalAnnos -> ProgEq -> State Env ProgEq
anaProgEq ga pe@(ProgEq pat trm qs) =
do as <- gets assumps
putAssumps $ filterVars as
mp <- checkPattern ga pat
case mp of
Nothing -> return pe
Just np -> do
(newPat, exbs) <- extractBindings np
checkUniqueVars exbs
mapM_ addVarDecl exbs
mt <- resolveTerm ga Nothing trm
putAssumps as
case mt of
Just newTerm ->
let (topPat, args) = getApplConstr newPat
defTrm = if null args then newTerm
else LambdaTerm (reverse args)
Partial newTerm []
newPrg = ProgEq newPat newTerm qs
in case topPat of
QualOp _ (InstOpId i _tys _) sc _ -> do
addOpId i sc [] $ Definition Op defTrm
appendSentences [NamedSen ("pe_" ++ showId i "")
$ ProgEqSen i sc newPrg]
return newPrg
_ -> do addDiags $ [mkDiag Error
"illegal toplevel pattern"
topPat]
return pe
_ -> return $ ProgEq newPat trm qs
getApplConstr :: Pattern -> (Pattern, [Pattern])
getApplConstr pat =
case pat of
ApplTerm p1 p2 _ ->
let (tp, args) = getApplConstr p1 in (tp, p2:args)
TypedTerm tp _ _ _ -> getApplConstr tp
_ -> (pat, [])