Sign.hs revision 4e14c1bc2b97679b84c6ad996fa11c273b74ea02
7abd0c58a5ce51db13f93de82407b2188d55d298Christian MaederModule : $Header$
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaederDescription : CASL signatures and local environments for basic analysis
97018cf5fa25b494adffd7e9b4e87320dae6bf47Christian MaederCopyright : (c) Christian Maeder and Uni Bremen 2002-2006
7abd0c58a5ce51db13f93de82407b2188d55d298Christian MaederLicense : GPLv2 or higher, see LICENSE.txt
7abd0c58a5ce51db13f93de82407b2188d55d298Christian MaederMaintainer : Christian.Maeder@dfki.de
7abd0c58a5ce51db13f93de82407b2188d55d298Christian MaederStability : provisional
08faa81d4dd8409cd923b334064f64f802ecc33dChristian MaederPortability : portable
08faa81d4dd8409cd923b334064f64f802ecc33dChristian MaederCASL signatures also serve as local environments for the basic static analysis
e8ffec0fa3d3061061bdc16e44247b9cf96b050fChristian Maederimport qualified Data.Map as Map
f71a8dcf94fd9eb3c9800e16dcdc5e5ff74e5c22Christian Maederimport qualified Data.Set as Set
e8ffec0fa3d3061061bdc16e44247b9cf96b050fChristian Maederimport qualified Common.Lib.MapSet as MapSet
7abd0c58a5ce51db13f93de82407b2188d55d298Christian Maederimport qualified Common.Lib.Rel as Rel
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maederimport qualified Common.Lib.State as State
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederimport Common.Prec (mkPrecIntMap, PrecMap)
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederimport Data.Maybe (fromMaybe)
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederimport Data.List (isPrefixOf)
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederimport Control.Monad (when, unless)
c18e9c3c6d5039618f1f2c05526ece84c7794ea3Christian Maeder-- constants have empty argument lists
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maederdata OpType = OpType {opKind :: OpKind, opArgs :: [SORT], opRes :: SORT}
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder deriving (Show, Eq, Ord)
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder-- | result sort added to argument sorts
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaederopSorts :: OpType -> [SORT]
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaederopSorts o = opRes o : opArgs o
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaedermkTotOpType :: [SORT] -> SORT -> OpType
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaedermkTotOpType = OpType Total
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaedersortToOpType :: SORT -> OpType
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaedersortToOpType = mkTotOpType []
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaederisSingleArgOp :: OpType -> Bool
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaederisSingleArgOp = isSingle . opArgs
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maederdata PredType = PredType {predArgs :: [SORT]} deriving (Show, Eq, Ord)
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaedersortToPredType :: SORT -> PredType
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaedersortToPredType s = PredType [s]
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaederisBinPredType :: PredType -> Bool
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaederisBinPredType (PredType l) = case l of
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder [_, _] -> True
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maedertype OpMap = MapSet.MapSet OP_NAME OpType
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maedertype PredMap = MapSet.MapSet PRED_NAME PredType
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maedertype AnnoMap = MapSet.MapSet Symbol Annotation
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maederdata SymbType = SortAsItemType
7feac39f792f587cffdc8b63b0e7c5a7d2de292eChristian Maeder | SubsortAsItemType SORT -- special symbols for xml output
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder | OpAsItemType OpType
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder {- since symbols do not speak about totality, the totality
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder information in OpType has to be ignored -}
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder | PredAsItemType PredType
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder deriving (Show, Eq, Ord)
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaedersymbolKind :: SymbType -> SYMB_KIND
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaedersymbolKind t = case t of
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder OpAsItemType _ -> Ops_kind
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder PredAsItemType _ -> Preds_kind
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder _ -> Sorts_kind
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederdata Symbol = Symbol {symName :: Id, symbType :: SymbType}
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder deriving (Show, Eq, Ord)
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederinstance GetRange Symbol where
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder getRange = getRange . symName
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder rangeSpan = rangeSpan . symName
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaederidToSortSymbol :: Id -> Symbol
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaederidToSortSymbol idt = Symbol idt SortAsItemType
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaederidToOpSymbol :: Id -> OpType -> Symbol
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaederidToOpSymbol idt = Symbol idt . OpAsItemType
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaederidToPredSymbol :: Id -> PredType -> Symbol
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaederidToPredSymbol idt = Symbol idt . PredAsItemType
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederdummy :: Sign f s -> a -> ()
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederdummy _ _ = ()
36c6cc568751e4235502cfee00ba7b597dae78dcChristian MaederdummyMin :: b -> c -> Result ()
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian MaederdummyMin _ _ = return ()
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maedertype CASLSign = Sign () ()
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder{- | the data type for the basic static analysis to accumulate variables,
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maedersentences, symbols, diagnostics and annotations, that are removed or ignored
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maederwhen looking at signatures from outside, i.e. during logic-independent
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maederprocessing. -}
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maederdata Sign f e = Sign
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder { sortRel :: Rel.Rel SORT
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder -- ^ every sort is a subsort of itself
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder , emptySortSet :: Set.Set SORT
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder -- ^ a subset of the sort set of possibly empty sorts
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder , opMap :: OpMap
94ceeb2edbd25b4697ddd9f63c94377924352cf4Christian Maeder , assocOps :: OpMap -- ^ the subset of associative operators
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder , predMap :: PredMap
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder , varMap :: Map.Map SIMPLE_ID SORT -- ^ temporary variables
c18e9c3c6d5039618f1f2c05526ece84c7794ea3Christian Maeder , sentences :: [Named (FORMULA f)] -- ^ current sentences
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder , declaredSymbols :: Set.Set Symbol -- ^ introduced or redeclared symbols
c18e9c3c6d5039618f1f2c05526ece84c7794ea3Christian Maeder , envDiags :: [Diagnosis] -- ^ diagnostics for basic spec
36c6cc568751e4235502cfee00ba7b597dae78dcChristian Maeder , annoMap :: AnnoMap -- ^ annotated symbols
05e2a3161e4589a717c6fe5c7306820273a473c5Christian Maeder , globAnnos :: GlobalAnnos -- ^ global annotations to use
sortSet :: Sign f e -> Set.Set SORT
sortSet = Rel.keysSet . sortRel
{ sortRel = Rel.empty
, emptySortSet = Set.empty
, opMap = MapSet.empty
, assocOps = MapSet.empty
, predMap = MapSet.empty
, varMap = Map.empty
, declaredSymbols = Set.empty
, annoMap = MapSet.empty
mapFORMULA = mapForm $ error "CASL.mapFORMULA"
subsortsOf :: SORT -> Sign f e -> Set.Set SORT
subsortsOf s e = Rel.predecessors (sortRel e) s
supersortsOf :: SORT -> Sign f e -> Set.Set SORT
supersortsOf s e = Rel.succs (sortRel e) s
eqAndSubsorts :: Bool -> Rel.Rel SORT -> ([[SORT]], [(SORT, [SORT])])
cs = Rel.sccOfClosure srel
in ( filter ((> 1) . length) $ map Set.toList cs
. (if groupSubsorts then Rel.transpose else id)
nsorts = Set.difference (sortSet s) esorts in
(if Set.null nsorts then empty else text (sortS ++ sS) <+>
sepByCommas (map idDoc (Set.toList nsorts))) $+$
(if Set.null esorts then empty else text (esortS ++ sS) <+>
sepByCommas (map idDoc (Set.toList esorts))) $+$
(if Rel.noPairs srel then empty
$+$ printSetMap (text opS) empty (MapSet.toMap $ opMap s)
$+$ printSetMap (text predS) space (MapSet.toMap $ predMap s)
s { sortRel = Rel.transClosure $ sortRel s }
nonEmptySortSet :: Sign f e -> Set.Set Id
nonEmptySortSet s = Set.difference (sortSet s) $ emptySortSet s
makePartial = Set.mapMonotonic mkPartial
let t = makePartial $ Set.filter isTotal s
rmOrAddPartsMap b = MapSet.mapSet (rmOrAddParts b)
diffMapSet = MapSet.difference
diffOpMapSet m = MapSet.difference m . rmOrAddPartsMap False
diffSig dif a b = let s = sortSet a `Set.difference` sortSet b in
{ emptySortSet = Set.difference s
$ nonEmptySortSet a `Set.difference` nonEmptySortSet b
. Rel.transReduce $ sortRel b
, annoMap = annoMap a `MapSet.difference` annoMap b
addOpMapSet m = rmOrAddPartsMap True . MapSet.union m
addMapSet = MapSet.union
addSig ad a b = let s = sortSet a `Set.union` sortSet b in
{ emptySortSet = Set.difference s
$ nonEmptySortSet a `Set.union` nonEmptySortSet b
, sortRel = Rel.union (sortRel a) $ sortRel b
, predMap = MapSet.union (predMap a) $ predMap b
, annoMap = MapSet.union (annoMap a) $ annoMap b
interRel a = Rel.fromSet
. MapSet.intersection (rmOrAddPartsMap False m) . rmOrAddPartsMap False
interMapSet = MapSet.intersection
interSig ef a b = let s = sortSet a `Set.intersection` sortSet b in
{ emptySortSet = Set.difference s
$ nonEmptySortSet a `Set.intersection` nonEmptySortSet b
, annoMap = MapSet.intersection (annoMap a) $ annoMap b
isSubMap = MapSet.isSubmapOf
Rel.isSubrelOf (sortRel a) (sortRel b)
mapSetToList :: MapSet.MapSet a b -> [(a, b)]
mapSetToList = MapSet.toPairList
addDiags :: [Diagnosis] -> State.State (Sign f e) ()
e <- State.get
State.put e { envDiags = reverse ds ++ envDiags e }
addAnnoSet :: Annoted a -> Symbol -> State.State (Sign f e) ()
unless (Set.null v) $ do
e <- State.get
addSymbol :: Symbol -> State.State (Sign f e) ()
e <- State.get
State.put $ addSymbToDeclSymbs e s
cs { declaredSymbols = Set.insert sy $ declaredSymbols cs }
addSort :: SortsKind -> Annoted a -> SORT -> State.State (Sign f e) ()
e <- State.get
known = Rel.memberKey s r
NonEmptySorts -> when (Set.member s em) $ do
e2 <- State.get
e2 <- State.get
| not $ Set.member s $ sortSet e ]
checkSorts :: [SORT] -> State.State (Sign f e) ()
e <- State.get
addSubsort :: SORT -> SORT -> State.State (Sign f e) ()
addSubsortOrIso :: Bool -> SORT -> SORT -> State.State (Sign f e) ()
e <- State.get
$ Rel.insertDiffPair sub super r }
if Rel.path super sub r then
if Rel.path sub super r
else when (Rel.path sub super r)
else if Rel.path super sub r then
if Rel.path sub super r
else when (Rel.path sub super r)
closeSubsortRel :: State.State (Sign f e) ()
do e <- State.get
checkWithMap :: String -> String -> Map.Map Id a -> Id -> [Diagnosis]
checkWithMap s1 s2 m i = if Map.member i m then alsoWarning s1 s2 i else []
checkWithOtherMap :: String -> String -> MapSet.MapSet Id a -> Id -> [Diagnosis]
checkWithOtherMap s1 s2 = checkWithMap s1 s2 . MapSet.toMap
addVars :: VAR_DECL -> State.State (Sign f e) ()
addVar :: SORT -> SIMPLE_ID -> State.State (Sign f e) ()
do e <- State.get
ds = case Map.lookup v m of
addOpTo = MapSet.insert
type VarSet = Set.Set (VAR, SORT)
freeVarsOfExt _ = const Set.empty
cs { sortRel = Rel.insertKey s $ sortRel cs }
addToMap' m n t = MapSet.insert n t m