Hets - the Heterogeneous Tool Set

Copyright(c) Kristina Sojakova DFKI Bremen 2009
LicenseGPLv2 or higher, see LICENSE.txt
Maintainerk.sojakova@jacobs-university.de
Stabilityexperimental
Portabilityportable
Safe HaskellSafe

DFOL.Sign

Description

 

Documentation

data KIND Source #

Constructors

SortKind 
FuncKind 
PredKind 

Instances

Eq KIND Source # 

Methods

(==) :: KIND -> KIND -> Bool

(/=) :: KIND -> KIND -> Bool

Data KIND Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> KIND -> c KIND

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c KIND

toConstr :: KIND -> Constr

dataTypeOf :: KIND -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c KIND)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c KIND)

gmapT :: (forall b. Data b => b -> b) -> KIND -> KIND

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> KIND -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> KIND -> r

gmapQ :: (forall d. Data d => d -> u) -> KIND -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> KIND -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> KIND -> m KIND

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> KIND -> m KIND

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> KIND -> m KIND

Ord KIND Source # 

Methods

compare :: KIND -> KIND -> Ordering

(<) :: KIND -> KIND -> Bool

(<=) :: KIND -> KIND -> Bool

(>) :: KIND -> KIND -> Bool

(>=) :: KIND -> KIND -> Bool

max :: KIND -> KIND -> KIND

min :: KIND -> KIND -> KIND

Show KIND Source # 

Methods

showsPrec :: Int -> KIND -> ShowS

show :: KIND -> String

showList :: [KIND] -> ShowS

Pretty KIND Source # 

Methods

pretty :: KIND -> Doc Source #

pretties :: [KIND] -> Doc Source #

type ARITY = Int Source #

data CONTEXT Source #

Constructors

Context [DECL] 

Instances

Eq CONTEXT Source # 

Methods

(==) :: CONTEXT -> CONTEXT -> Bool

(/=) :: CONTEXT -> CONTEXT -> Bool

Data CONTEXT Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CONTEXT -> c CONTEXT

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CONTEXT

toConstr :: CONTEXT -> Constr

dataTypeOf :: CONTEXT -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c CONTEXT)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CONTEXT)

gmapT :: (forall b. Data b => b -> b) -> CONTEXT -> CONTEXT

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CONTEXT -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CONTEXT -> r

gmapQ :: (forall d. Data d => d -> u) -> CONTEXT -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CONTEXT -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CONTEXT -> m CONTEXT

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CONTEXT -> m CONTEXT

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CONTEXT -> m CONTEXT

Show CONTEXT Source # 

Methods

showsPrec :: Int -> CONTEXT -> ShowS

show :: CONTEXT -> String

showList :: [CONTEXT] -> ShowS

Pretty CONTEXT Source # 

data Sign Source #

Constructors

Sign [DECL] 

Instances

Eq Sign Source # 

Methods

(==) :: Sign -> Sign -> Bool

(/=) :: Sign -> Sign -> Bool

Data Sign Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Sign -> c Sign

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Sign

toConstr :: Sign -> Constr

dataTypeOf :: Sign -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Sign)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Sign)

gmapT :: (forall b. Data b => b -> b) -> Sign -> Sign

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r

gmapQ :: (forall d. Data d => d -> u) -> Sign -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Sign -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Sign -> m Sign

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Sign -> m Sign

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Sign -> m Sign

Ord Sign Source # 

Methods

compare :: Sign -> Sign -> Ordering

(<) :: Sign -> Sign -> Bool

(<=) :: Sign -> Sign -> Bool

(>) :: Sign -> Sign -> Bool

(>=) :: Sign -> Sign -> Bool

max :: Sign -> Sign -> Sign

min :: Sign -> Sign -> Sign

Show Sign Source # 

Methods

showsPrec :: Int -> Sign -> ShowS

show :: Sign -> String

showList :: [Sign] -> ShowS

Pretty Sign Source # 

Methods

pretty :: Sign -> Doc Source #

pretties :: [Sign] -> Doc Source #

Sentences DFOL FORMULA Sign Morphism Symbol Source # 
StaticAnalysis DFOL BASIC_SPEC FORMULA SYMB_ITEMS SYMB_MAP_ITEMS Sign Morphism Symbol Symbol Source # 

Methods

basic_analysis :: DFOL -> Maybe ((BASIC_SPEC, Sign, GlobalAnnos) -> Result (BASIC_SPEC, ExtSign Sign Symbol, [Named FORMULA])) Source #

sen_analysis :: DFOL -> Maybe ((BASIC_SPEC, Sign, FORMULA) -> Result FORMULA) Source #

extBasicAnalysis :: DFOL -> IRI -> LibName -> BASIC_SPEC -> Sign -> GlobalAnnos -> Result (BASIC_SPEC, ExtSign Sign Symbol, [Named FORMULA]) Source #

stat_symb_map_items :: DFOL -> Sign -> Maybe Sign -> [SYMB_MAP_ITEMS] -> Result (EndoMap Symbol) Source #

stat_symb_items :: DFOL -> Sign -> [SYMB_ITEMS] -> Result [Symbol] Source #

convertTheory :: DFOL -> Maybe ((Sign, [Named FORMULA]) -> BASIC_SPEC) Source #

ensures_amalgamability :: DFOL -> ([CASLAmalgOpt], Gr Sign (Int, Morphism), [(Int, Morphism)], Gr String String) -> Result Amalgamates Source #

quotient_term_algebra :: DFOL -> Morphism -> [Named FORMULA] -> Result (Sign, [Named FORMULA]) Source #

signature_colimit :: DFOL -> Gr Sign (Int, Morphism) -> Result (Sign, Map Int Morphism) Source #

qualify :: DFOL -> SIMPLE_ID -> LibName -> Morphism -> Sign -> Result (Morphism, [Named FORMULA]) Source #

symbol_to_raw :: DFOL -> Symbol -> Symbol Source #

id_to_raw :: DFOL -> Id -> Symbol Source #

matches :: DFOL -> Symbol -> Symbol -> Bool Source #

empty_signature :: DFOL -> Sign Source #

add_symb_to_sign :: DFOL -> Sign -> Symbol -> Result Sign Source #

signature_union :: DFOL -> Sign -> Sign -> Result Sign Source #

signatureDiff :: DFOL -> Sign -> Sign -> Result Sign Source #

intersection :: DFOL -> Sign -> Sign -> Result Sign Source #

final_union :: DFOL -> Sign -> Sign -> Result Sign Source #

morphism_union :: DFOL -> Morphism -> Morphism -> Result Morphism Source #

is_subsig :: DFOL -> Sign -> Sign -> Bool Source #

subsig_inclusion :: DFOL -> Sign -> Sign -> Result Morphism Source #

generated_sign :: DFOL -> Set Symbol -> Sign -> Result Morphism Source #

cogenerated_sign :: DFOL -> Set Symbol -> Sign -> Result Morphism Source #

induced_from_morphism :: DFOL -> EndoMap Symbol -> Sign -> Result Morphism Source #

induced_from_to_morphism :: DFOL -> EndoMap Symbol -> ExtSign Sign Symbol -> ExtSign Sign Symbol -> Result Morphism Source #

is_transportable :: DFOL -> Morphism -> Bool Source #

is_injective :: DFOL -> Morphism -> Bool Source #

theory_to_taxonomy :: DFOL -> TaxoGraphKind -> MMiSSOntology -> Sign -> [Named FORMULA] -> Result MMiSSOntology Source #

corresp2th :: DFOL -> String -> Bool -> Sign -> Sign -> [SYMB_ITEMS] -> [SYMB_ITEMS] -> EndoMap Symbol -> EndoMap Symbol -> REL_REF -> Result (Sign, [Named FORMULA], Sign, Sign, EndoMap Symbol, EndoMap Symbol) Source #

equiv2cospan :: DFOL -> Sign -> Sign -> [SYMB_ITEMS] -> [SYMB_ITEMS] -> Result (Sign, Sign, Sign, EndoMap Symbol, EndoMap Symbol) Source #

extract_module :: DFOL -> [IRI] -> (Sign, [Named FORMULA]) -> Result (Sign, [Named FORMULA]) Source #

Logic DFOL () BASIC_SPEC FORMULA SYMB_ITEMS SYMB_MAP_ITEMS Sign Morphism Symbol Symbol () Source # 

Methods

parse_basic_sen :: DFOL -> Maybe (BASIC_SPEC -> AParser st FORMULA) Source #

stability :: DFOL -> Stability Source #

data_logic :: DFOL -> Maybe AnyLogic Source #

top_sublogic :: DFOL -> () Source #

all_sublogics :: DFOL -> [()] Source #

bottomSublogic :: DFOL -> Maybe () Source #

sublogicDimensions :: DFOL -> [[()]] Source #

parseSublogic :: DFOL -> String -> Maybe () Source #

proj_sublogic_epsilon :: DFOL -> () -> Sign -> Morphism Source #

provers :: DFOL -> [Prover Sign FORMULA Morphism () ()] Source #

default_prover :: DFOL -> String Source #

cons_checkers :: DFOL -> [ConsChecker Sign FORMULA () Morphism ()] Source #

conservativityCheck :: DFOL -> [ConservativityChecker Sign FORMULA Morphism] Source #

empty_proof_tree :: DFOL -> () Source #

syntaxTable :: DFOL -> Sign -> Maybe SyntaxTable Source #

omdoc_metatheory :: DFOL -> Maybe OMCD Source #

export_symToOmdoc :: DFOL -> NameMap Symbol -> Symbol -> String -> Result TCElement Source #

export_senToOmdoc :: DFOL -> NameMap Symbol -> FORMULA -> Result TCorOMElement Source #

export_theoryToOmdoc :: DFOL -> SigMap Symbol -> Sign -> [Named FORMULA] -> Result [TCElement] Source #

omdocToSym :: DFOL -> SigMapI Symbol -> TCElement -> String -> Result Symbol Source #

omdocToSen :: DFOL -> SigMapI Symbol -> TCElement -> String -> Result (Maybe (Named FORMULA)) Source #

addOMadtToTheory :: DFOL -> SigMapI Symbol -> (Sign, [Named FORMULA]) -> [[OmdADT]] -> Result (Sign, [Named FORMULA]) Source #

addOmdocToTheory :: DFOL -> SigMapI Symbol -> (Sign, [Named FORMULA]) -> [TCElement] -> Result (Sign, [Named FORMULA]) Source #

Comorphism DFOL2CASL DFOL () BASIC_SPEC FORMULA SYMB_ITEMS SYMB_MAP_ITEMS Sign Morphism Symbol Symbol () CASL CASL_Sublogics CASLBasicSpec CASLFORMULA SYMB_ITEMS SYMB_MAP_ITEMS CASLSign CASLMor Symbol RawSymbol ProofTree Source # 

isConstant :: NAME -> Sign -> Bool Source #

hasType :: TERM -> TYPE -> Sign -> CONTEXT -> DIAGN Bool Source #