Hets - the Heterogeneous Tool Set

Copyright(c) Daniel Calegari Universidad de la Republica Uruguay 2013
LicenseGPLv2 or higher, see LICENSE.txt
Maintainerdcalegar@fing.edu.uy
Stabilityprovisional
Portabilityportable
Safe HaskellSafe

CSMOF.Sign

Description

 

Documentation

data TypeKind Source #

Constructors

DataTypeKind 
ClassKind 

Instances

Eq TypeKind Source # 

Methods

(==) :: TypeKind -> TypeKind -> Bool

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

Data TypeKind Source # 

Methods

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

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

toConstr :: TypeKind -> Constr

dataTypeOf :: TypeKind -> DataType

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

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

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

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

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

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

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

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

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

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

Ord TypeKind Source # 

Methods

compare :: TypeKind -> TypeKind -> Ordering

(<) :: TypeKind -> TypeKind -> Bool

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

(>) :: TypeKind -> TypeKind -> Bool

(>=) :: TypeKind -> TypeKind -> Bool

max :: TypeKind -> TypeKind -> TypeKind

min :: TypeKind -> TypeKind -> TypeKind

Show TypeKind Source # 

Methods

showsPrec :: Int -> TypeKind -> ShowS

show :: TypeKind -> String

showList :: [TypeKind] -> ShowS

Pretty TypeKind Source # 

data TypeClass Source #

Constructors

TypeClass 

Fields

Instances

Eq TypeClass Source # 

Methods

(==) :: TypeClass -> TypeClass -> Bool

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

Data TypeClass Source # 

Methods

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

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

toConstr :: TypeClass -> Constr

dataTypeOf :: TypeClass -> DataType

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

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

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

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

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

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

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

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

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

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

Ord TypeClass Source # 

Methods

compare :: TypeClass -> TypeClass -> Ordering

(<) :: TypeClass -> TypeClass -> Bool

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

(>) :: TypeClass -> TypeClass -> Bool

(>=) :: TypeClass -> TypeClass -> Bool

max :: TypeClass -> TypeClass -> TypeClass

min :: TypeClass -> TypeClass -> TypeClass

Show TypeClass Source # 

Methods

showsPrec :: Int -> TypeClass -> ShowS

show :: TypeClass -> String

showList :: [TypeClass] -> ShowS

Pretty TypeClass Source # 

type Role = String Source #

data PropertyT Source #

Instances

Eq PropertyT Source # 

Methods

(==) :: PropertyT -> PropertyT -> Bool

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

Data PropertyT Source # 

Methods

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

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

toConstr :: PropertyT -> Constr

dataTypeOf :: PropertyT -> DataType

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

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

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

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

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

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

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

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

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

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

Ord PropertyT Source # 

Methods

compare :: PropertyT -> PropertyT -> Ordering

(<) :: PropertyT -> PropertyT -> Bool

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

(>) :: PropertyT -> PropertyT -> Bool

(>=) :: PropertyT -> PropertyT -> Bool

max :: PropertyT -> PropertyT -> PropertyT

min :: PropertyT -> PropertyT -> PropertyT

Show PropertyT Source # 

Methods

showsPrec :: Int -> PropertyT -> ShowS

show :: PropertyT -> String

showList :: [PropertyT] -> ShowS

Pretty PropertyT Source # 

data LinkT Source #

Constructors

LinkT 

Instances

Eq LinkT Source # 

Methods

(==) :: LinkT -> LinkT -> Bool

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

Data LinkT Source # 

Methods

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

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

toConstr :: LinkT -> Constr

dataTypeOf :: LinkT -> DataType

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

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

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

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

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

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

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

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

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

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

Ord LinkT Source # 

Methods

compare :: LinkT -> LinkT -> Ordering

(<) :: LinkT -> LinkT -> Bool

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

(>) :: LinkT -> LinkT -> Bool

(>=) :: LinkT -> LinkT -> Bool

max :: LinkT -> LinkT -> LinkT

min :: LinkT -> LinkT -> LinkT

Show LinkT Source # 

Methods

showsPrec :: Int -> LinkT -> ShowS

show :: LinkT -> String

showList :: [LinkT] -> ShowS

Pretty LinkT Source # 

data Sign Source #

Constructors

Sign 

Fields

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

GetRange Sign Source # 
Pretty Sign Source # 

Methods

pretty :: Sign -> Doc Source #

pretties :: [Sign] -> Doc Source #

Sentences CSMOF Sen Sign Morphism () Source # 

Methods

map_sen :: CSMOF -> Morphism -> Sen -> Result Sen Source #

simplify_sen :: CSMOF -> Sign -> Sen -> Sen Source #

negation :: CSMOF -> Sen -> Maybe Sen Source #

print_sign :: CSMOF -> Sign -> Doc Source #

print_named :: CSMOF -> Named Sen -> Doc Source #

sym_of :: CSMOF -> Sign -> [Set ()] Source #

mostSymsOf :: CSMOF -> Sign -> [()] Source #

symmap_of :: CSMOF -> Morphism -> EndoMap () Source #

sym_name :: CSMOF -> () -> Id Source #

sym_label :: CSMOF -> () -> Maybe String Source #

fullSymName :: CSMOF -> () -> String Source #

symKind :: CSMOF -> () -> String Source #

symsOfSen :: CSMOF -> Sign -> Sen -> [()] Source #

pair_symbols :: CSMOF -> () -> () -> Result () Source #

StaticAnalysis CSMOF Metamodel Sen () () Sign Morphism () () Source # 

Methods

basic_analysis :: CSMOF -> Maybe ((Metamodel, Sign, GlobalAnnos) -> Result (Metamodel, ExtSign Sign (), [Named Sen])) Source #

sen_analysis :: CSMOF -> Maybe ((Metamodel, Sign, Sen) -> Result Sen) Source #

extBasicAnalysis :: CSMOF -> IRI -> LibName -> Metamodel -> Sign -> GlobalAnnos -> Result (Metamodel, ExtSign Sign (), [Named Sen]) Source #

stat_symb_map_items :: CSMOF -> Sign -> Maybe Sign -> [()] -> Result (EndoMap ()) Source #

stat_symb_items :: CSMOF -> Sign -> [()] -> Result [()] Source #

convertTheory :: CSMOF -> Maybe ((Sign, [Named Sen]) -> Metamodel) Source #

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

quotient_term_algebra :: CSMOF -> Morphism -> [Named Sen] -> Result (Sign, [Named Sen]) Source #

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

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

symbol_to_raw :: CSMOF -> () -> () Source #

id_to_raw :: CSMOF -> Id -> () Source #

matches :: CSMOF -> () -> () -> Bool Source #

empty_signature :: CSMOF -> Sign Source #

add_symb_to_sign :: CSMOF -> Sign -> () -> Result Sign Source #

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

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

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

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

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

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

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

generated_sign :: CSMOF -> Set () -> Sign -> Result Morphism Source #

cogenerated_sign :: CSMOF -> Set () -> Sign -> Result Morphism Source #

induced_from_morphism :: CSMOF -> EndoMap () -> Sign -> Result Morphism Source #

induced_from_to_morphism :: CSMOF -> EndoMap () -> ExtSign Sign () -> ExtSign Sign () -> Result Morphism Source #

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

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

theory_to_taxonomy :: CSMOF -> TaxoGraphKind -> MMiSSOntology -> Sign -> [Named Sen] -> Result MMiSSOntology Source #

corresp2th :: CSMOF -> String -> Bool -> Sign -> Sign -> [()] -> [()] -> EndoMap () -> EndoMap () -> REL_REF -> Result (Sign, [Named Sen], Sign, Sign, EndoMap (), EndoMap ()) Source #

equiv2cospan :: CSMOF -> Sign -> Sign -> [()] -> [()] -> Result (Sign, Sign, Sign, EndoMap (), EndoMap ()) Source #

extract_module :: CSMOF -> [IRI] -> (Sign, [Named Sen]) -> Result (Sign, [Named Sen]) Source #

Logic CSMOF () Metamodel Sen () () Sign Morphism () () () Source # 

Methods

parse_basic_sen :: CSMOF -> Maybe (Metamodel -> AParser st Sen) Source #

stability :: CSMOF -> Stability Source #

data_logic :: CSMOF -> Maybe AnyLogic Source #

top_sublogic :: CSMOF -> () Source #

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

bottomSublogic :: CSMOF -> Maybe () Source #

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

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

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

provers :: CSMOF -> [Prover Sign Sen Morphism () ()] Source #

default_prover :: CSMOF -> String Source #

cons_checkers :: CSMOF -> [ConsChecker Sign Sen () Morphism ()] Source #

conservativityCheck :: CSMOF -> [ConservativityChecker Sign Sen Morphism] Source #

empty_proof_tree :: CSMOF -> () Source #

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

omdoc_metatheory :: CSMOF -> Maybe OMCD Source #

export_symToOmdoc :: CSMOF -> NameMap () -> () -> String -> Result TCElement Source #

export_senToOmdoc :: CSMOF -> NameMap () -> Sen -> Result TCorOMElement Source #

export_theoryToOmdoc :: CSMOF -> SigMap () -> Sign -> [Named Sen] -> Result [TCElement] Source #

omdocToSym :: CSMOF -> SigMapI () -> TCElement -> String -> Result () Source #

omdocToSen :: CSMOF -> SigMapI () -> TCElement -> String -> Result (Maybe (Named Sen)) Source #

addOMadtToTheory :: CSMOF -> SigMapI () -> (Sign, [Named Sen]) -> [[OmdADT]] -> Result (Sign, [Named Sen]) Source #

addOmdocToTheory :: CSMOF -> SigMapI () -> (Sign, [Named Sen]) -> [TCElement] -> Result (Sign, [Named Sen]) Source #

Comorphism CSMOF2CASL CSMOF () Metamodel Sen () () Sign Morphism () () () CASL CASL_Sublogics CASLBasicSpec CASLFORMULA SYMB_ITEMS SYMB_MAP_ITEMS CASLSign CASLMor Symbol RawSymbol ProofTree Source # 

toInstance :: (String, TypeClass) -> Doc Source #

data MultConstr Source #

Constructors

MultConstr 

Fields

Instances

Eq MultConstr Source # 

Methods

(==) :: MultConstr -> MultConstr -> Bool

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

Data MultConstr Source # 

Methods

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

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

toConstr :: MultConstr -> Constr

dataTypeOf :: MultConstr -> DataType

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

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

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

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

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

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

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

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

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

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

Ord MultConstr Source # 
Show MultConstr Source # 

Methods

showsPrec :: Int -> MultConstr -> ShowS

show :: MultConstr -> String

showList :: [MultConstr] -> ShowS

Pretty MultConstr Source # 

data ConstraintType Source #

Constructors

EQUAL 
LEQ 
GEQ 

Instances

Eq ConstraintType Source # 
Data ConstraintType Source # 

Methods

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

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

toConstr :: ConstraintType -> Constr

dataTypeOf :: ConstraintType -> DataType

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

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

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

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

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

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

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

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

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

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

Ord ConstraintType Source # 
Show ConstraintType Source # 

Methods

showsPrec :: Int -> ConstraintType -> ShowS

show :: ConstraintType -> String

showList :: [ConstraintType] -> ShowS

Pretty ConstraintType Source # 

data Sen Source #

Constructors

Sen 

Instances

Eq Sen Source # 

Methods

(==) :: Sen -> Sen -> Bool

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

Data Sen Source # 

Methods

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

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

toConstr :: Sen -> Constr

dataTypeOf :: Sen -> DataType

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

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

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

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

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

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

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

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

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

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

Ord Sen Source # 

Methods

compare :: Sen -> Sen -> Ordering

(<) :: Sen -> Sen -> Bool

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

(>) :: Sen -> Sen -> Bool

(>=) :: Sen -> Sen -> Bool

max :: Sen -> Sen -> Sen

min :: Sen -> Sen -> Sen

Show Sen Source # 

Methods

showsPrec :: Int -> Sen -> ShowS

show :: Sen -> String

showList :: [Sen] -> ShowS

GetRange Sen Source # 
Pretty Sen Source # 

Methods

pretty :: Sen -> Doc Source #

pretties :: [Sen] -> Doc Source #

Sentences CSMOF Sen Sign Morphism () Source # 

Methods

map_sen :: CSMOF -> Morphism -> Sen -> Result Sen Source #

simplify_sen :: CSMOF -> Sign -> Sen -> Sen Source #

negation :: CSMOF -> Sen -> Maybe Sen Source #

print_sign :: CSMOF -> Sign -> Doc Source #

print_named :: CSMOF -> Named Sen -> Doc Source #

sym_of :: CSMOF -> Sign -> [Set ()] Source #

mostSymsOf :: CSMOF -> Sign -> [()] Source #

symmap_of :: CSMOF -> Morphism -> EndoMap () Source #

sym_name :: CSMOF -> () -> Id Source #

sym_label :: CSMOF -> () -> Maybe String Source #

fullSymName :: CSMOF -> () -> String Source #

symKind :: CSMOF -> () -> String Source #

symsOfSen :: CSMOF -> Sign -> Sen -> [()] Source #

pair_symbols :: CSMOF -> () -> () -> Result () Source #

StaticAnalysis CSMOF Metamodel Sen () () Sign Morphism () () Source # 

Methods

basic_analysis :: CSMOF -> Maybe ((Metamodel, Sign, GlobalAnnos) -> Result (Metamodel, ExtSign Sign (), [Named Sen])) Source #

sen_analysis :: CSMOF -> Maybe ((Metamodel, Sign, Sen) -> Result Sen) Source #

extBasicAnalysis :: CSMOF -> IRI -> LibName -> Metamodel -> Sign -> GlobalAnnos -> Result (Metamodel, ExtSign Sign (), [Named Sen]) Source #

stat_symb_map_items :: CSMOF -> Sign -> Maybe Sign -> [()] -> Result (EndoMap ()) Source #

stat_symb_items :: CSMOF -> Sign -> [()] -> Result [()] Source #

convertTheory :: CSMOF -> Maybe ((Sign, [Named Sen]) -> Metamodel) Source #

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

quotient_term_algebra :: CSMOF -> Morphism -> [Named Sen] -> Result (Sign, [Named Sen]) Source #

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

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

symbol_to_raw :: CSMOF -> () -> () Source #

id_to_raw :: CSMOF -> Id -> () Source #

matches :: CSMOF -> () -> () -> Bool Source #

empty_signature :: CSMOF -> Sign Source #

add_symb_to_sign :: CSMOF -> Sign -> () -> Result Sign Source #

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

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

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

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

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

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

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

generated_sign :: CSMOF -> Set () -> Sign -> Result Morphism Source #

cogenerated_sign :: CSMOF -> Set () -> Sign -> Result Morphism Source #

induced_from_morphism :: CSMOF -> EndoMap () -> Sign -> Result Morphism Source #

induced_from_to_morphism :: CSMOF -> EndoMap () -> ExtSign Sign () -> ExtSign Sign () -> Result Morphism Source #

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

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

theory_to_taxonomy :: CSMOF -> TaxoGraphKind -> MMiSSOntology -> Sign -> [Named Sen] -> Result MMiSSOntology Source #

corresp2th :: CSMOF -> String -> Bool -> Sign -> Sign -> [()] -> [()] -> EndoMap () -> EndoMap () -> REL_REF -> Result (Sign, [Named Sen], Sign, Sign, EndoMap (), EndoMap ()) Source #

equiv2cospan :: CSMOF -> Sign -> Sign -> [()] -> [()] -> Result (Sign, Sign, Sign, EndoMap (), EndoMap ()) Source #

extract_module :: CSMOF -> [IRI] -> (Sign, [Named Sen]) -> Result (Sign, [Named Sen]) Source #

Logic CSMOF () Metamodel Sen () () Sign Morphism () () () Source # 

Methods

parse_basic_sen :: CSMOF -> Maybe (Metamodel -> AParser st Sen) Source #

stability :: CSMOF -> Stability Source #

data_logic :: CSMOF -> Maybe AnyLogic Source #

top_sublogic :: CSMOF -> () Source #

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

bottomSublogic :: CSMOF -> Maybe () Source #

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

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

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

provers :: CSMOF -> [Prover Sign Sen Morphism () ()] Source #

default_prover :: CSMOF -> String Source #

cons_checkers :: CSMOF -> [ConsChecker Sign Sen () Morphism ()] Source #

conservativityCheck :: CSMOF -> [ConservativityChecker Sign Sen Morphism] Source #

empty_proof_tree :: CSMOF -> () Source #

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

omdoc_metatheory :: CSMOF -> Maybe OMCD Source #

export_symToOmdoc :: CSMOF -> NameMap () -> () -> String -> Result TCElement Source #

export_senToOmdoc :: CSMOF -> NameMap () -> Sen -> Result TCorOMElement Source #

export_theoryToOmdoc :: CSMOF -> SigMap () -> Sign -> [Named Sen] -> Result [TCElement] Source #

omdocToSym :: CSMOF -> SigMapI () -> TCElement -> String -> Result () Source #

omdocToSen :: CSMOF -> SigMapI () -> TCElement -> String -> Result (Maybe (Named Sen)) Source #

addOMadtToTheory :: CSMOF -> SigMapI () -> (Sign, [Named Sen]) -> [[OmdADT]] -> Result (Sign, [Named Sen]) Source #

addOmdocToTheory :: CSMOF -> SigMapI () -> (Sign, [Named Sen]) -> [TCElement] -> Result (Sign, [Named Sen]) Source #

Comorphism CSMOF2CASL CSMOF () Metamodel Sen () () Sign Morphism () () () CASL CASL_Sublogics CASLBasicSpec CASLFORMULA SYMB_ITEMS SYMB_MAP_ITEMS CASLSign CASLMor Symbol RawSymbol ProofTree Source #