| Copyright | (c) Christian Maeder and DFKI GmbH 2009 |
|---|---|
| License | GPLv2 or higher, see LICENSE.txt |
| Maintainer | Christian.Maeder@dfki.de |
| Stability | provisional |
| Portability | non-portable(Logic) |
| Safe Haskell | None |
Static.ComputeTheory
Description
compute the theory of a node
Synopsis
- computeTheory :: LibEnv -> LibName -> Node -> Maybe G_theory
- globalNodeTheory :: DGraph -> Node -> Maybe G_theory
- getGlobalTheory :: DGNodeLab -> Result G_theory
- recomputeNodeLabel :: LibEnv -> LibName -> DGraph -> LNode DGNodeLab -> DGNodeLab
- theoremsToAxioms :: G_theory -> G_theory
- computeDGraphTheories :: LibEnv -> LibName -> DGraph -> DGraph
- computeLibEnvTheories :: LibEnv -> LibEnv
- computeLabelTheory :: LibEnv -> LibName -> DGraph -> LNode DGNodeLab -> Maybe G_theory
- updateLabelTheory :: LibEnv -> LibName -> DGraph -> LNode DGNodeLab -> G_theory -> DGraph
- markHiding :: LibEnv -> DGraph -> DGraph
- markFree :: LibEnv -> DGraph -> DGraph
- renumberDGLinks :: EdgeId -> EdgeId -> DGraph -> DGraph
- getImportNames :: DGraph -> Node -> [String]
Documentation
globalNodeTheory :: DGraph -> Node -> Maybe G_theory Source #
theoremsToAxioms :: G_theory -> G_theory Source #
computeLibEnvTheories :: LibEnv -> LibEnv Source #
markFree :: LibEnv -> DGraph -> DGraph Source #
mark all nodes if they have incoming hiding edges. Assume reference nodes to other libraries being properly marked already.
renumberDGLinks :: EdgeId -> EdgeId -> DGraph -> DGraph Source #
iterate all edgeId entries of the dg and increase all that are equal or above the old lId (1st param) so they will be above the desired nextLId (2nd param)
getImportNames :: DGraph -> Node -> [String] Source #