Copyright | (c) DFKI GmbH 2011 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | Christian.Maeder@dfki.de |
Stability | provisional |
Portability | portable |
Safe Haskell | None |
Synopsis
- data XPathPart
- = ElemName String
- | ChildIndex Int
- data NodeName = NodeName {}
- readXPath :: MonadFail m => String -> m [XPathPart]
- readXPathComp :: MonadFail m => String -> m XPathPart
- isInternal :: NodeName -> Bool
- hasOpenConsStatus :: Bool -> ConsStatus -> Bool
- data DGNodeType = DGNodeType {
- isRefType :: Bool
- isProvenNode :: Bool
- isProvenCons :: Bool
- isInternalSpec :: Bool
- listDGNodeTypes :: [DGNodeType]
- data NodeMod = NodeMod {}
- unMod :: NodeMod
- delAxMod :: NodeMod
- delThMod :: NodeMod
- delSenMod :: NodeMod
- addSenMod :: NodeMod
- senMod :: NodeMod
- delSymMod :: NodeMod
- addSymMod :: NodeMod
- symMod :: NodeMod
- mergeNodeMod :: NodeMod -> NodeMod -> NodeMod
- newtype EdgeId = EdgeId {
- getEdgeNum :: Int
- incEdgeId :: EdgeId -> EdgeId
- startEdgeId :: EdgeId
- showEdgeId :: EdgeId -> String
- newtype ProofBasis = ProofBasis {
- proofBasis :: Set EdgeId
- data DGRule
- = DGRule String
- | DGRuleWithEdge String EdgeId
- | DGRuleLocalInference [(String, String)]
- | Composition [EdgeId]
- data ThmLinkStatus
- isProvenThmLinkStatus :: ThmLinkStatus -> Bool
- proofBasisOfThmLinkStatus :: ThmLinkStatus -> ProofBasis
- updProofBasisOfThmLinkStatus :: ThmLinkStatus -> ProofBasis -> ThmLinkStatus
- data Scope
- data LinkKind
- data FreeOrCofree
- fcList :: [FreeOrCofree]
- data ConsStatus = ConsStatus {}
- isProvenConsStatusLink :: ConsStatus -> Bool
- mkConsStatus :: Conservativity -> ConsStatus
- getConsOfStatus :: ConsStatus -> Conservativity
- showConsStatus :: ConsStatus -> String
- getDGEdgeTypeName :: DGEdgeType -> String
- revertDGEdgeTypeName :: String -> DGEdgeType
- getDGEdgeTypeModIncName :: DGEdgeTypeModInc -> String
- data DGEdgeType = DGEdgeType {
- edgeTypeModInc :: DGEdgeTypeModInc
- isInc :: Bool
- data DGEdgeTypeModInc
- = GlobalDef
- | HetDef
- | HidingDef
- | LocalDef
- | FreeOrCofreeDef FreeOrCofree
- | ThmType {
- thmEdgeType :: ThmTypes
- isProvenEdge :: Bool
- isConservativ :: Bool
- isPending :: Bool
- data ThmTypes
- listDGEdgeTypes :: [DGEdgeType]
- isDefEdgeType :: DGEdgeType -> Bool
- data RTPointer
- mapRTNodes :: Map Int Int -> RTPointer -> RTPointer
- compPointer :: RTPointer -> RTPointer -> RTPointer
- refSource :: RTPointer -> Int
- data RTLeaves
- refTarget :: RTPointer -> RTLeaves
- emptyNodeName :: NodeName
- showExt :: NodeName -> String
- showName :: NodeName -> String
- makeRgName :: IRI -> Range -> NodeName
- makeName :: IRI -> NodeName
- setSrcRange :: Range -> NodeName -> NodeName
- parseNodeName :: String -> NodeName
- incBy :: Int -> NodeName -> NodeName
- inc :: NodeName -> NodeName
- extName :: String -> NodeName -> NodeName
- defaultEdgeId :: EdgeId
- emptyProofBasis :: ProofBasis
- nullProofBasis :: ProofBasis -> Bool
- addEdgeId :: ProofBasis -> EdgeId -> ProofBasis
- delEdgeId :: ProofBasis -> EdgeId -> ProofBasis
- updEdgeId :: ProofBasis -> EdgeId -> EdgeId -> ProofBasis
- edgeInProofBasis :: EdgeId -> ProofBasis -> Bool
- topsortedLibsWithImports :: Rel LibName -> [LibName]
- getMapAndMaxIndex :: Ord k => k -> (b -> Map k a) -> b -> (Map k a, k)
- liftOr :: (a -> Bool) -> (a -> Bool) -> a -> Bool
node label types
ElemName String | |
ChildIndex Int |
Instances
Data XPathPart Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> XPathPart -> c XPathPart gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c XPathPart toConstr :: XPathPart -> Constr dataTypeOf :: XPathPart -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c XPathPart) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c XPathPart) gmapT :: (forall b. Data b => b -> b) -> XPathPart -> XPathPart gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> XPathPart -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> XPathPart -> r gmapQ :: (forall d. Data d => d -> u) -> XPathPart -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> XPathPart -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> XPathPart -> m XPathPart gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> XPathPart -> m XPathPart gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> XPathPart -> m XPathPart | |
Show XPathPart Source # | |
ShATermLG XPathPart Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> XPathPart -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, XPathPart) Source # |
name of a node in a DG; auxiliary nodes may have extension string and non-zero number (for these, names are usually hidden).
Instances
Eq NodeName Source # | |
Data NodeName Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NodeName -> c NodeName gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NodeName toConstr :: NodeName -> Constr dataTypeOf :: NodeName -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NodeName) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NodeName) gmapT :: (forall b. Data b => b -> b) -> NodeName -> NodeName gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NodeName -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NodeName -> r gmapQ :: (forall d. Data d => d -> u) -> NodeName -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> NodeName -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> NodeName -> m NodeName gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeName -> m NodeName gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeName -> m NodeName | |
Ord NodeName Source # | |
Show NodeName Source # | |
Pretty NodeName Source # | |
ShATermLG NodeName Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> NodeName -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, NodeName) Source # |
readXPathComp :: MonadFail m => String -> m XPathPart Source #
isInternal :: NodeName -> Bool Source #
hasOpenConsStatus :: Bool -> ConsStatus -> Bool Source #
test if a conservativity is open, return input for None
data DGNodeType Source #
DGNodeType | |
|
Instances
Eq DGNodeType Source # | |
Defined in Static.DgUtils (==) :: DGNodeType -> DGNodeType -> Bool (/=) :: DGNodeType -> DGNodeType -> Bool | |
Data DGNodeType Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DGNodeType -> c DGNodeType gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DGNodeType toConstr :: DGNodeType -> Constr dataTypeOf :: DGNodeType -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DGNodeType) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DGNodeType) gmapT :: (forall b. Data b => b -> b) -> DGNodeType -> DGNodeType gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DGNodeType -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DGNodeType -> r gmapQ :: (forall d. Data d => d -> u) -> DGNodeType -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> DGNodeType -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> DGNodeType -> m DGNodeType gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DGNodeType -> m DGNodeType gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DGNodeType -> m DGNodeType | |
Ord DGNodeType Source # | |
Defined in Static.DgUtils compare :: DGNodeType -> DGNodeType -> Ordering (<) :: DGNodeType -> DGNodeType -> Bool (<=) :: DGNodeType -> DGNodeType -> Bool (>) :: DGNodeType -> DGNodeType -> Bool (>=) :: DGNodeType -> DGNodeType -> Bool max :: DGNodeType -> DGNodeType -> DGNodeType min :: DGNodeType -> DGNodeType -> DGNodeType | |
Show DGNodeType Source # | |
Defined in Static.DgUtils showsPrec :: Int -> DGNodeType -> ShowS show :: DGNodeType -> String showList :: [DGNodeType] -> ShowS | |
ShATermLG DGNodeType Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> DGNodeType -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, DGNodeType) Source # |
listDGNodeTypes :: [DGNodeType] Source #
node modifications
Instances
Eq NodeMod Source # | |
Data NodeMod Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NodeMod -> c NodeMod gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NodeMod dataTypeOf :: NodeMod -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NodeMod) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NodeMod) gmapT :: (forall b. Data b => b -> b) -> NodeMod -> NodeMod gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NodeMod -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NodeMod -> r gmapQ :: (forall d. Data d => d -> u) -> NodeMod -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> NodeMod -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> NodeMod -> m NodeMod gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeMod -> m NodeMod gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeMod -> m NodeMod | |
Ord NodeMod Source # | |
Show NodeMod Source # | |
ShATermLG NodeMod Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> NodeMod -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, NodeMod) Source # |
edge types
unique number for edges
EdgeId | |
|
Instances
Eq EdgeId Source # | |
Data EdgeId Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EdgeId -> c EdgeId gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EdgeId dataTypeOf :: EdgeId -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EdgeId) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EdgeId) gmapT :: (forall b. Data b => b -> b) -> EdgeId -> EdgeId gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EdgeId -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EdgeId -> r gmapQ :: (forall d. Data d => d -> u) -> EdgeId -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> EdgeId -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> EdgeId -> m EdgeId gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EdgeId -> m EdgeId gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EdgeId -> m EdgeId | |
Ord EdgeId Source # | |
Show EdgeId Source # | |
Pretty EdgeId Source # | |
ShATermLG EdgeId Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> EdgeId -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, EdgeId) Source # | |
Eq (DaVinciArc EdgeValue) | |
startEdgeId :: EdgeId Source #
the first edge in a graph
showEdgeId :: EdgeId -> String Source #
newtype ProofBasis Source #
a set of used edges
ProofBasis | |
|
Instances
Eq ProofBasis Source # | |
Defined in Static.DgUtils (==) :: ProofBasis -> ProofBasis -> Bool (/=) :: ProofBasis -> ProofBasis -> Bool | |
Data ProofBasis Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ProofBasis -> c ProofBasis gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ProofBasis toConstr :: ProofBasis -> Constr dataTypeOf :: ProofBasis -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ProofBasis) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ProofBasis) gmapT :: (forall b. Data b => b -> b) -> ProofBasis -> ProofBasis gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ProofBasis -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ProofBasis -> r gmapQ :: (forall d. Data d => d -> u) -> ProofBasis -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ProofBasis -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ProofBasis -> m ProofBasis gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ProofBasis -> m ProofBasis gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ProofBasis -> m ProofBasis | |
Ord ProofBasis Source # | |
Defined in Static.DgUtils compare :: ProofBasis -> ProofBasis -> Ordering (<) :: ProofBasis -> ProofBasis -> Bool (<=) :: ProofBasis -> ProofBasis -> Bool (>) :: ProofBasis -> ProofBasis -> Bool (>=) :: ProofBasis -> ProofBasis -> Bool max :: ProofBasis -> ProofBasis -> ProofBasis min :: ProofBasis -> ProofBasis -> ProofBasis | |
Show ProofBasis Source # | |
Defined in Static.DgUtils showsPrec :: Int -> ProofBasis -> ShowS show :: ProofBasis -> String showList :: [ProofBasis] -> ShowS | |
ShATermLG ProofBasis Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> ProofBasis -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, ProofBasis) Source # |
Rules in the development graph calculus, Sect. IV:4.4 of the CASL Reference Manual explains them in depth
DGRule String | |
DGRuleWithEdge String EdgeId | |
DGRuleLocalInference [(String, String)] | |
Composition [EdgeId] |
Instances
Eq DGRule Source # | |
Data DGRule Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DGRule -> c DGRule gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DGRule dataTypeOf :: DGRule -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DGRule) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DGRule) gmapT :: (forall b. Data b => b -> b) -> DGRule -> DGRule gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DGRule -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DGRule -> r gmapQ :: (forall d. Data d => d -> u) -> DGRule -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> DGRule -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> DGRule -> m DGRule gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DGRule -> m DGRule gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DGRule -> m DGRule | |
Ord DGRule Source # | |
Show DGRule Source # | |
Pretty DGRule Source # | |
ShATermLG DGRule Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> DGRule -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, DGRule) Source # |
data ThmLinkStatus Source #
proof status of a link
Instances
Eq ThmLinkStatus Source # | |
Defined in Static.DgUtils (==) :: ThmLinkStatus -> ThmLinkStatus -> Bool (/=) :: ThmLinkStatus -> ThmLinkStatus -> Bool | |
Data ThmLinkStatus Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ThmLinkStatus -> c ThmLinkStatus gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ThmLinkStatus toConstr :: ThmLinkStatus -> Constr dataTypeOf :: ThmLinkStatus -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ThmLinkStatus) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ThmLinkStatus) gmapT :: (forall b. Data b => b -> b) -> ThmLinkStatus -> ThmLinkStatus gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ThmLinkStatus -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ThmLinkStatus -> r gmapQ :: (forall d. Data d => d -> u) -> ThmLinkStatus -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ThmLinkStatus -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ThmLinkStatus -> m ThmLinkStatus gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ThmLinkStatus -> m ThmLinkStatus gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ThmLinkStatus -> m ThmLinkStatus | |
Ord ThmLinkStatus Source # | |
Defined in Static.DgUtils compare :: ThmLinkStatus -> ThmLinkStatus -> Ordering (<) :: ThmLinkStatus -> ThmLinkStatus -> Bool (<=) :: ThmLinkStatus -> ThmLinkStatus -> Bool (>) :: ThmLinkStatus -> ThmLinkStatus -> Bool (>=) :: ThmLinkStatus -> ThmLinkStatus -> Bool max :: ThmLinkStatus -> ThmLinkStatus -> ThmLinkStatus min :: ThmLinkStatus -> ThmLinkStatus -> ThmLinkStatus | |
Show ThmLinkStatus Source # | |
Defined in Static.DgUtils showsPrec :: Int -> ThmLinkStatus -> ShowS show :: ThmLinkStatus -> String showList :: [ThmLinkStatus] -> ShowS | |
Pretty ThmLinkStatus Source # | |
Defined in Static.PrintDevGraph pretty :: ThmLinkStatus -> Doc Source # pretties :: [ThmLinkStatus] -> Doc Source # | |
ShATermLG ThmLinkStatus Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> ThmLinkStatus -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, ThmLinkStatus) Source # |
isProvenThmLinkStatus :: ThmLinkStatus -> Bool Source #
Instances
Eq Scope Source # | |
Data Scope Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Scope -> c Scope gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Scope dataTypeOf :: Scope -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Scope) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Scope) gmapT :: (forall b. Data b => b -> b) -> Scope -> Scope gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Scope -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Scope -> r gmapQ :: (forall d. Data d => d -> u) -> Scope -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Scope -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Scope -> m Scope gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Scope -> m Scope gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Scope -> m Scope | |
Ord Scope Source # | |
Show Scope Source # | |
ShATermLG Scope Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> Scope -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, Scope) Source # |
Instances
Eq LinkKind Source # | |
Data LinkKind Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LinkKind -> c LinkKind gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LinkKind toConstr :: LinkKind -> Constr dataTypeOf :: LinkKind -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LinkKind) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LinkKind) gmapT :: (forall b. Data b => b -> b) -> LinkKind -> LinkKind gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LinkKind -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LinkKind -> r gmapQ :: (forall d. Data d => d -> u) -> LinkKind -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> LinkKind -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> LinkKind -> m LinkKind gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LinkKind -> m LinkKind gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LinkKind -> m LinkKind | |
Ord LinkKind Source # | |
Show LinkKind Source # | |
ShATermLG LinkKind Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> LinkKind -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, LinkKind) Source # |
data FreeOrCofree Source #
Instances
Bounded FreeOrCofree Source # | |
Defined in Static.DgUtils | |
Enum FreeOrCofree Source # | |
Defined in Static.DgUtils succ :: FreeOrCofree -> FreeOrCofree pred :: FreeOrCofree -> FreeOrCofree toEnum :: Int -> FreeOrCofree fromEnum :: FreeOrCofree -> Int enumFrom :: FreeOrCofree -> [FreeOrCofree] enumFromThen :: FreeOrCofree -> FreeOrCofree -> [FreeOrCofree] enumFromTo :: FreeOrCofree -> FreeOrCofree -> [FreeOrCofree] enumFromThenTo :: FreeOrCofree -> FreeOrCofree -> FreeOrCofree -> [FreeOrCofree] | |
Eq FreeOrCofree Source # | |
Defined in Static.DgUtils (==) :: FreeOrCofree -> FreeOrCofree -> Bool (/=) :: FreeOrCofree -> FreeOrCofree -> Bool | |
Data FreeOrCofree Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FreeOrCofree -> c FreeOrCofree gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FreeOrCofree toConstr :: FreeOrCofree -> Constr dataTypeOf :: FreeOrCofree -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FreeOrCofree) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FreeOrCofree) gmapT :: (forall b. Data b => b -> b) -> FreeOrCofree -> FreeOrCofree gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FreeOrCofree -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FreeOrCofree -> r gmapQ :: (forall d. Data d => d -> u) -> FreeOrCofree -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> FreeOrCofree -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> FreeOrCofree -> m FreeOrCofree gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FreeOrCofree -> m FreeOrCofree gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FreeOrCofree -> m FreeOrCofree | |
Ord FreeOrCofree Source # | |
Defined in Static.DgUtils compare :: FreeOrCofree -> FreeOrCofree -> Ordering (<) :: FreeOrCofree -> FreeOrCofree -> Bool (<=) :: FreeOrCofree -> FreeOrCofree -> Bool (>) :: FreeOrCofree -> FreeOrCofree -> Bool (>=) :: FreeOrCofree -> FreeOrCofree -> Bool max :: FreeOrCofree -> FreeOrCofree -> FreeOrCofree min :: FreeOrCofree -> FreeOrCofree -> FreeOrCofree | |
Read FreeOrCofree Source # | |
Defined in Static.DgUtils readsPrec :: Int -> ReadS FreeOrCofree readList :: ReadS [FreeOrCofree] readPrec :: ReadPrec FreeOrCofree readListPrec :: ReadPrec [FreeOrCofree] | |
Show FreeOrCofree Source # | |
Defined in Static.DgUtils showsPrec :: Int -> FreeOrCofree -> ShowS show :: FreeOrCofree -> String showList :: [FreeOrCofree] -> ShowS | |
ShATermLG FreeOrCofree Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> FreeOrCofree -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, FreeOrCofree) Source # |
fcList :: [FreeOrCofree] Source #
data ConsStatus Source #
required and proven conservativity (with a proof)
Instances
Eq ConsStatus Source # | |
Defined in Static.DgUtils (==) :: ConsStatus -> ConsStatus -> Bool (/=) :: ConsStatus -> ConsStatus -> Bool | |
Data ConsStatus Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ConsStatus -> c ConsStatus gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ConsStatus toConstr :: ConsStatus -> Constr dataTypeOf :: ConsStatus -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ConsStatus) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ConsStatus) gmapT :: (forall b. Data b => b -> b) -> ConsStatus -> ConsStatus gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ConsStatus -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ConsStatus -> r gmapQ :: (forall d. Data d => d -> u) -> ConsStatus -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ConsStatus -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ConsStatus -> m ConsStatus gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ConsStatus -> m ConsStatus gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ConsStatus -> m ConsStatus | |
Ord ConsStatus Source # | |
Defined in Static.DgUtils compare :: ConsStatus -> ConsStatus -> Ordering (<) :: ConsStatus -> ConsStatus -> Bool (<=) :: ConsStatus -> ConsStatus -> Bool (>) :: ConsStatus -> ConsStatus -> Bool (>=) :: ConsStatus -> ConsStatus -> Bool max :: ConsStatus -> ConsStatus -> ConsStatus min :: ConsStatus -> ConsStatus -> ConsStatus | |
Show ConsStatus Source # | |
Defined in Static.DgUtils showsPrec :: Int -> ConsStatus -> ShowS show :: ConsStatus -> String showList :: [ConsStatus] -> ShowS | |
Pretty ConsStatus Source # | |
Defined in Static.PrintDevGraph pretty :: ConsStatus -> Doc Source # pretties :: [ConsStatus] -> Doc Source # | |
ShATermLG ConsStatus Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> ConsStatus -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, ConsStatus) Source # |
isProvenConsStatusLink :: ConsStatus -> Bool Source #
showConsStatus :: ConsStatus -> String Source #
to be displayed as edge label
getDGEdgeTypeName :: DGEdgeType -> String Source #
converts a DGEdgeType to a String
revertDGEdgeTypeName :: String -> DGEdgeType Source #
getDGEdgeTypeModIncName :: DGEdgeTypeModInc -> String Source #
data DGEdgeType Source #
DGEdgeType | |
|
Instances
Eq DGEdgeType Source # | |
Defined in Static.DgUtils (==) :: DGEdgeType -> DGEdgeType -> Bool (/=) :: DGEdgeType -> DGEdgeType -> Bool | |
Data DGEdgeType Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DGEdgeType -> c DGEdgeType gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DGEdgeType toConstr :: DGEdgeType -> Constr dataTypeOf :: DGEdgeType -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DGEdgeType) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DGEdgeType) gmapT :: (forall b. Data b => b -> b) -> DGEdgeType -> DGEdgeType gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DGEdgeType -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DGEdgeType -> r gmapQ :: (forall d. Data d => d -> u) -> DGEdgeType -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> DGEdgeType -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> DGEdgeType -> m DGEdgeType gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DGEdgeType -> m DGEdgeType gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DGEdgeType -> m DGEdgeType | |
Ord DGEdgeType Source # | |
Defined in Static.DgUtils compare :: DGEdgeType -> DGEdgeType -> Ordering (<) :: DGEdgeType -> DGEdgeType -> Bool (<=) :: DGEdgeType -> DGEdgeType -> Bool (>) :: DGEdgeType -> DGEdgeType -> Bool (>=) :: DGEdgeType -> DGEdgeType -> Bool max :: DGEdgeType -> DGEdgeType -> DGEdgeType min :: DGEdgeType -> DGEdgeType -> DGEdgeType | |
Show DGEdgeType Source # | |
Defined in Static.DgUtils showsPrec :: Int -> DGEdgeType -> ShowS show :: DGEdgeType -> String showList :: [DGEdgeType] -> ShowS | |
ShATermLG DGEdgeType Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> DGEdgeType -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, DGEdgeType) Source # |
data DGEdgeTypeModInc Source #
GlobalDef | |
HetDef | |
HidingDef | |
LocalDef | |
FreeOrCofreeDef FreeOrCofree | |
ThmType | |
|
Instances
Eq DGEdgeTypeModInc Source # | |
Defined in Static.DgUtils (==) :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> Bool (/=) :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> Bool | |
Data DGEdgeTypeModInc Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DGEdgeTypeModInc -> c DGEdgeTypeModInc gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DGEdgeTypeModInc toConstr :: DGEdgeTypeModInc -> Constr dataTypeOf :: DGEdgeTypeModInc -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DGEdgeTypeModInc) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DGEdgeTypeModInc) gmapT :: (forall b. Data b => b -> b) -> DGEdgeTypeModInc -> DGEdgeTypeModInc gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DGEdgeTypeModInc -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DGEdgeTypeModInc -> r gmapQ :: (forall d. Data d => d -> u) -> DGEdgeTypeModInc -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> DGEdgeTypeModInc -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> DGEdgeTypeModInc -> m DGEdgeTypeModInc gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DGEdgeTypeModInc -> m DGEdgeTypeModInc gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DGEdgeTypeModInc -> m DGEdgeTypeModInc | |
Ord DGEdgeTypeModInc Source # | |
Defined in Static.DgUtils compare :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> Ordering (<) :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> Bool (<=) :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> Bool (>) :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> Bool (>=) :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> Bool max :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> DGEdgeTypeModInc min :: DGEdgeTypeModInc -> DGEdgeTypeModInc -> DGEdgeTypeModInc | |
Show DGEdgeTypeModInc Source # | |
Defined in Static.DgUtils showsPrec :: Int -> DGEdgeTypeModInc -> ShowS show :: DGEdgeTypeModInc -> String showList :: [DGEdgeTypeModInc] -> ShowS | |
ShATermLG DGEdgeTypeModInc Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> DGEdgeTypeModInc -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, DGEdgeTypeModInc) Source # |
Instances
Eq ThmTypes Source # | |
Data ThmTypes Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ThmTypes -> c ThmTypes gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ThmTypes toConstr :: ThmTypes -> Constr dataTypeOf :: ThmTypes -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ThmTypes) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ThmTypes) gmapT :: (forall b. Data b => b -> b) -> ThmTypes -> ThmTypes gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ThmTypes -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ThmTypes -> r gmapQ :: (forall d. Data d => d -> u) -> ThmTypes -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ThmTypes -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ThmTypes -> m ThmTypes gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ThmTypes -> m ThmTypes gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ThmTypes -> m ThmTypes | |
Ord ThmTypes Source # | |
Show ThmTypes Source # | |
ShATermLG ThmTypes Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> ThmTypes -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, ThmTypes) Source # |
listDGEdgeTypes :: [DGEdgeType] Source #
Creates a list with all DGEdgeType types
isDefEdgeType :: DGEdgeType -> Bool Source #
check an EdgeType and see if its a definition link
datatypes for storing the nodes of the ref tree in the global env
Instances
Eq RTPointer Source # | |
Data RTPointer Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RTPointer -> c RTPointer gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RTPointer toConstr :: RTPointer -> Constr dataTypeOf :: RTPointer -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RTPointer) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RTPointer) gmapT :: (forall b. Data b => b -> b) -> RTPointer -> RTPointer gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RTPointer -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RTPointer -> r gmapQ :: (forall d. Data d => d -> u) -> RTPointer -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> RTPointer -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> RTPointer -> m RTPointer gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RTPointer -> m RTPointer gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RTPointer -> m RTPointer | |
Ord RTPointer Source # | |
Defined in Static.DgUtils | |
Show RTPointer Source # | |
ShATermLG RTPointer Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> RTPointer -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, RTPointer) Source # |
mapRTNodes :: Map Int Int -> RTPointer -> RTPointer Source #
Instances
Data RTLeaves Source # | |
Defined in Static.DgUtils gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RTLeaves -> c RTLeaves gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RTLeaves toConstr :: RTLeaves -> Constr dataTypeOf :: RTLeaves -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RTLeaves) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RTLeaves) gmapT :: (forall b. Data b => b -> b) -> RTLeaves -> RTLeaves gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RTLeaves -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RTLeaves -> r gmapQ :: (forall d. Data d => d -> u) -> RTLeaves -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> RTLeaves -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> RTLeaves -> m RTLeaves gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RTLeaves -> m RTLeaves gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RTLeaves -> m RTLeaves | |
Show RTLeaves Source # | |
ShATermLG RTLeaves Source # | |
Defined in ATC.DgUtils toShATermLG :: ATermTable -> RTLeaves -> IO (ATermTable, Int) Source # fromShATermLG :: LogicGraph -> Int -> ATermTable -> (ATermTable, RTLeaves) Source # |
for node names
parseNodeName :: String -> NodeName Source #
handle edge numbers and proof bases
defaultEdgeId :: EdgeId Source #
create a default ID which has to be changed when inserting a certain edge.
nullProofBasis :: ProofBasis -> Bool Source #
addEdgeId :: ProofBasis -> EdgeId -> ProofBasis Source #
delEdgeId :: ProofBasis -> EdgeId -> ProofBasis Source #
updEdgeId :: ProofBasis -> EdgeId -> EdgeId -> ProofBasis Source #
edgeInProofBasis :: EdgeId -> ProofBasis -> Bool Source #
checks if the given edge is contained in the given proof basis..
utilities
getMapAndMaxIndex :: Ord k => k -> (b -> Map k a) -> b -> (Map k a, k) Source #