{-# OPTIONS -cpp #-}

{- |

Module : $Header$

Description : Logic for manipulating the graph in the Central GUI

Copyright : (c) Jorina Freya Gerken, Till Mossakowski, Uni Bremen 2002-2006

License : similar to LGPL, see HetCATS/LICENSE.txt or LIZENZ.txt

Maintainer : till@informatik.uni-bremen.de

Stability : provisional

Portability : non-portable (imports Logic)

This module provides functions for all the menus in the Hets GUI.

These are then assembled to the GUI in "GUI.GraphMenu".

-}

module GUI.GraphLogic

( undo

, reload

, performProofAction

, openProofStatus

, saveProofStatus

, nodeErr

, proofMenu

, showReferencedLibrary

, getTheoryOfNode

, translateTheoryOfNode

, displaySubsortGraph

, displayConceptGraph

, lookupTheoryOfNode

, showProofStatusOfNode

, proveAtNode

, showNodeInfo

, showEdgeInfo

, checkconservativityOfEdge

, convert

, hideNodes

, hideNewProvedEdges

, getLibDeps

, hideShowNames

, showNodes

, translateGraph

, showLibGraph

, runAndLock

, saveUDGraph

, focusNode

, applyChanges

) where

import Logic.Logic(conservativityCheck,map_sen, comp)

import Logic.Coerce(coerceSign, coerceMorphism)

import Logic.Grothendieck

import Logic.Comorphism

import Logic.Prover

import Comorphisms.LogicGraph(logicGraph)

import Static.GTheory

import Static.DevGraph

import Static.PrintDevGraph

import Static.DGTranslation(libEnv_translation, getDGLogic)

import Proofs.EdgeUtils

import Proofs.InferBasic(basicInferenceNode)

import Proofs.StatusUtils(lookupHistory, removeContraryChanges)

import Proofs.TheoremHideShift

import GUI.Taxonomy (displayConceptGraph,displaySubsortGraph)

import GUI.GraphTypes

import qualified GUI.GraphAbstraction as GA

import GUI.Utils

#ifdef UNIVERSION2

import Graphs.GraphConfigure

import Reactor.InfoBus(encapsulateWaitTermAct)

import HTk.Toolkit.DialogWin (useHTk)

#else

import GraphConfigure

import InfoBus(encapsulateWaitTermAct)

import DialogWin (useHTk)

#endif

import qualified GUI.HTkUtils as HTk

import Common.DocUtils (showDoc)

import Common.AS_Annotation (isAxiom)

import Common.Consistency

import Common.ExtSign

import Common.LibName

import Common.Result as Res

import qualified Common.OrderedMap as OMap

import qualified Common.Lib.Rel as Rel

import qualified Common.Lib.SizedList as SizedList

import Driver.Options

import Driver.WriteLibDefn(writeShATermFile)

import Driver.ReadFn(libNameToFile, readVerbose)

import Driver.AnaLib(anaLibExt, anaLib)

import System.Directory(getModificationTime)

import Data.IORef

import Data.Char(toLower)

import Data.List(partition, delete)

import Data.Maybe

import Data.Graph.Inductive.Graph (Node, LEdge, LNode)

import qualified Data.Map as Map

import qualified Data.Set as Set

import Control.Monad

import Control.Concurrent (forkIO)

import Control.Concurrent.MVar

import Interfaces.History

import Interfaces.DataTypes

-- | Locks the global lock and runs function

runAndLock :: GInfo -> IO () -> IO ()

runAndLock (GInfo { functionLock = lock

, gi_GraphInfo = actGraphInfo

}) function = do

locked <- tryPutMVar lock ()

case locked of

True -> do

GA.deactivateGraphWindow actGraphInfo

function

takeMVar lock

GA.redisplay actGraphInfo

GA.layoutImproveAll actGraphInfo

GA.activateGraphWindow actGraphInfo

False ->

GA.showTemporaryMessage actGraphInfo

"an other function is still working ... please wait ..."

-- | Undo one step of the History

undo :: GInfo -> Bool -> IO ()

undo gInfo@(GInfo { gi_GraphInfo = actGraphInfo }) isUndo =

do

hhn <- GA.hasHiddenNodes actGraphInfo

intSt <- readIORef $ intState gInfo

nwSt <- if isUndo then undoOneStep intSt else redoOneStep intSt

writeIORef (intState gInfo) nwSt

if hhn then hideNodes gInfo else return ()

GA.redisplay actGraphInfo

-- | reloads the Library of the DevGraph

reload :: GInfo -> IO()

reload gInfo@(GInfo { gi_hetcatsOpts = opts

, gi_GraphInfo = actGraphInfo

}) = do

lockGlobal gInfo

oldst <- readIORef $ intState gInfo

case i_state oldst of

Nothing -> do

unlockGlobal gInfo

return ()

Just ist -> do

let

oldle = i_libEnv ist

ln = i_ln ist

libdeps = getLibDeps oldle

ioruplibs <- newIORef ([] :: [LIB_NAME])

writeIORef ioruplibs []

reloadLibs (intState gInfo) opts libdeps ioruplibs ln

unlockGlobal gInfo

libs <- readIORef ioruplibs

case libs of

[] -> GA.showTemporaryMessage actGraphInfo "Reload not needed!"

_ -> remakeGraph gInfo

-- | Creates a list of all LIB_NAME pairs, which have a dependency

getLibDeps :: LibEnv -> [(LIB_NAME, LIB_NAME)]

getLibDeps = Rel.toList . Rel.intransKernel . Rel.transClosure

. Rel.fromSet . Map.foldWithKey (\ ln dg s -> foldr (\ x ->

if isDGRef x then Set.insert (ln, dgn_libname x) else id) s

$ map snd $ labNodesDG dg) Set.empty

-- | Reloads a library

reloadLib :: IORef IntState -> HetcatsOpts -> IORef [LIB_NAME] -> LIB_NAME

-> IO ()

reloadLib iorst opts ioruplibs ln = do

ost <- readIORef iorst

case i_state ost of

Nothing -> return ()

Just ist -> do

mfile <- existsAnSource opts {intype = GuessIn}

$ rmSuffix $ libNameToFile opts ln

case mfile of

Nothing -> return ()

Just file -> do

let le = i_libEnv ist

mFunc <- case openlock $ lookupDGraph ln le of

Just lock -> tryTakeMVar lock

Nothing -> return Nothing

let

le' = Map.delete ln le

mres <- anaLibExt opts file le'

case mres of

Just (_, newle) -> do

uplibs <- readIORef ioruplibs

writeIORef ioruplibs $ ln : uplibs

nle <- case mFunc of

Just func -> do

lock <- case openlock $ lookupDGraph ln newle of

Just lock -> return lock

Nothing -> newEmptyMVar

putMVar lock func

return $ Map.insert ln (lookupDGraph ln newle)

{openlock = Just lock} newle

Nothing -> return newle

let nwst = ost { i_state = Just ist { i_libEnv = nle } }

writeIORef iorst nwst

Nothing ->

errorDialog "Error" $ "Error when reloading file " ++ show file

-- | Reloads libraries if nessesary

reloadLibs :: IORef IntState -> HetcatsOpts -> [(LIB_NAME, LIB_NAME)]

-> IORef [LIB_NAME] -> LIB_NAME -> IO Bool

reloadLibs iorst opts deps ioruplibs ln = do

ost <- readIORef iorst

case i_state ost of

Nothing -> return False

Just _ -> do

uplibs <- readIORef ioruplibs

case elem ln uplibs of

True -> return True

False -> do

let

deps' = map snd $ filter (\ (ln',_) -> ln == ln') deps

res <- mapM (reloadLibs iorst opts deps ioruplibs) deps'

let

libupdate = foldl (flip (||)) False res

case libupdate of

True -> do

reloadLib iorst opts ioruplibs ln

return True

False -> do

ost' <- readIORef iorst

case i_state ost' of

Nothing -> return False

Just ist' -> do

let le = i_libEnv ist'

let

newln:_ = filter (ln ==) $ Map.keys le

mfile <- existsAnSource opts $ rmSuffix $ libNameToFile opts ln

case mfile of

Nothing -> return False

Just file -> do

newmt <- getModificationTime file

let

libupdate' = (getModTime $ getLIB_ID newln) < newmt

case libupdate' of

False -> return False

True -> do

reloadLib iorst opts ioruplibs ln

return True

-- | Deletes the old edges and nodes of the Graph and makes new ones

remakeGraph :: GInfo -> IO ()

remakeGraph gInfo@(GInfo { gi_GraphInfo = actGraphInfo

}) = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let le = i_libEnv ist

ln = i_ln ist

dgraph = lookupDGraph ln le

showNodes gInfo

GA.clear actGraphInfo

convert actGraphInfo dgraph

hideNodes gInfo

-- | Toggles to display internal node names

hideShowNames :: GInfo -> Bool -> IO ()

hideShowNames (GInfo { internalNamesIORef = showInternalNames

}) toggle = do

(intrn::InternalNames) <- readIORef showInternalNames

let showThem = if toggle then not $ showNames intrn else showNames intrn

showItrn s = if showThem then s else ""

mapM_ (\(s,upd) -> upd (\_ -> showItrn s)) $ updater intrn

writeIORef showInternalNames $ intrn {showNames = showThem}

-- | shows all hidden nodes and edges

showNodes :: GInfo -> IO ()

showNodes gInfo@(GInfo { gi_GraphInfo = actGraphInfo

}) = do

hhn <- GA.hasHiddenNodes actGraphInfo

case hhn of

True -> do

GA.showTemporaryMessage actGraphInfo "Revealing hidden nodes ..."

GA.showAll actGraphInfo

hideShowNames gInfo False

False ->

GA.showTemporaryMessage actGraphInfo "No hidden nodes found ..."

-- | hides all unnamed internal nodes that are proven

hideNodes :: GInfo -> IO ()

hideNodes gInfo@(GInfo { gi_GraphInfo = actGraphInfo }) = do

hhn <- GA.hasHiddenNodes actGraphInfo

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> if hhn then

GA.showTemporaryMessage actGraphInfo "Nodes already hidden ..."

else do

GA.showTemporaryMessage actGraphInfo "Hiding unnamed nodes..."

let le = i_libEnv ist

ln = i_ln ist

dg = lookupDGraph ln le

nodes = selectNodesByType dg [DGNodeType

{nonRefType = NonRefType

{isProvenCons = True

, isInternalSpec = True}

, isLocallyEmpty = True}]

edges = getCompressedEdges dg nodes

GA.hideNodes actGraphInfo nodes edges

-- | hides all proven edges created not initialy

hideNewProvedEdges :: GInfo -> IO ()

hideNewProvedEdges gInfo@(GInfo { gi_GraphInfo = actGraphInfo }) = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let ph = SizedList.toList $ proofHistory

$ lookupDGraph (i_ln ist) $ i_libEnv ist

edges = foldl (\ e c -> case c of

InsertEdge (_, _, lbl) -> (dgl_id lbl):e

DeleteEdge (_, _, lbl) -> delete (dgl_id lbl) e

_ -> e

) [] $ flattenHistory ph []

mapM_ (GA.hideEdge actGraphInfo) edges

GA.redisplay actGraphInfo

-- | generates from list of HistElem one list of DGChanges

flattenHistory :: [HistElem] -> [DGChange] -> [DGChange]

flattenHistory [] cs = cs

flattenHistory ((HistElem c):r) cs = flattenHistory r $ c:cs

flattenHistory ((HistGroup _ ph):r) cs =

flattenHistory r $ flattenHistory (SizedList.toList ph) cs

-- | selects all nodes of a type with outgoing edges

selectNodesByType :: DGraph -> [DGNodeType] -> [Node]

selectNodesByType dg types =

filter (\ n -> outDG dg n /= []) $ map fst

$ filter (\ (_, n) -> elem (getRealDGNodeType n) types) $ labNodesDG dg

-- | compresses a list of types to the highest one

compressTypes :: Bool -> [DGEdgeType] -> (DGEdgeType, Bool)

compressTypes _ [] = error "compressTypes: wrong usage"

compressTypes b (t:[]) = (t,b)

compressTypes b (t1:t2:r) = if t1 == t2 then compressTypes b (t1:r) else

if t1 > t2 then compressTypes False (t1:r) else compressTypes False (t2:r)

-- | returns a list of compressed edges

getCompressedEdges :: DGraph -> [Node] -> [(Node,Node,(DGEdgeType, Bool))]

getCompressedEdges dg hidden = filterDuplicates $ getShortPaths

$ concatMap (\ e@(_,t,_) -> map (e:) $ getPaths dg t hidden []) inEdges

where

inEdges = filter (\ (_,t,_) -> elem t hidden)

$ concatMap (outDG dg)

$ foldr (\ n i -> if elem n hidden

|| elem n i then i else n:i) []

$ map (\ (s,_,_) -> s) $ concatMap (innDG dg) hidden

-- | filter duplicate paths

filterDuplicates :: [(Node,Node,(DGEdgeType, Bool))]

-> [(Node,Node,(DGEdgeType, Bool))]

filterDuplicates [] = []

filterDuplicates ((s, t, (et,b)) : r) = edge : filterDuplicates others

where

(same,others) = partition (\ (s',t',_) -> s == s' && t == t') r

b' = and $ b : map (\ (_,_,(_,b'')) -> b'') same

edge = (s,t,compressTypes b' $ et : map (\ (_,_,(et',_)) -> et') same)

-- | returns the pahts of a given node through hidden nodes

getPaths :: DGraph -> Node -> [Node] -> [Node] -> [[LEdge DGLinkLab]]

getPaths dg node hidden seen' = case elem node hidden of

True -> case edges /= [] of

True -> concatMap (\ e@(_,t,_) -> map (e:) $ getPaths dg t hidden seen)

edges

False -> []

False -> [[]]

where

seen = node:seen'

edges = filter (\ (_,t,_) -> notElem t seen) $ outDG dg node

-- | returns source and target node of a path with the compressed type

getShortPaths :: [[LEdge DGLinkLab]]

-> [(Node,Node,(DGEdgeType,Bool))]

getShortPaths [] = []

getShortPaths (p : r) =

(s, t, compressTypes True $ map (\ (_,_,e) -> getRealDGLinkType e) p)

: getShortPaths r

where

(s,_,_) = head p

(_,t,_) = last p

-- | Let the user select a Node to focus

focusNode :: GInfo -> IO ()

focusNode gInfo@(GInfo { gi_GraphInfo = grInfo }) = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let le = i_libEnv ist

ln = i_ln ist

idsnodes <- filterM (fmap not . GA.isHiddenNode grInfo . fst)

$ labNodesDG $ lookupDGraph ln le

selection <- listBox "Select a node to focus"

$ map (\ (n, l) -> shows n " " ++ getDGNodeName l) idsnodes

case selection of

Just idx -> GA.focusNode grInfo $ fst $ idsnodes !! idx

Nothing -> return ()

translateGraph :: GInfo -> ConvFunc -> LibFunc -> IO ()

translateGraph gInfo@(GInfo { gi_hetcatsOpts = opts

}) convGraph showLib = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let le = i_libEnv ist

ln = i_ln ist

openTranslateGraph le ln opts (getDGLogic le) convGraph showLib

showLibGraph :: GInfo -> LibFunc -> IO ()

showLibGraph gInfo showLib = do

showLib gInfo

return ()

{- | it tries to perform the given action to the given graph.

If part of the given graph is not hidden, then the action can

be performed directly; otherwise the graph will be shown completely

firstly, and then the action will be performed, and after that the graph

will be hidden again.

-}

performProofAction :: GInfo -> IO () -> IO ()

performProofAction gInfo@(GInfo { gi_GraphInfo = actGraphInfo

}) proofAction = do

let actionWithMessage = do

GA.showTemporaryMessage actGraphInfo

"Applying development graph calculus proof rule..."

proofAction

hhn <- GA.hasHiddenNodes actGraphInfo

case hhn of

True -> do

showNodes gInfo

actionWithMessage

hideNodes gInfo

False -> actionWithMessage

GA.showTemporaryMessage actGraphInfo

"Development graph calculus proof rule finished."

saveProofStatus :: GInfo -> FilePath -> IO ()

saveProofStatus gInfo@(GInfo { gi_hetcatsOpts = opts

}) file = encapsulateWaitTermAct $ do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let proofStatus = i_libEnv ist

ln = i_ln ist

writeShATermFile file (ln, lookupHistory ln proofStatus)

putIfVerbose opts 2 $ "Wrote " ++ file

-- | implementation of open menu, read in a proof status

openProofStatus :: GInfo -> FilePath -> ConvFunc -> LibFunc

-> IO ()

openProofStatus gInfo@(GInfo { gi_hetcatsOpts = opts

}) file convGraph showLib = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let ln = i_ln ist

mh <- readVerbose opts ln file

case mh of

Nothing -> errorDialog "Error" $ "Could not read proof status from file '"

++ file ++ "'"

Just h -> do

let libfile = libNameToFile opts ln

m <- anaLib opts { outtypes = [] } libfile

case m of

Nothing -> errorDialog "Error"

$ "Could not read original development graph from '"

++ libfile ++ "'"

Just (_, libEnv) -> case Map.lookup ln libEnv of

Nothing -> errorDialog "Error" $ "Could not get original"

++ "development graph for '" ++ showDoc ln "'"

Just dg -> do

lockGlobal gInfo

let oldEnv = i_libEnv ist

proofStatus = Map.insert ln

(applyProofHistory h dg) oldEnv

nwst = ost { i_state = Just ist {

i_libEnv = proofStatus } }

writeIORef (intState gInfo) nwst

unlockGlobal gInfo

gInfo' <- copyGInfo gInfo ln

convGraph gInfo' "Proof Status " showLib

let actGraphInfo = gi_GraphInfo gInfo

GA.deactivateGraphWindow actGraphInfo

GA.redisplay actGraphInfo

GA.layoutImproveAll actGraphInfo

GA.activateGraphWindow actGraphInfo

-- | apply a rule of the development graph calculus

proofMenu :: GInfo

-> String

-> (LibEnv -> IO (Res.Result LibEnv))

-> IO ()

proofMenu gInfo@(GInfo { gi_GraphInfo = actGraphInfo

, gi_hetcatsOpts = hOpts

, proofGUIMVar = guiMVar

}) str proofFun = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let ln = i_ln ist

filled <- tryPutMVar guiMVar Nothing

if not filled

then readMVar guiMVar >>=

maybe (putIfVerbose hOpts 0 "proofMenu: ignored Nothing")

(\ w -> do

putIfVerbose hOpts 4 $

"proofMenu: Ignored Proof command; " ++

"maybe a proof window is still open?"

HTk.putWinOnTop w)

else do

lockGlobal gInfo

let proofStatus = i_libEnv ist

putIfVerbose hOpts 4 "Proof started via \"Proofs\" menu"

Res.Result ds res <- proofFun proofStatus

putIfVerbose hOpts 4 "Analyzing result of proof"

case res of

Nothing -> do

unlockGlobal gInfo

printDiags 2 ds

Just newProofStatus -> do

let newGr = lookupDGraph ln newProofStatus

history = snd $ splitHistory (lookupDGraph ln proofStatus) newGr

doDump hOpts "PrintHistory" $ do

putStrLn "History"

print $ prettyHistory history

let lln = map (\x-> DgCommandChange x) $ calcGlobalHistory

proofStatus newProofStatus

nmStr = strToCmd str

nst = add2history nmStr ost lln

-- nst = foldl (add2history nmStr) ost lln

-- (calcGlobalHistory proofStatus newProofStatus : guHist, grHist)

applyChanges actGraphInfo $ reverse

$ flatHistory history

let nwst = nst { i_state = Just ist { i_libEnv=newProofStatus}}

writeIORef (intState gInfo) nwst

unlockGlobal gInfo

hideShowNames gInfo False

mGUIMVar <- tryTakeMVar guiMVar

maybe (fail "should be filled with Nothing after proof attempt")

(const $ return ())

mGUIMVar

calcGlobalHistory :: LibEnv -> LibEnv -> [LIB_NAME]

calcGlobalHistory old new = let

length' ln = SizedList.size . proofHistory . lookupDGraph ln

changes = filter (\ ln -> length' ln old < length' ln new) $ Map.keys old

in concatMap (\ ln -> replicate (length' ln new - length' ln old) ln) changes

nodeErr :: Int -> IO ()

nodeErr descr = error $ "node with descriptor " ++ show descr

++ " has no corresponding node in the development graph"

showNodeInfo :: Int -> DGraph -> IO ()

showNodeInfo descr dgraph = do

let dgnode = labDG dgraph descr

title = (if isDGRef dgnode then ("reference " ++) else

if isInternalNode dgnode then ("internal " ++) else id)

"node " ++ getDGNodeName dgnode ++ " " ++ show descr

createTextDisplay title (title ++ "\n" ++ showDoc dgnode "")

{- |

fetches the theory from a node inside the IO Monad

(added by KL based on code in getTheoryOfNode) -}

lookupTheoryOfNode :: LibEnv -> LIB_NAME -> Int

-> IO (Res.Result (LibEnv, Node, G_theory))

lookupTheoryOfNode libEnv ln descr =

return $ do

(libEnv', gth) <- computeTheory True libEnv ln descr

return (libEnv', descr, gth)

showDiagMessAux :: Int -> [Diagnosis] -> IO ()

showDiagMessAux v ds = let es = Res.filterDiags v ds in

if null es then return () else

(if hasErrors es then errorDialog "Error" else infoDialog "Info") $ unlines

$ map show es

showDiagMess :: HetcatsOpts -> [Diagnosis] -> IO ()

showDiagMess = showDiagMessAux . verbose

{- | outputs the theory of a node in a window;

used by the node menu defined in initializeGraph-}

getTheoryOfNode :: GInfo -> Int -> DGraph -> IO ()

getTheoryOfNode gInfo@(GInfo { gi_GraphInfo = actGraphInfo

}) descr dgraph = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let le = i_libEnv ist

ln = i_ln ist

r <- lookupTheoryOfNode le ln descr

case r of

Res.Result ds res -> do

showDiagMess (gi_hetcatsOpts gInfo) ds

case res of

(Just (le', n, gth)) -> do

lockGlobal gInfo

displayTheoryWithWarning "Theory" (getNameOfNode n dgraph)

(addHasInHidingWarning dgraph n) gth

let newGr = lookupDGraph ln le'

history = snd $ splitHistory (lookupDGraph ln le) newGr

applyChanges actGraphInfo $ reverse $ flatHistory history

let nwst = ost { i_state = Just $ist { i_libEnv = le'} }

writeIORef (intState gInfo) nwst

unlockGlobal gInfo

_ -> return ()

{- | translate the theory of a node in a window;

used by the node menu defined in initializeGraph-}

translateTheoryOfNode :: GInfo -> Int -> DGraph -> IO ()

translateTheoryOfNode

gInfo@(GInfo {gi_hetcatsOpts = opts}) node dgraph = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let libEnv = i_libEnv ist

ln = i_ln ist

Res.Result ds mEnv = computeTheory False libEnv ln node

case mEnv of

Just (_, th@(G_theory lid sign _ sens _)) -> do

-- find all comorphism paths starting from lid

let paths = findComorphismPaths logicGraph (sublogicOfTh th)

-- let the user choose one

sel <- listBox "Choose a node logic translation" $ map show paths

case sel of

Nothing -> errorDialog "Error" "no node logic translation chosen"

Just i -> do

Comorphism cid <- return (paths!!i)

-- adjust lid's

let lidS = sourceLogic cid

lidT = targetLogic cid

sign' <- coerceSign lid lidS "" sign

sens' <- coerceThSens lid lidS "" sens

-- translate theory along chosen comorphism

let Result es mTh = wrapMapTheory cid

(plainSign sign', toNamedList sens')

case mTh of

Nothing -> showDiagMess opts es

Just (sign'', sens1) -> displayTheoryWithWarning

"Translated Theory" (getNameOfNode node dgraph)

(addHasInHidingWarning dgraph node)

(G_theory lidT (mkExtSign sign'') startSigId

(toThSens sens1) startThId)

Nothing -> showDiagMess opts ds

-- | Show proof status of a node

showProofStatusOfNode :: GInfo -> Int -> DGraph -> IO ()

showProofStatusOfNode _ descr dgraph = do

let dgnode = labDG dgraph descr

stat = showStatusAux dgnode

title = "Proof status of node "++showName (dgn_name dgnode)

createTextDisplay title stat

showStatusAux :: DGNodeLab -> String

showStatusAux dgnode =

case dgn_theory dgnode of

G_theory _ _ _ sens _ ->

let goals = OMap.filter (not . isAxiom) sens

(proven,open) = OMap.partition isProvenSenStatus goals

consGoal = "\nconservativity of this node"

in "Proven proof goals:\n"

++ showDoc proven ""

++ if not $ hasOpenConsStatus True dgnode

then consGoal

else ""

++ "\nOpen proof goals:\n"

++ showDoc open ""

++ if hasOpenConsStatus False dgnode

then consGoal

else ""

-- | start local theorem proving or consistency checking at a node

proveAtNode :: Maybe Bool -> GInfo -> Int -> DGraph -> IO ()

proveAtNode checkCons gInfo descr dgraph = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let ln = i_ln ist

le = i_libEnv ist

dgn = labDG dgraph descr

libNode = (ln,descr)

(dgraph',dgn') <- case hasLock dgn of

True -> return (dgraph, dgn)

False -> do

lockGlobal gInfo

(dgraph',dgn') <- initLocking (lookupDGraph ln le) (descr, dgn)

let nwle = Map.insert ln dgraph' le

nwst = ost { i_state = Just $ ist { i_libEnv = nwle} }

writeIORef (intState gInfo) nwst

unlockGlobal gInfo

return (dgraph',dgn')

locked <- tryLockLocal dgn'

case locked of

False -> errorDialog "Error" "Proofwindow already open"

True -> do

let checkCons2 = fromMaybe False checkCons

action = do

guiMVar <- newMVar Nothing

res <- basicInferenceNode checkCons logicGraph libNode ln

guiMVar le (intState gInfo)

runProveAtNode checkCons2 gInfo (descr, dgn') res

unlockLocal dgn'

case checkCons2 ||

( isNormalFormNode dgraph' (snd libNode) ||

not (hasIncomingHidingEdge dgraph' $ snd libNode)) of

True -> do

forkIO action

return ()

False -> do

b <- warningDialog "Warning"

("This node has incoming hiding links!\n" ++

"You should compute the normal form first, " ++

"preferably by applying Proofs -> TheoremHideShift," ++

" otherwise the flattened theory may be too weak. " ++

"In particular, disproving and consistency checks " ++

"might produce wrong results. " ++

" Prove anyway?")

$ Just action

unless b $ unlockLocal dgn'

return ()

runProveAtNode :: Bool -> GInfo -> LNode DGNodeLab

-> Res.Result (LibEnv, Res.Result G_theory) -> IO ()

runProveAtNode checkCons gInfo (v, dgnode) res = case maybeResult res of

Just (le, tres) -> do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let ln = i_ln ist

nodetext = getDGNodeName dgnode ++ " node: " ++ show v

when checkCons $ case maybeResult tres of

Just gth -> createTextSaveDisplay

("Model for " ++ nodetext)

"model.log" $ showDoc gth ""

Nothing -> case diags tres of

ds -> infoDialog nodetext

$ unlines $ "could not (re-)construct a model" : map diagString ds

proofMenu gInfo "mergeDGNodeLab" $ mergeDGNodeLab gInfo

(v, labDG (lookupDGraph ln le) v)

mergeHistoryLast2Entries gInfo

Nothing -> showDiagMessAux 2 $ diags res

mergeDGNodeLab :: GInfo -> LNode DGNodeLab -> LibEnv -> IO (Res.Result LibEnv)

mergeDGNodeLab gInfo (v, new_dgn) le = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return (Result [] (Just le))

Just ist -> do

let ln = i_ln ist

dg = lookupDGraph ln le

old_dgn = labDG dg v

return $ do

theory <- joinG_sentences (dgn_theory old_dgn) $ dgn_theory new_dgn

let new_dgn' = old_dgn { dgn_theory = theory }

dg'' = changeDGH dg $ SetNodeLab old_dgn (v, new_dgn')

return $ Map.insert ln dg'' le

-- | print the id, origin, type, proof-status and morphism of the edge

showEdgeInfo :: Int -> Maybe (LEdge DGLinkLab) -> IO ()

showEdgeInfo descr me = case me of

Just e@(_, _, l) -> let estr = showLEdge e in

createTextDisplay ("Info of " ++ estr)

(estr ++ "\n" ++ showDoc l "")

Nothing -> errorDialog "Error"

("edge " ++ show descr ++ " has no corresponding edge"

++ "in the development graph")

conservativityRule :: DGRule

conservativityRule = DGRule "ConservativityCheck"

-- | check conservativity of the edge

checkconservativityOfEdge :: Int -> GInfo -> Maybe (LEdge DGLinkLab) -> IO ()

checkconservativityOfEdge _ gInfo@(GInfo{ gi_GraphInfo = actGraphInfo})

(Just (source,target,linklab)) = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let ln = i_ln ist

libEnv = i_libEnv ist

lockGlobal gInfo

let libEnv' = case convertToNf ln libEnv target of

Result _ (Just lE) -> lE

_ -> error "checkconservativityOfEdge: convertToNf"

let (_, thTar) =

case computeTheory True libEnv' ln target of

Res.Result _ (Just th1) -> th1

_ -> error "checkconservativityOfEdge: computeTheory"

G_theory lid _sign _ sensTar _ <- return thTar

GMorphism cid _ _ morphism2 _ <- return $ dgl_morphism linklab

Just (GMorphism cid' _ _ morphism3 _) <- return $

dgn_sigma $ labDG (lookupDGraph ln libEnv') target

morphism2' <- coerceMorphism (targetLogic cid) lid

"checkconservativityOfEdge2" morphism2

morphism3' <- coerceMorphism (targetLogic cid') lid

"checkconservativityOfEdge3" morphism3

let compMor = case comp morphism2' morphism3' of

Res.Result _ (Just phi) -> phi

_ -> error "checkconservativtiyOfEdge: comp"

let (_le', thSrc) =

case computeTheory False libEnv' ln source of

Res.Result _ (Just th1) -> th1

_ -> error "checkconservativityOfEdge: computeTheory"

G_theory lid1 sign1 _ sensSrc1 _ <- return thSrc

sign2 <- coerceSign lid1 lid "checkconservativityOfEdge.coerceSign" sign1

sensSrc2 <- coerceThSens lid1 lid "checkconservativityOfEdge1" sensSrc1

let transSensSrc = propagateErrors

$ mapThSensValueM (map_sen lid compMor) sensSrc2

if length (conservativityCheck lid) < 1

then

do

errorDialog "Result of conservativity check"

"No conservativity checkers available"

let nwst = ost {i_state = Just $ist{ i_libEnv=libEnv'}}

writeIORef (intState gInfo) nwst

unlockGlobal gInfo

else

do

checkerR <- conservativityChoser $ conservativityCheck lid

if Res.hasErrors $ Res.diags checkerR

then

do

errorDialog "Result of conservativity check"

"No conservativity checker chosen"

let nwst = ost {i_state = Just $ ist { i_libEnv = libEnv'}}

writeIORef (intState gInfo) nwst

unlockGlobal gInfo

else

do

let chCons = checkConservativity $

fromMaybe (error "checkconservativityOfEdge4")

$ Res.maybeResult checkerR

Res.Result ds res =

chCons

(plainSign sign2, toNamedList sensSrc2)

compMor $ toNamedList

(sensTar `OMap.difference` transSensSrc)

showObls [] = ""

showObls obls= ", provided that the following proof obligations "

++ "can be discharged:\n"

++ concatMap (flip showDoc "\n") obls

showRes = case res of

Just (Just (cst, obls)) -> "The link is "

++ showConsistencyStatus cst ++ showObls obls

_ -> "Could not determine whether link is conservative"

myDiags = showRelDiags 2 ds

createTextDisplay "Result of conservativity check"

(showRes ++ "\n" ++ myDiags)

let consShow = case res of

Just (Just (cst, _)) -> cst

_ -> Unknown "Unknown"

consNew csv = if show csv == showToComply consShow

then

Proven conservativityRule emptyProofBasis

else

LeftOpen

(newDglType, change) = case dgl_type linklab of

GlobalThm proven conserv _ ->

(GlobalThm proven conserv $ consNew conserv, True)

LocalThm proven conserv _ ->

(LocalThm proven conserv $ consNew conserv, True)

t -> (t, False)

provenEdge = (source

,target

,linklab

{

dgl_type = newDglType

}

)

changes = if change then [ DeleteEdge (source,target,linklab)

, InsertEdge provenEdge ] else []

newGr = lookupDGraph ln libEnv'

nextGr = changesDGH newGr changes

newLibEnv = Map.insert ln

(groupHistory newGr conservativityRule nextGr) libEnv'

history = snd $ splitHistory (lookupDGraph ln libEnv) nextGr

applyChanges actGraphInfo $ reverse

$ flatHistory history

GA.redisplay actGraphInfo

let nwst = ost { i_state = Just $ ist { i_libEnv = newLibEnv}}

writeIORef (intState gInfo) nwst

unlockGlobal gInfo

checkconservativityOfEdge descr _ Nothing =

errorDialog "Error"

("edge " ++ show descr ++ " has no corresponding edge "

++ "in the development graph")

-- | Graphical choser for conservativity checkers

conservativityChoser :: [ConservativityChecker sign sentence morphism]

-> IO

(Res.Result (ConservativityChecker

sign sentence morphism))

conservativityChoser checkers = case checkers of

[] -> return $ fail "No conservativity checkers available"

[hd] -> return $ return hd

_ ->

do

chosenOne <- listBox "Pick a conservativity checker"

$ map checker_id checkers

case chosenOne of

Nothing -> return $ fail "No conservativity checker chosen"

Just i -> return $ return $ checkers !! i

-- | converts a DGraph

convert :: GA.GraphInfo -> DGraph -> IO ()

convert ginfo dgraph = do

convertNodes ginfo dgraph

convertEdges ginfo dgraph

{- | converts the nodes of the development graph, if it has any,

and returns the resulting conversion maps

if the graph is empty the conversion maps are returned unchanged-}

convertNodes :: GA.GraphInfo -> DGraph -> IO ()

convertNodes ginfo = mapM_ (convertNodesAux ginfo) .labNodesDG

{- | auxiliary function for convertNodes if the given list of nodes is

emtpy, it returns the conversion maps unchanged otherwise it adds the

converted first node to the abstract graph and to the affected

conversion maps and afterwards calls itself with the remaining node

list -}

convertNodesAux :: GA.GraphInfo -> LNode DGNodeLab -> IO ()

convertNodesAux ginfo (node, dgnode) =

GA.addNode ginfo node (getRealDGNodeType dgnode) $ getDGNodeName dgnode

{- | converts the edges of the development graph

works the same way as convertNods does-}

convertEdges :: GA.GraphInfo -> DGraph -> IO ()

convertEdges ginfo = mapM_ (convertEdgesAux ginfo) . labEdgesDG

-- | auxiliary function for convertEges

convertEdgesAux :: GA.GraphInfo -> LEdge DGLinkLab -> IO ()

convertEdgesAux ginfo e@(src, tar, lbl) =

GA.addEdge ginfo (dgl_id lbl) (getRealDGLinkType lbl) src tar "" $ Just e

-- | show library referened by a DGRef node (=node drawn as a box)

showReferencedLibrary :: Int -> GInfo -> ConvFunc -> LibFunc -> IO ()

showReferencedLibrary descr gInfo

convGraph showLib = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let ln = i_ln ist

le = i_libEnv ist

refNode = labDG (lookupDGraph ln le) descr

refLibname = if isDGRef refNode then dgn_libname refNode

else error "showReferencedLibrary"

case Map.lookup refLibname le of

Just _ -> do

gInfo' <- copyGInfo gInfo refLibname

convGraph gInfo' "development graph" showLib

let gv = gi_GraphInfo gInfo'

GA.deactivateGraphWindow gv

hideNodes gInfo'

GA.redisplay gv

GA.layoutImproveAll gv

GA.showTemporaryMessage gv "Development Graph initialized."

GA.activateGraphWindow gv

return ()

Nothing -> error $ "The referenced library (" ++ show refLibname

++ ") is unknown"

-- | apply the changes of first history item (computed by proof rules,

-- see folder Proofs) to the displayed development graph

applyChanges :: GA.GraphInfo -> [DGChange] -> IO ()

applyChanges ginfo = mapM_ (applyChangesAux ginfo) . removeContraryChanges

-- | auxiliary function for applyChanges

applyChangesAux :: GA.GraphInfo -> DGChange -> IO ()

applyChangesAux ginfo change =

case change of

SetNodeLab _ (node, newLab) ->

GA.changeNodeType ginfo node $ getRealDGNodeType newLab

InsertNode (node, nodelab) ->

GA.addNode ginfo node (getRealDGNodeType nodelab) $ getDGNodeName nodelab

DeleteNode (node, _) ->

GA.delNode ginfo node

InsertEdge e@(src, tgt, lbl) ->

GA.addEdge ginfo (dgl_id lbl) (getRealDGLinkType lbl) src tgt "" $ Just e

DeleteEdge (_, _, lbl) ->

GA.delEdge ginfo $ dgl_id lbl

-- | display a window of translated graph with maximal sublogic.

openTranslateGraph :: LibEnv -> LIB_NAME -> HetcatsOpts

-> Res.Result G_sublogics -> ConvFunc -> LibFunc -> IO ()

openTranslateGraph libEnv ln opts (Res.Result diagsSl mSublogic) convGraph

showLib =

-- if an error existed by the search of maximal sublogicn

-- (see DGTranslation.getDGLogic), the process need not to go on.

let myErrMess = showDiagMess opts in

if hasErrors diagsSl then myErrMess diagsSl else case mSublogic of

Nothing -> errorDialog "Error" "the maximal sublogic is not found."

Just sublogic -> do

let paths = findComorphismPaths logicGraph sublogic

if null paths then

errorDialog "Error" "This graph has no comorphism to translation."

else do

-- the user choose one

sel <- listBox "Choose a logic translation"

$ map show paths

case sel of

Nothing -> errorDialog "Error" "no logic translation chosen"

Just j -> do

-- graph translation.

let Res.Result diagsTrans mLEnv =

libEnv_translation libEnv $ paths !! j

case mLEnv of

Just newLibEnv -> do

showDiagMess opts $ diagsSl ++ diagsTrans

dg_showGraphAux

(\gI -> do

ost <- readIORef $ intState gI

let nwst = case i_state ost of

Nothing -> ost

Just ist ->

ost{i_state = Just ist{

i_libEnv = newLibEnv,

i_ln = ln }}

writeIORef (intState gI) nwst

convGraph (gI{ gi_hetcatsOpts = opts})

"translation Graph" showLib)

Nothing -> myErrMess $ diagsSl ++ diagsTrans

dg_showGraphAux :: (GInfo -> IO ()) -> IO ()

dg_showGraphAux convFct = do

useHTk -- All messages are displayed in TK dialog windows

-- from this point on

gInfo <- emptyGInfo

convFct gInfo

let actGraphInfo = gi_GraphInfo gInfo

GA.deactivateGraphWindow actGraphInfo

GA.redisplay actGraphInfo

GA.layoutImproveAll actGraphInfo

GA.activateGraphWindow actGraphInfo

-- DaVinciGraph to String

-- Functions to convert a DaVinciGraph to a String to store as a .udg file

-- | saves the uDrawGraph graph to a file

saveUDGraph :: GInfo -> Map.Map DGNodeType (Shape value, String)

-> Map.Map DGEdgeType (EdgePattern GA.EdgeValue, String) -> IO ()

saveUDGraph gInfo@(GInfo { gi_GraphInfo = graphInfo

, gi_hetcatsOpts = opts

}) nodemap linkmap = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return ()

Just ist -> do

let ln = i_ln ist

maybeFilePath <- fileSaveDialog ((rmSuffix $ libNameToFile opts ln) ++ ".udg")

[ ("uDrawGraph",["*.udg"])

, ("All Files", ["*"])] Nothing

case maybeFilePath of

Just filepath -> do

GA.showTemporaryMessage graphInfo "Converting graph..."

nstring <- nodes2String gInfo nodemap linkmap

writeFile filepath nstring

GA.showTemporaryMessage graphInfo $ "Graph stored to " ++ filepath ++ "!"

Nothing -> GA.showTemporaryMessage graphInfo "Aborted!"

-- | Converts the nodes of the graph to String representation

nodes2String :: GInfo -> Map.Map DGNodeType (Shape value, String)

-> Map.Map DGEdgeType (EdgePattern GA.EdgeValue, String)

-> IO String

nodes2String gInfo@(GInfo { gi_GraphInfo = graphInfo }) nodemap linkmap = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return []

Just ist -> do

let le = i_libEnv ist

ln = i_ln ist

nodes <- filterM (\(n,_) -> do b <- GA.isHiddenNode graphInfo n

return $ not b)

$ labNodesDG $ lookupDGraph ln le

nstring <- foldM (\s node -> do

s' <- (node2String gInfo nodemap linkmap node)

return $ s ++ (if s /= "" then ",\n " else "") ++ s')

"" nodes

return $ "[" ++ nstring ++ "]"

-- | Converts a node to String representation

node2String :: GInfo -> Map.Map DGNodeType (Shape value, String)

-> Map.Map DGEdgeType (EdgePattern GA.EdgeValue, String)

-> LNode DGNodeLab -> IO String

node2String gInfo nodemap linkmap (nid, dgnode) = do

label <- getNodeLabel gInfo dgnode

let ntype = getRealDGNodeType dgnode

(shape, color) <- case Map.lookup ntype nodemap of

Nothing -> error $ "SaveGraph: can't lookup nodetype: " ++ show ntype

Just (s, c) -> return (s, c)

let

object = "a(\"OBJECT\",\"" ++ label ++ "\"),"

color' = "a(\"COLOR\",\"" ++ color ++ "\"),"

shape' = "a(\"_GO\",\"" ++ map toLower (show shape) ++ "\")"

links <- links2String gInfo linkmap nid

return $ "l(\"" ++ show nid ++ "\",n(\"" ++ show ntype ++ "\","

++ "[" ++ object ++ color' ++ shape' ++ "],"

++ "\n [" ++ links ++ "]))"

-- | Converts all links of a node to String representation

links2String :: GInfo -> Map.Map DGEdgeType (EdgePattern GA.EdgeValue, String)

-> Int -> IO String

links2String gInfo@(GInfo { gi_GraphInfo = graphInfo

}) linkmap nodeid = do

ost <- readIORef $ intState gInfo

case i_state ost of

Nothing -> return []

Just ist -> do

let ln = i_ln ist

le = i_libEnv ist

edges <- filterM (\ (src, _, edge) -> do

let eid = dgl_id edge

b <- GA.isHiddenEdge graphInfo eid

return $ not b && src == nodeid)

$ labEdgesDG $ lookupDGraph ln le

foldM (\ s edge -> do

s' <- link2String linkmap edge

return $ s ++ (if s /= "" then ",\n " else "") ++ s') "" edges

-- | Converts a link to String representation

link2String :: Map.Map DGEdgeType (EdgePattern GA.EdgeValue, String)

-> LEdge DGLinkLab -> IO String

link2String linkmap (nodeid1, nodeid2, edge) = do

let (EdgeId linkid) = dgl_id edge

ltype = getRealDGLinkType edge

(line, color) <- case Map.lookup ltype linkmap of

Nothing -> error $ "SaveGraph: can't lookup linktype: " ++ show ltype

Just (l, c) -> return (l, c)

let

nm = "\"" ++ show linkid ++ ":" ++ show nodeid1 ++ "->"

++ show nodeid2 ++ "\""

color' = "a(\"EDGECOLOR\",\"" ++ color ++ "\"),"

line' = "a(\"EDGEPATTERN\",\"" ++ map toLower (show line) ++ "\")"

return $ "l(" ++ nm ++ ",e(\"" ++ show ltype ++ "\","

++ "[" ++ color' ++ line' ++"],"

++ "r(\"" ++ show nodeid2 ++ "\")))"

-- | Returns the name of the Node

getNodeLabel :: GInfo -> DGNodeLab -> IO String

getNodeLabel (GInfo {internalNamesIORef = ioRefInternal}) dgnode = do

internal <- readIORef ioRefInternal

let ntype = getDGNodeType dgnode

return $ if (not $ showNames internal) &&

elem ntype ["open_cons__internal"

, "proven_cons__internal"

, "locallyEmpty__open_cons__internal"

, "locallyEmpty__proven_cons__internal"]

then "" else getDGNodeName dgnode