ORLibTypes(TypeSystem):: ! OR-Lib types ! ------------ ! ! Peter Schodl ! ! November 10, 2010 ! ! This type system defines the types needed to process the OR-Library. ! ! Spacing is such that the file prints well with ! lpr ORLibTypes.cnt ! ALG_COMMAND: union> ALG_READ, ALG_READSILENT, ALG_READINSTANCES, ALG_NEWLINE union> ALG_SET, ALG_DO, ALG_FOR, ALG_INSTANCE PHRASE: union> FORMULA, EXPRESSION, ASSUMPTION, STATEMENT, AND, EMPTY, LET union> RESTRICTION, ORDATA, OBJECT DEFINITENESS: union> INDEFINTIE, DEFINITE PROPOSITION: union> EXPRESSION, STATEMENT GRNUMBER: union> SINGULAR, PLURAL GEN_STATEMENT: union> FORMULA, CASES, STATEMENT OBJOREXP: union> EXPRESSION, OBJECT TEXTPART: union> SENTENCE, PARAGRAPH ALTERNATIVE: someOfType> Integer = NODE ALTERNATIVEWORD: allOf> entry = STRING ASSUMPTION: allOf> statement = PHRASE optional> with = PHRASE ASSIGN: allOf> lhs = EXPRESSION, rhs = EXPRESSION ACTION: allOf> verb = STRING optional> subject = OBJECT, qualification = QUALIFICATION optional> object = OBJECT ALG_READ: allOf> entry = EXPRESSION ALG_READSILENT: allOf> entry = EXPRESSION ALG_SET: allOf> lhs = EXPRESSION, rhs = EXPRESSION ALG_DO: allOf> from = EXPRESSION, to = EXPRESSION someOfType> Integer = ALG_COMMAND ALG_FOR: allOf> from = EXPRESSION, to = EXPRESSION, running = VAR someOfType> Integer = ALG_COMMAND ALG_INSTANCE: someOfType> Integer = NODE ALG_CODE: someOfType> Integer = ALG_COMMAND ALG_NEWLINE: ALG_READINSTANCES: ARTICLE: someOf> definiteness = DEFINITENESS, number = GRNUMBER AMPLDEF: someOf> kind = NODE, defined = NODE, definedas = NODE CONCEPT: someOf> entry = NODE, article = ARTICLE, qualification = QUALIFICATION someOf> adjective = NODE, specification = NODE, symbol = STRING CLAUSE: someOfType> Integer = NODE CITE: allOf> label = NODE, author = NODE CONCLUSION: allOf> entry = NODE optional> justification = NODE CONSIDER: allOf> entry = NODE CODE: someOfType> Integer = NODE CONTAINS: CONDLIST: someOfType> Integer = NODE someOf> condition = NODE, else = NODE DOCUMENT: optional> header = NODE someOfType> Integer = TEXTPART DOCUMENTINCLUDE: optional> header = NODE someOfType> Integer = TEXTPART DEFINITIONMAPPING: allOf> defined = OBJECT, definedby = OBJECT DEFINITIONVERB: allOf> defined = NODE, iff = GEN_STATEMENT optional> given = NODE DEFINITION: allOf> defined = NODE, definedas = NODE optional> style = NODE, given = OBJECT, iff = GEN_STATEMENT optional> with = GEN_STATEMENT, property = GEN_STATEMENT optional> definelist = LIST DEFINITIONLIST: allOf> defined = LIST, definedas = LIST DEFINITIONREL: someOf> definethat = NODE, given = OBJECT, iff = GEN_STATEMENT someOf> with = GEN_STATEMENT, otherwise = NODE DEFINED: someOf> entry = NODE, symbol = EXPRESSION, alternative = NODE someOf> formula = FORMULA DEFINEDAS: allOf> lhs = EXPRESSION, rhs = EXPRESSION DEFINITE: EQUALBYDEF: allOf> lhs = EXPRESSION, rhs = EXPRESSION EXCEPTION: allOf> program = STRING EQUIVALENT: allOf> lhs = GEN_STATEMENT, rhs = GEN_STATEMENT GODOWN: allOf> child = NODE optional> output = NODE IMPLIES: allOf> antecedent = GEN_STATEMENT, consequence = GEN_STATEMENT INDEXLIST: someOfType> Integer = EXPRESSION INSTANCE: allOf> problem = NODE INDEFINITE: INFERENCE: allOf> statement = GEN_STATEMENT INTERPRETDATA: someOf> indata = NODE, interpretas = NODE INTERPRETATION: someOf> entry = NODE, interpretation = NODE LINESOF: someOfType> Integer = NODE LET: allOf> subject = NODE optional> statement =GEN_STATEMENT, quantity = NODE, object = OBJECT optional> given = GEN_STATEMENT MOTIVATION: allOf> motivation = NODE, motivated = NODE NODE: allOf> entry = NODE NONEMPTY: allOf> entry = NODE NOT: allOf> entry = EXPRESSION NONNEGATIVE: ORLIB: allOf> problem = NODE, reference = NODE, data = ORDATA optional> instance = NODE, feasible = NODE, optimal = NODE OBJECT: allOf> entry = NODE, kind = NODE optional> qualification = QUALIFICATION, interpretation = NODE optional> article = NODE, indexrange = NODE, formula = EXPRESSION optional> with = GEN_STATEMENT, characterization = NODE optional> specification = NODE OR: someOfType> Integer = EXPRESSION ORDATA: someOf> filenames = LIST, nrproblems = INTEGER, algorithm = ALG_CODE optional> choice = NODE ORDATASOLUTION: someOf> filenames = NODE, algorithm = CODE ORDER: allOf> verb = ACTION, subject = OBJECT PARAGRAPH: someOfType> Integer = SENTENCE optional> header = SENTENCE PROOF: someOfType> Integer = SENTENCE optional> torefute = GEN_STATEMENT, refuted = GEN_STATEMENT optional> contradiction = NODE PROPERTY: allOf> property = NODE optional> qualification = QUALIFICATION PLURAL: PROBLEM: allOf> find = EXPRESSION oneOf> targetmin = EXPRESSION, targetmax = EXPRESSION optional> given = NODE, constraint = LIST QUEUE: someOfType> Integer = NODE QUANTIFICATION: allOf> quantity = NODE oneOf> object = OBJECT, hyphenobj = OBJECT optional> BINDS = VAR QUALIFICATION: oneOf> apply = NODE, of = NODE, at = NODE, evaluate = NODE oneOf> for = NODE, per = NODE, relation = NODE REF: allOf> label = NODE optional> heading = STRING RESTRICTION: allOf> formula = PHRASE, restriction = GEN_STATEMENT optional> BINDS = VARLIST, if = GEN_STATEMENT, forsome = OBJECT REQUIREMENT: allOf> subject = OBJECT someOf> action = ACTION, statement = GEN_STATEMENT, object = OBJECT REPEAT: allOf> var = VAR, from = EXPRESSION, to = EXPRESSION, entry = NODE SUBSECTION: someOfType> Integer = SENTENCE optional> header = NODE STATEMENT: allOf> subject = OBJECT oneOf> isa = NODE, is = NODE, does = ACTION, has = OBJECT optional> quantifier = NODE, cite = CITE SENTENCE: someOfType> Integer = PHRASE SINGULAR: THEOREM: allOf> entry = NODE TASK: allOf> action = ACTION, object = OBJECT optional> given = NODE, with = NODE, constraint = GEN_STATEMENT TEXT: allOf> entry = NODE VERBATIM: allOf> entry = STRING