0N/A{- |

1472N/AModule : $Header$

0N/ADescription : static analysis of heterogeneous structured specifications

0N/ACopyright : (c) Till Mossakowski and Uni Bremen 2003-2006

0N/ALicense : similar to LGPL, see HetCATS/LICENSE.txt or LIZENZ.txt

0N/AMaintainer : till@informatik.uni-bremen.de

0N/AStability : provisional

0N/APortability : non-portable (imports Logic.Grothendieck)

0N/A

0N/AStatic analysis of CASL (heterogeneous) structured specifications

0N/A Follows the verfication semantic rules in Chap. IV:4.7

0N/A of the CASL Reference Manual.

0N/A-}

0N/A

0N/Amodule Static.AnalysisStructured

0N/A ( anaSpec

0N/A , anaSpecTop

0N/A , anaUnion

1472N/A , getSpecAnnos

1472N/A , isStructured

1472N/A , anaRenaming

0N/A , anaRestriction

0N/A , homogenizeGM

0N/A , anaGmaps

0N/A , insGSig

0N/A , insLink

0N/A , extendMorphism

0N/A , insGTheory

0N/A ) where

0N/A

0N/Aimport Driver.Options

0N/A

0N/Aimport Logic.Logic

0N/Aimport Logic.ExtSign

0N/Aimport Logic.Coerce

0N/Aimport Logic.Comorphism

0N/Aimport Logic.Grothendieck

0N/Aimport Logic.Prover

0N/A

0N/Aimport Static.DevGraph

0N/Aimport Static.GTheory

0N/A

0N/Aimport Syntax.AS_Structured

0N/A

0N/Aimport Common.AS_Annotation hiding (isAxiom, isDef)

0N/Aimport Common.DocUtils

0N/Aimport Common.ExtSign

0N/Aimport Common.Id

0N/Aimport Common.Result

0N/Aimport Common.Utils (number)

0N/Aimport qualified Common.Lib.Rel as Rel (image, setInsert)

0N/A

0N/Aimport Data.Graph.Inductive.Graph as Graph (Node)

0N/Aimport qualified Data.Set as Set

0N/Aimport qualified Data.Map as Map

0N/Aimport Data.Maybe

0N/Aimport Data.List (find)

0N/A

0N/Aimport Control.Monad

0N/A

0N/AcoerceMaybeNode :: LogicGraph -> DGraph -> MaybeNode -> NodeName -> AnyLogic

0N/A -> Result (MaybeNode, DGraph)

0N/AcoerceMaybeNode lg dg mn nn l2 = case mn of

0N/A EmptyNode _ -> return (EmptyNode l2, dg)

0N/A JustNode ns -> do

0N/A (ms, dg2) <- coerceNode lg dg ns nn l2

0N/A return (JustNode ms, dg2)

0N/A

0N/AcoerceNode :: LogicGraph -> DGraph -> NodeSig -> NodeName -> AnyLogic

0N/A -> Result (NodeSig, DGraph)

0N/AcoerceNode lg dg ns@(NodeSig n s@(G_sign lid1 _ _)) nn l2@(Logic lid2) =

0N/A if language_name lid1 == language_name lid2 then return (ns, dg)

0N/A else do

0N/A c <- logicInclusion lg (Logic lid1) l2

0N/A gmor <- gEmbedComorphism c s

0N/A case find (\ (_, _, l) -> dgl_origin l == SeeTarget

0N/A && dgl_type l == globalDef

0N/A && dgl_morphism l == gmor) $ outDG dg n of

0N/A Nothing -> do

0N/A let (ms@(NodeSig m _), dg2) =

0N/A insGSig dg (extName "XCoerced" nn) DGTranslation $ cod gmor

0N/A dg3 = insLink dg2 gmor globalDef SeeTarget n m

0N/A return (ms, dg3)

0N/A Just (_, t, _) ->

0N/A return (NodeSig t $ signOf $ dgn_theory $ labDG dg t, dg)

0N/A

0N/AinsGTheory :: DGraph -> NodeName -> DGOrigin -> G_theory -> (NodeSig, DGraph)

0N/AinsGTheory dg name orig (G_theory lid sig ind sens tind) =

0N/A let (sgMap, s) = sigMapI dg

0N/A (tMap, t) = thMapI dg

0N/A nind = if ind == startSigId then succ s else ind

0N/A tb = tind == startThId && not (Map.null sens)

0N/A ntind = if tb then succ t else tind

0N/A nsig = G_sign lid sig nind

0N/A nth = G_theory lid sig nind sens ntind

0N/A node_contents = newNodeLab name orig nth

0N/A node = getNewNodeDG dg

0N/A in (NodeSig node nsig,

0N/A (if tb then setThMapDG $ Map.insert (succ t) nth tMap else id) $

0N/A (if ind == startSigId

0N/A then setSigMapDG $ Map.insert (succ s) nsig sgMap else id)

0N/A $ insNodeDG (node, node_contents) dg)

0N/A

0N/AinsGSig :: DGraph -> NodeName -> DGOrigin -> G_sign -> (NodeSig, DGraph)

0N/AinsGSig dg name orig (G_sign lid sig ind) =

0N/A insGTheory dg name orig $ noSensGTheory lid sig ind

0N/A

0N/AinsLink :: DGraph -> GMorphism -> DGLinkType -> DGLinkOrigin -> Node -> Node

0N/A -> DGraph

0N/AinsLink dg (GMorphism cid sign si mor mi) ty orig n t =

0N/A let (sgMap, s) = sigMapI dg

0N/A (mrMap, m) = morMapI dg

0N/A nsi = if si == startSigId then succ s else si

0N/A nmi = if mi == startMorId then succ m else mi

0N/A nmor = GMorphism cid sign nsi mor nmi

0N/A link = DGLink

0N/A { dgl_morphism = nmor

0N/A , dgl_type = ty

0N/A , dgl_origin = orig

0N/A , dgl_id = defaultEdgeId }

0N/A in (if mi == startMorId then setMorMapDG $ Map.insert (succ m)

0N/A (toG_morphism nmor) mrMap else id) $

0N/A (if si == startSigId then setSigMapDG $ Map.insert (succ s)

0N/A (G_sign (sourceLogic cid) sign nsi) sgMap else id)

0N/A $ insLEdgeNubDG (n, t, link) dg

0N/A

0N/AcreateConsLink :: LinkKind -> Conservativity -> LogicGraph -> DGraph

0N/A -> MaybeNode -> NodeSig -> DGLinkOrigin -> Result DGraph

0N/AcreateConsLink lk conser lg dg nsig (NodeSig node gsig) orig = case nsig of

0N/A EmptyNode _ | conser == None -> return dg

0N/A _ -> case nsig of

0N/A JustNode (NodeSig n sig)-> do

0N/A let Result _ mIncl = ginclusion lg sig gsig

1601N/A case mIncl of

1601N/A Just incl ->

1601N/A return $ insLink dg incl

0N/A (ScopedLink Global lk $ mkConsStatus conser) orig n node

0N/A Nothing -> do

0N/A unless (conser == None) $ warning ()

0N/A "ingoring conservativity annotation between non-subsignatures"

0N/A nullRange

0N/A return dg

0N/A EmptyNode _ -> -- add conservativity to the target node

0N/A return $ let lbl = labDG dg node

0N/A in if isDGRef lbl then dg else

0N/A fst $ labelNodeDG

0N/A (node, lbl

0N/A { nodeInfo =

0N/A (nodeInfo lbl)

0N/A { node_cons_status = case getNodeConsStatus lbl of

0N/A ConsStatus c d th -> ConsStatus (max c conser) d th }}) dg

0N/A

0N/AanaSpecTop :: Conservativity -> Bool -> LogicGraph -> DGraph -> MaybeNode

0N/A -> NodeName -> HetcatsOpts -> SPEC -> Result (SPEC, NodeSig, DGraph)

0N/AanaSpecTop conser addSyms lg dg nsig name opts sp =

0N/A if conser == None || case sp of

0N/A -- for these cases def-links are re-used

0N/A Basic_spec _ _ -> True

0N/A Closed_spec _ _ -> True

0N/A Spec_inst _ _ _ -> True

0N/A Group _ _ -> True -- in this case we recurse

0N/A _ -> False

0N/A then anaSpecAux conser addSyms lg dg nsig name opts sp else do

0N/A let provenThmLink =

0N/A ThmLink $ Proven (DGRule "static analysis") emptyProofBasis

0N/A (rsp, ns, rdg) <- anaSpec addSyms lg dg nsig name opts sp

0N/A ndg <- createConsLink provenThmLink conser lg rdg nsig ns SeeTarget

0N/A return (rsp, ns, ndg)

0N/A

0N/AanaQualSpec :: Bool -> LogicGraph -> HetcatsOpts -> DGraph

0N/A -> MaybeNode -> NodeName -> Annoted SPEC -> Range

0N/A -> Result (Annoted SPEC, NodeSig, DGraph)

0N/AanaQualSpec addSyms lg opts dg nsig name asp pos = do

0N/A (sp', NodeSig n' gsigma, dg') <-

0N/A anaSpec addSyms lg dg nsig (extName "Qualified" name) opts $ item asp

0N/A let (ns@(NodeSig node gsigma'), dg2) =

0N/A insGSig dg' name DGLogicQual gsigma

0N/A incl <- adjustPos pos $ ginclusion lg gsigma gsigma'

0N/A return (replaceAnnoted sp' asp, ns,

0N/A insLink dg2 incl globalDef SeeTarget n' node)

0N/A

0N/AanaFreeOrCofreeSpec :: Bool -> LogicGraph -> HetcatsOpts -> DGraph

0N/A -> MaybeNode -> NodeName -> FreeOrCofree -> Annoted SPEC -> Range

0N/A -> Result (Annoted SPEC, NodeSig, DGraph)

0N/AanaFreeOrCofreeSpec addSyms lg opts dg nsig name dglType asp pos = do

1145N/A (sp', NodeSig n' gsigma, dg') <-

1145N/A anaSpec addSyms lg dg nsig (extName (show dglType) name) opts

1145N/A $ item asp

1145N/A let (ns@(NodeSig node gsigma'), dg2) =

1145N/A insGSig dg' name (DGFreeOrCofree dglType) gsigma

1145N/A nsigma <- return $ case nsig of

0N/A EmptyNode cl -> emptyG_sign cl

0N/A JustNode nds -> getSig nds

0N/A incl <- adjustPos pos $ ginclusion lg nsigma gsigma'

0N/A return (replaceAnnoted sp' asp, ns,

0N/A insLink dg2 incl (FreeOrCofreeDefLink dglType nsig)

0N/A SeeTarget n' node)

0N/A

0N/A-- | analyze a SPEC

0N/A-- Bool Parameter determines if incoming symbols shall be ignored

0N/A-- options: here we need the info: shall only the structure be analysed?

0N/AanaSpec :: Bool -> LogicGraph -> DGraph -> MaybeNode -> NodeName

0N/A -> HetcatsOpts -> SPEC -> Result (SPEC, NodeSig, DGraph)

0N/AanaSpec = anaSpecAux None

0N/A

0N/AanaSpecAux :: Conservativity -> Bool -> LogicGraph -> DGraph -> MaybeNode

0N/A -> NodeName -> HetcatsOpts -> SPEC -> Result (SPEC, NodeSig, DGraph)

0N/AanaSpecAux conser addSyms lg dg nsig name opts sp = case sp of

0N/A Basic_spec (G_basic_spec lid bspec) pos -> adjustPos pos $ do

0N/A let curLogic = Logic lid

0N/A (nsig', dg0) <- coerceMaybeNode lg dg nsig name curLogic

0N/A G_sign lid' sigma' _ <- return $ case nsig' of

0N/A EmptyNode cl -> emptyG_sign cl

0N/A JustNode ns -> getSig ns

0N/A ExtSign sig sys <-

0N/A coerceSign lid' lid "Analysis of basic spec" sigma'

0N/A (bspec', ExtSign sigma_complete sysd, ax) <-

0N/A if isStructured opts

0N/A then return (bspec, mkExtSign $ empty_signature lid, [])

0N/A else do

0N/A b <- maybeToMonad

0N/A ("no basic analysis for logic " ++ language_name lid)

0N/A (basic_analysis lid)

0N/A b (bspec, sig, globalAnnos dg0)

0N/A let gsysd = Set.map (G_symbol lid) sysd

0N/A (ns, dg') = insGTheory dg0 name (DGBasicSpec gsysd)

0N/A $ G_theory lid (ExtSign sigma_complete

0N/A $ Set.intersection

0N/A (if addSyms then Set.union sys sysd else sysd)

0N/A $ sym_of lid sigma_complete) startSigId (toThSens ax) startThId

0N/A dg'' <- createConsLink DefLink conser lg dg' nsig' ns DGLinkExtension

0N/A return (Basic_spec (G_basic_spec lid bspec') pos, ns, dg'')

0N/A EmptySpec pos -> case nsig of

0N/A EmptyNode _ -> do

0N/A warning () "empty spec" pos

0N/A let (ns, dg') = insGSig dg name DGEmpty (getMaybeSig nsig)

0N/A return (sp, ns, dg')

0N/A {- anaSpec should be changed to return a MaybeNode!

0N/A Then this duplicate dummy node could be avoided.

0N/A Also empty unions could be treated then -}

0N/A JustNode ns -> return (sp, ns ,dg)

0N/A Translation asp ren ->

0N/A do let sp1 = item asp

0N/A (sp1', NodeSig n' gsigma, dg') <-

0N/A anaSpec addSyms lg dg nsig (extName "Translation" name) opts sp1

0N/A mor <- anaRenaming lg nsig gsigma opts ren

0N/A -- ??? check that mor is identity on local env

0N/A let (ns@(NodeSig node _), dg'') =

0N/A insGSig dg' name DGTranslation $ cod mor

0N/A -- ??? too simplistic for non-comorphism inter-logic translations

0N/A return (Translation (replaceAnnoted sp1' asp) ren, ns,

0N/A insLink dg'' mor globalDef SeeTarget n' node)

0N/A Reduction asp restr ->

0N/A do let sp1 = item asp

0N/A (sp1', NodeSig n' gsigma', dg') <-

0N/A anaSpec addSyms lg dg nsig (extName "Restriction" name) opts sp1

0N/A let gsigma = getMaybeSig nsig

0N/A (hmor, tmor) <- anaRestriction gsigma gsigma' opts restr

0N/A -- we treat hiding and revealing differently

0N/A -- in order to keep the dg as simple as possible

0N/A case tmor of

0N/A Nothing ->

0N/A do let (ns@(NodeSig node _), dg'') =

0N/A insGSig dg' name DGHiding $ dom hmor

0N/A -- ??? too simplistic for non-comorphism inter-logic reductions

0N/A return (Reduction (replaceAnnoted sp1' asp) restr, ns,

0N/A insLink dg'' hmor HidingDefLink SeeTarget n' node)

0N/A Just tmor' -> do

0N/A let gsigma1 = dom tmor'

0N/A gsigma'' = cod tmor'

0N/A -- ??? too simplistic for non-comorphism inter-logic reductions

0N/A -- the case with identity translation leads to a simpler dg

0N/A if tmor' == ide (dom tmor')

0N/A then do

0N/A let (ns@(NodeSig node1 _), dg'') =

0N/A insGSig dg' name DGRevealing gsigma1

0N/A return (Reduction (replaceAnnoted sp1' asp) restr, ns,

0N/A insLink dg'' hmor HidingDefLink SeeTarget n' node1)

0N/A else do

0N/A let (NodeSig node1 _, dg'') =

0N/A insGSig dg' (extName "Revealing" name) DGRevealing gsigma1

0N/A (ns@(NodeSig node2 _), dg3) =

0N/A insGSig dg'' name DGRevealTranslation gsigma''

0N/A dg4 = insLink dg3 hmor HidingDefLink SeeTarget n' node1

0N/A return (Reduction (replaceAnnoted sp1' asp) restr, ns,

0N/A insLink dg4 tmor' globalDef SeeTarget node1 node2)

0N/A Union asps pos -> do

0N/A (newAsps, _, ns, dg') <- adjustPos pos $ anaUnion addSyms lg dg nsig

0N/A name opts asps

0N/A return (Union newAsps pos, ns, dg')

0N/A Extension asps pos -> do

0N/A let namedSps = map (\ (asp, n) ->

0N/A let nn = incBy n (extName "Extension" name) in

0N/A if n < length asps then (nn, asp)

0N/A else (name { xpath = xpath nn }, asp)) $ number asps

0N/A (sps', nsig1', dg1, _, _) <- foldM (anaExtension lg opts pos)

0N/A ([], nsig, dg, conser, addSyms) namedSps

0N/A case nsig1' of

0N/A EmptyNode _ -> fail "empty extension"

0N/A JustNode nsig1 -> return (Extension (zipWith replaceAnnoted

0N/A (reverse sps') asps)

0N/A pos, nsig1,dg1)

0N/A Free_spec asp poss -> do

0N/A (nasp, nsig', dg') <- anaFreeOrCofreeSpec addSyms lg opts dg nsig name

0N/A Free asp poss

113N/A return (Free_spec nasp poss, nsig', dg')

0N/A Cofree_spec asp poss -> do

0N/A (nasp, nsig', dg') <- anaFreeOrCofreeSpec addSyms lg opts dg nsig name

0N/A Cofree asp poss

0N/A return (Cofree_spec nasp poss, nsig', dg')

0N/A Local_spec asp asp' poss -> adjustPos poss $ do

0N/A let sp1 = item asp

0N/A sp1' = item asp'

0N/A lname = extName "Local" name

0N/A (sp2, nsig'@(NodeSig _ (G_sign lid' sigma' _)), dg') <-

0N/A anaSpec False lg dg nsig (extName "Spec" lname) opts sp1

0N/A (sp2', NodeSig n'' (G_sign lid'' sigma'' _), dg'') <-

0N/A anaSpec False lg dg' (JustNode nsig') (extName "Within" lname) opts sp1'

0N/A let gsigma = getMaybeSig nsig

0N/A G_sign lid sigma _ <- return gsigma

0N/A sigma1 <- coerceSign lid' lid "Analysis of local spec" sigma'

0N/A sigma2 <- coerceSign lid'' lid "Analysis of local spec" sigma''

0N/A let sys = ext_sym_of lid sigma

0N/A sys1 = ext_sym_of lid sigma1

0N/A sys2 = ext_sym_of lid sigma2

0N/A mor3 <- if isStructured opts then return (ext_ide sigma2)

0N/A else ext_cogenerated_sign lid

0N/A (sys1 `Set.difference` sys) sigma2

0N/A let sigma3 = dom mor3

0N/A -- gsigma2 = G_sign lid sigma2

0N/A gsigma3 = G_sign lid (makeExtSign lid sigma3) startSigId

0N/A sys3 = sym_of lid sigma3

0N/A unless (isStructured opts

0N/A || sys2 `Set.difference` sys1 `Set.isSubsetOf` sys3)

0N/A $ plain_error () (

0N/A "illegal use of locally declared symbols: "

0N/A ++ showDoc ((sys2 `Set.intersection` sys1) `Set.difference` sys3) "")

0N/A poss

0N/A let (ns@(NodeSig node _), dg2) = insGSig dg'' name DGLocal gsigma3

0N/A return (Local_spec (replaceAnnoted sp2 asp)

0N/A (replaceAnnoted sp2' asp')

0N/A poss, ns,

0N/A insLink dg2 (gEmbed2 gsigma3 $ mkG_morphism lid mor3)

0N/A HidingDefLink SeeTarget n'' node)

0N/A Closed_spec asp pos -> adjustPos pos $ do

0N/A let sp1 = item asp

0N/A l = getLogic nsig

0N/A -- analyse spec with empty local env

0N/A (sp', NodeSig n' gsigma', dg') <- -- choose a unique starting letter

0N/A anaSpec False lg dg (EmptyNode l) (extName "Closed" name) opts sp1

0N/A let gsigma = getMaybeSig nsig

0N/A gsigma'' <- gsigUnion lg gsigma gsigma'

0N/A let (ns@(NodeSig node gsigma2), dg2) = insGSig dg' name DGClosed gsigma''

0N/A incl2 <- ginclusion lg gsigma' gsigma2

0N/A let dg3 = insLink dg2 incl2 globalDef SeeTarget n' node

0N/A dg4 <- createConsLink DefLink conser lg dg3 nsig ns DGLinkClosedLenv

0N/A return (Closed_spec (replaceAnnoted sp' asp) pos, ns, dg4)

0N/A Qualified_spec lognm@(Logic_name ln _) asp pos -> do

0N/A let newLG = lg { currentLogic = tokStr ln }

0N/A l <- lookupCurrentLogic "Qualified_spec" newLG

0N/A let newNSig = case nsig of

0N/A EmptyNode _ -> EmptyNode l

0N/A _ -> nsig

0N/A (nasp, nsig', dg') <-

0N/A anaQualSpec addSyms lg opts dg newNSig name asp pos

0N/A return (Qualified_spec lognm nasp pos, nsig', dg')

0N/A Group asp pos -> do

0N/A (sp', nsig', dg') <-

0N/A anaSpecTop conser addSyms lg dg nsig name opts (item asp)

0N/A return (Group (replaceAnnoted sp' asp) pos, nsig', dg')

0N/A Spec_inst spname afitargs pos0 -> let

0N/A pos = if null afitargs then tokPos spname else pos0

0N/A spstr = tokStr spname

0N/A in adjustPos pos $ case lookupGlobalEnvDG spname dg of

0N/A Just (SpecEntry gs@(ExtGenSig (GenSig _ params _)

0N/A body@(NodeSig nB gsigmaB))) ->

0N/A case (\ x y -> (x , x - y)) (length afitargs) (length params) of

0N/A -- the case without parameters leads to a simpler dg

0N/A (0, 0) -> case nsig of

0N/A -- if the node shall not be named and the logic does not change,

0N/A EmptyNode _ | isInternal name -> do

0N/A dg2 <- createConsLink DefLink conser lg dg nsig body SeeTarget

0N/A -- then just return the body

0N/A return (sp, body, dg2)

0N/A -- otherwise, we need to create a new one

0N/A _ -> do

263N/A gsigma <- case nsig of

263N/A EmptyNode _ -> return gsigmaB

263N/A JustNode (NodeSig _ sig) -> gsigUnion lg sig gsigmaB

0N/A let (fsig@(NodeSig node gsigma'), dg2) =

0N/A insGSig dg name (DGSpecInst spname) gsigma

0N/A incl <- ginclusion lg gsigmaB gsigma'

0N/A let dg3 = insLink dg2 incl globalDef SeeTarget nB node

0N/A dg4 <- createConsLink DefLink conser lg dg3 nsig fsig SeeTarget

0N/A return (sp, fsig, dg4)

0N/A -- now the case with parameters

0N/A (_, 0) -> do

0N/A (ffitargs, dg', (morDelta, gsigmaA, ns@(NodeSig nA gsigmaRes))) <-

0N/A anaAllFitArgs lg opts dg nsig name spname gs afitargs

0N/A GMorphism cid _ _ _ _ <- return morDelta

0N/A morDelta' <- case nsig of

0N/A EmptyNode _ -> return morDelta

0N/A _ -> ginclusion lg gsigmaA gsigmaRes >>= comp morDelta

0N/A (_, imor) <- gSigCoerce lg gsigmaB $ Logic $ sourceLogic cid

0N/A tmor <- gEmbedComorphism imor gsigmaB

0N/A morDelta'' <- comp tmor morDelta'

0N/A let dg4 = insLink dg' morDelta'' globalDef SeeTarget nB nA

0N/A dg5 <- createConsLink DefLink conser lg dg4 nsig ns SeeTarget

0N/A return (Spec_inst spname ffitargs pos, ns, dg5)

0N/A -- finally the case with conflicting numbers of formal and actual parameters

0N/A _ ->

0N/A fatal_error

0N/A (spstr ++ " expects " ++ show (length params) ++ " arguments"

0N/A ++ " but was given " ++ show (length afitargs)) pos

0N/A _ -> fatal_error

0N/A ("Structured specification " ++ spstr ++ " not found") pos

0N/A

0N/A -- analyse "data SPEC1 SPEC2"

0N/A Data (Logic lidD) (Logic lidP) asp1 asp2 pos -> adjustPos pos $ do

0N/A let sp1 = item asp1

0N/A sp2 = item asp2

0N/A -- look for the inclusion comorphism from the current logic's data logic

0N/A -- into the current logic itself

0N/A Comorphism cid <- logicInclusion lg (Logic lidD) (Logic lidP)

0N/A let lidD' = sourceLogic cid

0N/A lidP' = targetLogic cid

0N/A dname = extName "Data" name

0N/A -- analyse SPEC1

0N/A (sp1', NodeSig n' (G_sign lid' sigma' _), dg') <-

0N/A anaSpec False lg dg (EmptyNode (Logic lidD)) dname opts sp1

0N/A -- force the result to be in the data logic

0N/A sigmaD <- coerceSign lid' lidD' "Analysis of data spec" sigma'

0N/A -- translate SPEC1's signature along the comorphism

0N/A (sigmaD', sensD') <- ext_map_sign cid sigmaD

0N/A -- create a development graph link for this translation

0N/A let (nsig2@(NodeSig node _), dg1) = insGTheory dg' dname DGData

0N/A $ G_theory lidP' sigmaD' startSigId (toThSens sensD') startThId

0N/A dg2 = insLink dg1 (GMorphism cid sigmaD startSigId

0N/A (ext_ide sigmaD') startMorId)

0N/A globalDef SeeTarget n' node

0N/A -- analyse SPEC2

0N/A (sp2', nsig3, dg3) <-

0N/A anaSpec addSyms lg dg2 (JustNode nsig2) name opts sp2

0N/A return (Data (Logic lidD) (Logic lidP)

0N/A (replaceAnnoted sp1' asp1)

0N/A (replaceAnnoted sp2' asp2)

0N/A pos, nsig3, dg3)

0N/A

0N/AanaUnion :: Bool -> LogicGraph -> DGraph -> MaybeNode -> NodeName

0N/A -> HetcatsOpts -> [Annoted SPEC]

0N/A -> Result ([Annoted SPEC], [NodeSig], NodeSig, DGraph)

0N/AanaUnion addSyms lg dg nsig name opts asps = case asps of

0N/A [] -> fail "empty union"

0N/A _ -> do

0N/A let sps = map item asps

0N/A (sps', nsigs, dg', _) <-

0N/A let ana (sps1, nsigs, dg', n) sp' = do

0N/A let n1 = inc n

0N/A (sp1, nsig', dg1) <- anaSpec addSyms lg dg' nsig n1 opts sp'

0N/A return (sp1 : sps1, nsig' : nsigs, dg1, n1)

0N/A in foldM ana ([], [], dg, extName "Union" name) sps

0N/A let newAsps = zipWith replaceAnnoted (reverse sps') asps

0N/A case nsigs of

0N/A [ns] -> return (newAsps, nsigs, ns, dg')

0N/A _ -> do

0N/A let nsigs' = reverse nsigs

0N/A gbigSigma <- gsigManyUnion lg (map getSig nsigs')

0N/A let (ns@(NodeSig node _), dg2) = insGSig dg' name DGUnion gbigSigma

0N/A insE dgl (NodeSig n gsigma) = do

0N/A incl <- ginclusion lg gsigma gbigSigma

0N/A return $ insLink dgl incl globalDef SeeTarget n node

0N/A dg3 <- foldM insE dg2 nsigs'

0N/A return (newAsps, nsigs', ns, dg3)

0N/A

0N/AanaFitArgs :: LogicGraph -> HetcatsOpts -> SPEC_NAME -> MaybeNode

0N/A -> ([FIT_ARG], DGraph, [(G_morphism, NodeSig)], NodeName)

0N/A -> (NodeSig, FIT_ARG)

0N/A -> Result ([FIT_ARG], DGraph, [(G_morphism, NodeSig)], NodeName)

0N/AanaFitArgs lg opts spname imps (fas', dg1, args, name') (nsig', fa) = do

0N/A let n1 = inc name'

0N/A (fa', dg', arg) <- anaFitArg lg dg1 spname imps nsig' opts n1 fa

0N/A return (fa' : fas', dg', arg : args, n1)

0N/A

0N/AparLink :: LogicGraph -> DGLinkOrigin -> NodeSig -> DGraph -> NodeSig

0N/A -> Result DGraph

0N/AparLink lg orig (NodeSig node gsigma') dg (NodeSig nA_i sigA_i)= do

0N/A incl <- ginclusion lg sigA_i gsigma'

0N/A return $ insLink dg incl globalDef orig nA_i node

0N/A

263N/A-- analysis of renamings

263N/AanaRen :: LogicGraph -> HetcatsOpts -> MaybeNode -> Range -> GMorphism

263N/A -> G_mapping -> Result GMorphism

263N/AanaRen lg opts lenv pos gmor@(GMorphism r sigma ind1 mor _) gmap =

0N/A adjustPos pos $ case gmap of

0N/A G_symb_map (G_symb_map_items_list lid sis) ->

0N/A let lid2 = targetLogic r in

0N/A if language_name lid2 == language_name lid then

0N/A if isStructured opts then return gmor else do

0N/A sis1 <- coerceSymbMapItemsList lid lid2 "Analysis of renaming" sis

0N/A rmap <- stat_symb_map_items lid2 sis1

0N/A mor1 <- ext_induced_from_morphism lid2 rmap $ makeExtSign lid2 $ cod mor

0N/A case lenv of

0N/A EmptyNode _ -> return ()

0N/A JustNode (NodeSig _ (G_sign lidLenv sigmaLenv _)) -> do

0N/A -- needs to be changed for logic translations

0N/A sigmaLenv' <- coerceSign lidLenv lid2

0N/A "Analysis of renaming: logic translations not properly handeled"

0N/A sigmaLenv -- see Calculi/Time/FlowOfTime.casl line 305

0N/A let sysLenv = ext_sym_of lid2 sigmaLenv'

0N/A m = symmap_of lid2 mor1

0N/A isChanged sy = case Map.lookup sy m of

0N/A Just sy' -> sy /= sy'

0N/A Nothing -> False

0N/A forbiddenSys = Set.filter isChanged sysLenv

0N/A unless (Set.null forbiddenSys) $ plain_error () (

0N/A "attempt to rename the following symbols from " ++

0N/A "the local environment:\n" ++ showDoc forbiddenSys "") pos

0N/A mor2 <- comp mor mor1

0N/A return $ GMorphism r sigma ind1 mor2 startMorId

0N/A else do

0N/A comor <- logicInclusion lg (Logic lid2) (Logic lid)

0N/A gmorTrans <- gEmbedComorphism comor $ cod gmor

0N/A newMor <- comp gmor gmorTrans

0N/A anaRen lg opts lenv pos newMor gmap

0N/A G_logic_translation (Logic_code tok src tar pos1) ->

0N/A let adj1 = adjustPos $ if pos1 == nullRange then pos else pos1

0N/A in adj1 $ do

0N/A G_sign srcLid srcSig ind <- return (cod gmor)

517N/A c <- case tok of

517N/A Just ctok -> do

517N/A let getLogicStr (Logic_name l _) = tokStr l

517N/A Comorphism cid <- lookupComorphism (tokStr ctok) lg

517N/A when (isJust src && getLogicStr (fromJust src) /=

0N/A language_name (sourceLogic cid))

0N/A (fail (getLogicStr (fromJust src) ++

0N/A "is not the source logic of "

0N/A ++ language_name cid))

0N/A when (isJust tar && getLogicStr (fromJust tar) /=

0N/A language_name (targetLogic cid))

0N/A (fail (getLogicStr (fromJust tar) ++

0N/A "is not the target logic of "

0N/A ++ language_name cid))

0N/A return (Comorphism cid)

0N/A Nothing -> case tar of

0N/A Just (Logic_name l _) ->

0N/A lookupLogic "with logic: " (tokStr l) lg

0N/A >>= logicInclusion lg (Logic srcLid)

0N/A Nothing -> fail "with logic: cannot determine comorphism"

0N/A mor1 <- gEmbedComorphism c (G_sign srcLid srcSig ind)

0N/A comp gmor mor1

0N/A

0N/AanaRenaming :: LogicGraph -> MaybeNode -> G_sign -> HetcatsOpts -> RENAMING

0N/A -> Result GMorphism

0N/AanaRenaming lg lenv gSigma opts (Renaming ren pos) =

0N/A foldM (anaRen lg opts lenv pos) (ide gSigma) ren

0N/A

0N/A-- analysis of restrictions

0N/AanaRestr :: G_sign -> Range -> GMorphism -> G_hiding -> Result GMorphism

0N/AanaRestr (G_sign lidLenv sigmaLenv _) pos

0N/A (GMorphism cid (ExtSign sigma1 sys1) _ mor _) gh =

0N/A case gh of

0N/A G_symb_list (G_symb_items_list lid' sis') -> do

0N/A let lid1 = sourceLogic cid

0N/A sis1 <- coerceSymbItemsList lid' lid1 "Analysis of restriction" sis'

0N/A rsys <- stat_symb_items lid1 sis1

0N/A let sys = sym_of lid1 sigma1

0N/A sys' = Set.filter (\ sy -> any (matches lid1 sy) rsys) sys

0N/A unmatched = filter ( \ rsy -> Set.null $ Set.filter

0N/A ( \ sy -> matches lid1 sy rsy) sys') rsys

0N/A unless (null unmatched)

0N/A $ plain_error () ("attempt to hide unknown symbols:\n"

0N/A ++ showDoc unmatched "") pos

0N/A -- needs to be changed when logic projections are implemented

0N/A sigmaLenv' <- coerceSign lidLenv lid1

0N/A "Analysis of restriction: logic projections not properly handeled"

0N/A sigmaLenv

0N/A let sysLenv = ext_sym_of lid1 sigmaLenv'

0N/A forbiddenSys = sys' `Set.intersection` sysLenv

0N/A unless (Set.null forbiddenSys)

0N/A $ plain_error () (

0N/A "attempt to hide the following symbols from the local environment:\n"

0N/A ++ showDoc forbiddenSys "") pos

0N/A mor1 <- cogenerated_sign lid1 sys' sigma1

0N/A mor1' <- map_morphism cid mor1

0N/A mor2 <- comp mor1' mor

0N/A return $ GMorphism cid (ExtSign (dom mor1) $ Set.fold (\ sy ->

0N/A case Map.lookup sy $ symmap_of lid1 mor1 of

0N/A Nothing -> id

0N/A Just sy1 -> Set.insert sy1) Set.empty sys1)

0N/A startSigId mor2 startMorId

0N/A G_logic_projection (Logic_code _tok _src _tar pos1) ->

0N/A fatal_error "no analysis of logic projections yet" pos1

0N/A

0N/AanaRestriction :: G_sign -> G_sign -> HetcatsOpts -> RESTRICTION

0N/A -> Result (GMorphism, Maybe GMorphism)

0N/AanaRestriction gSigma@(G_sign lid sigma _)

0N/A gSigma'@(G_sign lid' sigma' _) opts restr =

0N/A if isStructured opts then return (ide gSigma, Nothing) else

0N/A case restr of

0N/A Hidden rstr pos -> do

0N/A mor <- foldM (anaRestr gSigma pos) (ide gSigma') rstr

0N/A return (mor, Nothing)

0N/A Revealed (G_symb_map_items_list lid1 sis) pos ->

0N/A let sys = ext_sym_of lid sigma -- local env

0N/A sys' = ext_sym_of lid' sigma' -- "big" signature

0N/A in adjustPos pos $ do

0N/A sis' <- coerceSymbMapItemsList lid1 lid'

0N/A "Analysis of restriction" sis

0N/A rmap <- stat_symb_map_items lid' sis'

0N/A let sys'' =

0N/A Set.fromList

0N/A [sy | sy <- Set.toList sys', rsy <-

0N/A Map.keys rmap, matches lid' sy rsy]

0N/A -- domain of rmap intersected with sys'

0N/A -- domain of rmap should be checked to match symbols from sys' ???

0N/A sys1 <- coerceSymbolSet lid lid' "Analysis of restriction" sys

0N/A -- ??? this is too simple in case that local env is translated

0N/A -- to a different logic

0N/A mor1 <- ext_generated_sign lid' (sys1 `Set.union` sys'') sigma'

0N/A mor2 <- ext_induced_from_morphism lid' rmap $ makeExtSign lid' $ dom mor1

0N/A return (gEmbed (mkG_morphism lid' mor1),

271N/A Just (gEmbed (mkG_morphism lid' mor2)))

271N/A

271N/AanaGmaps :: LogicGraph -> HetcatsOpts -> Range -> G_sign -> G_sign

271N/A -> [G_mapping] -> Result G_morphism

271N/AanaGmaps lg opts pos psig@(G_sign lidP sigmaP _) (G_sign lidA sigmaA _) gsis

0N/A = adjustPos pos $ if isStructured opts

0N/A then return $ mkG_morphism lidP $ ext_ide sigmaP

0N/A else if null gsis then do

0N/A sigmaA' <- coerceSign lidA lidP "anaGmaps" sigmaA

0N/A fmap (mkG_morphism lidP) $

271N/A ext_induced_from_to_morphism lidP Map.empty sigmaP sigmaA'

271N/A else do

271N/A cl <- lookupCurrentLogic "anaGmaps" lg

271N/A G_symb_map_items_list lid sis <- homogenizeGM cl gsis

271N/A rmap <- stat_symb_map_items lid sis

0N/A (G_sign lidP' sigmaP'' _, _) <- gSigCoerce lg psig (Logic lid)

0N/A sigmaP' <- coerceSign lidP' lid "anaGmaps1" sigmaP''

0N/A sigmaA' <- coerceSign lidA lid "anaGmaps2" sigmaA

0N/A fmap (mkG_morphism lid)

0N/A $ ext_induced_from_to_morphism lid rmap sigmaP' sigmaA'

0N/A

0N/A {-

0N/A let symI = sym_of lidP sigmaI'

0N/A symmap_mor = symmap_of lidP mor

0N/A -- are symbols of the imports left untouched?

0N/A if Set.all (\sy -> lookupFM symmap_mor sy == Just sy) symI

0N/A then return ()

0N/A else plain_error () "Fitting morphism must not affect import" pos

0N/A -} -- ??? does not work

0N/A -- ??? also output some symbol that is affected

0N/A

0N/AanaFitArg :: LogicGraph -> DGraph -> SPEC_NAME -> MaybeNode -> NodeSig

0N/A -> HetcatsOpts -> NodeName -> FIT_ARG

0N/A -> Result (FIT_ARG, DGraph, (G_morphism, NodeSig))

0N/AanaFitArg lg dg spname nsigI (NodeSig nP gsigmaP) opts name fv = case fv of

271N/A Fit_spec asp gsis pos -> do

0N/A (sp', nsigA@(NodeSig nA gsigA), dg') <-

271N/A anaSpec False lg dg nsigI name opts (item asp)

0N/A gmor <- anaGmaps lg opts pos gsigmaP gsigA gsis

0N/A return (Fit_spec (replaceAnnoted sp' asp) gsis pos,

0N/A insLink dg' (gEmbed gmor) globalThm

0N/A (DGLinkSpecInst spname) nP nA, (gmor, nsigA))

271N/A Fit_view vn afitargs pos -> case lookupGlobalEnvDG vn dg of

0N/A Just (ViewEntry (ExtViewSig (NodeSig nSrc gsigmaS) mor

0N/A gs@(ExtGenSig (GenSig _ params _) target@(NodeSig nTar _))))

0N/A -> adjustPos pos $ do

0N/A GMorphism cid _ _ morHom ind <- return mor

0N/A let lid = targetLogic cid

0N/A spstr = tokStr spname

0N/A pname = dgn_name $ labDG dg nP

0N/A gsigmaI = getMaybeSig nsigI

0N/A dg5 <- do

0N/A gsigmaIS <- gsigUnion lg gsigmaI gsigmaS

0N/A unless (isSubGsign lg gsigmaP gsigmaIS

0N/A && isSubGsign lg gsigmaIS gsigmaP)

0N/A (plain_error ()

0N/A ("Parameter does not match source of fittig view. "

0N/A ++ "Parameter signature:\n"

0N/A ++ showDoc gsigmaP

0N/A "\nSource signature of fitting view (united with import):\n"

0N/A ++ showDoc gsigmaIS "") pos)

0N/A (dg4, iSrc) <- case nsigI of

0N/A EmptyNode _ -> return (dg, nSrc)

0N/A JustNode (NodeSig nI _) -> do

0N/A inclI <- ginclusion lg gsigmaI gsigmaIS

0N/A inclS <- ginclusion lg gsigmaS gsigmaIS

0N/A let (NodeSig n' _, dg1) = insGSig dg (extName "View" name)

0N/A {xpath = xpath pname} (DGFitView spname) gsigmaIS

0N/A dg2 = insLink dg1 inclI globalDef

0N/A (DGLinkFitViewImp spname) nI n'

0N/A return (insLink dg2 inclS globalDef SeeTarget nSrc n', n')

0N/A gmor <- ginclusion lg gsigmaP gsigmaIS

0N/A return $ insLink dg4 gmor globalThm (DGLinkFitView spname) nP iSrc

0N/A case (\ x y -> (x, x - y)) (length afitargs) (length params) of

0N/A -- the case without parameters leads to a simpler dg

0N/A (0, 0) -> return (fv, dg5, (G_morphism lid morHom ind, target))

0N/A -- now the case with parameters

0N/A (_, 0) -> do

0N/A (ffitargs, dg', (gmor_f, _, ns@(NodeSig nA _))) <-

0N/A anaAllFitArgs lg opts dg5 (EmptyNode $ Logic lid)

0N/A name spname gs afitargs

0N/A mor1 <- comp mor gmor_f

0N/A GMorphism cid1 _ _ theta _ <- return mor1

0N/A let lid1 = targetLogic cid1

0N/A when (language_name (sourceLogic cid1) /= language_name lid1)

0N/A $ fatal_error "heterogeneous fitting views not yet implemented"

0N/A pos

0N/A let dg9 = insLink dg' gmor_f globalDef SeeTarget nTar nA

0N/A return (Fit_view vn ffitargs pos, dg9, (mkG_morphism lid1 theta, ns))

0N/A-- finally the case with conflicting numbers of formal and actual parameters

0N/A _ -> fatal_error

0N/A (spstr ++ " expects " ++ show (length params) ++ " arguments"

0N/A ++ " but was given " ++ show (length afitargs)) pos

0N/A _ -> fatal_error ("View " ++ tokStr vn ++ " not found") pos

0N/A

0N/AanaAllFitArgs :: LogicGraph -> HetcatsOpts -> DGraph -> MaybeNode -> NodeName

0N/A -> SPEC_NAME -> ExtGenSig -> [Annoted FIT_ARG]

0N/A -> Result ([Annoted FIT_ARG], DGraph, (GMorphism, G_sign, NodeSig))

0N/AanaAllFitArgs lg opts dg nsig name spname

0N/A gs@(ExtGenSig (GenSig imps params _) _)

0N/A afitargs = do

0N/A let fitargs = map item afitargs

0N/A (fitargs', dg', args, _) <- foldM (anaFitArgs lg opts spname imps)

0N/A ([], dg, [], extName "Actuals" name) (zip params fitargs)

0N/A let actualargs = reverse args

0N/A (gsigma', morDelta) <- applyGS lg gs actualargs

0N/A gsigmaRes <- gsigUnion lg (getMaybeSig nsig) gsigma'

0N/A let (ns, dg2) = insGSig dg' name (DGSpecInst spname) gsigmaRes

0N/A dg3 <- foldM (parLink lg DGLinkFitSpec ns) dg2 $ map snd args

0N/A return ( zipWith replaceAnnoted (reverse fitargs') afitargs, dg3

263N/A , (morDelta, gsigma', ns))

263N/A

0N/A-- Extension of signature morphisms (for instantitations)

0N/A-- first some auxiliary functions

0N/A

mapID :: Map.Map Id (Set.Set Id) -> Id -> Result Id

mapID idmap i@(Id toks comps pos1) =

case Map.lookup i idmap of

Nothing -> do

compsnew <- mapM (mapID idmap) comps

return (Id toks compsnew pos1)

Just ids -> if Set.null ids then return i else

if Set.null $ Set.deleteMin ids then return $ Set.findMin ids else

plain_error i

("Identifier component " ++ showId i

" can be mapped in various ways:\n"

++ showDoc ids "") $ getRange i

extID1 :: Map.Map Id (Set.Set Id) -> Id

-> Result (EndoMap Id) -> Result (EndoMap Id)

extID1 idmap i@(Id toks comps pos1) m = do

m1 <- m

compsnew <- mapM (mapID idmap) comps

return $ if comps == compsnew then m1 else

Map.insert i (Id toks compsnew pos1) m1

extID :: Set.Set Id -> Map.Map Id (Set.Set Id) -> Result (EndoMap Id)

extID ids idmap = Set.fold (extID1 idmap) (return Map.empty) ids

extendMorphism :: G_sign -- ^ formal parameter

-> G_sign -- ^ body

-> G_sign -- ^ actual parameter

-> G_morphism -- ^ fitting morphism

-> Result(G_sign, GMorphism)

extendMorphism (G_sign lid sigmaP _) (G_sign lidB sigmaB1 _)

(G_sign lidA sigmaA1 _) (G_morphism lidM fittingMor1 _) = do

-- for now, only homogeneous instantiations....

sigmaB@(ExtSign _ sysB) <-

coerceSign lidB lid "Extension of symbol map1" sigmaB1

sigmaA <- coerceSign lidA lid "Extension of symbol map2" sigmaA1

fittingMor <- coerceMorphism lidM lid "Extension of symbol map3" fittingMor1

let symsP = ext_sym_of lid sigmaP

symsB = ext_sym_of lid sigmaB

idsB = Set.map (sym_name lid) symsB

h = symmap_of lid fittingMor

symbMapToRawSymbMap =

Map.foldWithKey (\sy1 sy2 -> Map.insert (symbol_to_raw lid sy1)

(symbol_to_raw lid sy2))

Map.empty

rh = symbMapToRawSymbMap h

idh = Map.foldWithKey

(\sy1 sy2 -> Rel.setInsert (sym_name lid sy1) (sym_name lid sy2))

Map.empty h

idhExt <- extID idsB idh

let rIdExt = Map.foldWithKey (\id1 id2 -> Map.insert

(id_to_raw lid id1) (id_to_raw lid id2))

Map.empty

(foldr Map.delete idhExt $ Map.keys idh)

r = rh `Map.union` rIdExt

-- do we need combining function catching the clashes???

mor <- ext_induced_from_morphism lid r sigmaB

let hmor = symmap_of lid mor

sigmaAD = ExtSign (cod mor) $ Set.map (\ sy ->

Map.findWithDefault sy sy hmor) sysB

sigma <- ext_signature_union lid sigmaA sigmaAD

let illShared = (ext_sym_of lid sigmaA `Set.intersection`

ext_sym_of lid sigmaAD )

Set.\\ Rel.image h symsP

unless (Set.null illShared)

$ plain_error () ("Symbols shared between actual parameter and body"

++ "\nmust be in formal parameter:\n"

++ showDoc illShared "") nullRange

let myKernel = Set.fromDistinctAscList . comb1 . Map.toList

comb1 [] = []

comb1 (p : qs) =

comb2 p qs [] ++ comb1 qs

comb2 _ [] rs = rs

comb2 p@(a, b) ((c, d) : qs) rs =

comb2 p qs $ if b == d then (a, c) : rs else rs

newIdentifications = myKernel hmor Set.\\ myKernel h

unless (Set.null newIdentifications)

$ warning () (

"Fitting morphism may lead to forbidden identifications:\n"

++ showDoc newIdentifications "") nullRange

incl <- ext_inclusion lid sigmaAD sigma

mor1 <- comp mor incl

return (G_sign lid sigma startSigId, gEmbed $ mkG_morphism lid mor1)

applyGS :: LogicGraph -> ExtGenSig -> [(G_morphism, NodeSig)]

-> Result(G_sign, GMorphism)

applyGS lg (ExtGenSig (GenSig nsigI _ gsigmaP) nsigB) args = do

let mor_i = map fst args

gsigmaA_i = map (getSig . snd) args

gsigmaB = getSig nsigB

gsigmaA@(G_sign lidA _ _) <- gsigManyUnion lg gsigmaA_i

(_, Comorphism uid) <- logicUnion lg (getNodeLogic nsigB) (Logic lidA)

let cl = Logic $ targetLogic uid

G_morphism lidG mor0 _ <- case nsigI of

EmptyNode _ -> homogeneousMorManyUnion mor_i

JustNode (NodeSig _ gsigmaI) -> do

(G_sign lidI sigmaI _, _) <- gSigCoerce lg gsigmaI (Logic lidA)

let idI = ext_ide sigmaI

homogeneousMorManyUnion $ mkG_morphism lidI idI : mor_i

(gsigmaP', _) <- gSigCoerce lg (getMaybeSig gsigmaP) cl

(gsigmaB', _) <- gSigCoerce lg gsigmaB cl

(gsigmaA', Comorphism aid) <- gSigCoerce lg gsigmaA cl

mor1 <- coerceMorphism lidG (sourceLogic aid) "applyGS" mor0

mor2 <- map_morphism aid mor1

extendMorphism gsigmaP' gsigmaB' gsigmaA' $

G_morphism (targetLogic aid) mor2 startMorId

homogenizeGM :: AnyLogic -> [Syntax.AS_Structured.G_mapping]

-> Result G_symb_map_items_list

homogenizeGM (Logic lid) gsis =

foldM homogenize1 (G_symb_map_items_list lid []) gsis

where

homogenize1 itl2@(G_symb_map_items_list lid2 sis) sm = case sm of

Syntax.AS_Structured.G_symb_map (G_symb_map_items_list lid1 sis1) -> do

sis1' <- coerceSymbMapItemsList lid1 lid2 "" sis1

return $ G_symb_map_items_list lid2 $ sis ++ sis1'

_ -> return itl2

-- | check if structured analysis should be performed

isStructured :: HetcatsOpts -> Bool

isStructured a = case analysis a of

Structured -> True

_ -> False

getSpecAnnos :: Range -> Annoted a -> Result (Conservativity, Bool)

getSpecAnnos pos a = do

let sannos = filter isSemanticAnno $ l_annos a

(sanno1, conflict, impliedA, impliesA) = case sannos of

f@(Semantic_anno anno1 _) : r -> (case anno1 of

SA_cons -> Cons

SA_def -> Def

SA_mono -> Mono

_ -> None, any (/= f) r,

anno1 == SA_implied, anno1 == SA_implies)

_ -> (None, False, False, False)

when conflict $ plain_error () "Conflicting semantic annotations" pos

when impliedA $ plain_error ()

"Annotation %implied should come after a BASIC-ITEM" pos

return (sanno1, impliesA)

-- only consider addSyms for the first spec

anaExtension

:: LogicGraph -> HetcatsOpts -> Range

-> ([SPEC], MaybeNode, DGraph, Conservativity, Bool)

-> (NodeName, Annoted SPEC)

-> Result ([SPEC], MaybeNode, DGraph, Conservativity, Bool)

anaExtension lg opts pos (sps', nsig', dg', conser, addSyms) (name', asp')

= do

(sanno1, impliesA) <- getSpecAnnos pos asp'

-- attach conservativity to definition link

(sp1', nsig1@(NodeSig n1 sig1), dg1) <-

anaSpecTop (max conser sanno1) addSyms lg dg' nsig' name' opts (item asp')

dg2 <- if impliesA then case nsig' of

JustNode (NodeSig n' sig') -> do

-- is the extension going between real nodes?

unless (isHomSubGsign sig1 sig') $ plain_error ()

"Signature must not be extended in presence of %implies" pos

-- insert a theorem link according to p. 319 of the CASL Reference Manual

return $ insLink dg1 (ide sig1) globalThm DGImpliesLink n1 n'

_ -> return dg1

else return dg1

return (sp1' : sps', JustNode nsig1, dg2, None, True)