An AToken represents an Axiom declaration or Definition declaration.
An AToken represents an Axiom declaration or Definition declaration.
either "AXIOMDEF", "PREDDEF" or"FUNDEF"
the (unique) name of the definition/axiom
the antecedent of the declaration sequent (not yet typechecked)
the succedent of the declaration sequent (not yet typechecked)
An extended proof database allows to label subproofs by formulas.
An extended proof database allows to label subproofs by formulas. It provides mappings from formulas to proofs additionally to the list of pairs.
This code works around some limitations of latex syntax and adds alternative syntax for abstraction, application and adds support of some macros used in the n-tape proof.
A RToken represents a rule application.
A RToken represents a rule application.
One out of "AX", "ALLL", "ALLR", "EXL", "EXR", "ANDL", "ANDR", "ORL", "ORR", "IMPL", "IMPR", "NEGL", "NEGR", "CUT", "EQL", "EQR", "WEAKL", "WEAKR", "CONTRL", "CONTRR", "DEF", "BETA", "INSTAXIOM"
quantifier rules allow optional specification of the subsitution term, definitions and axiom instantiations take the referenced declaration, etc.
the antecedent of the declaration sequent (not yet typechecked)
the antecedent of the declaration sequent (not yet typechecked)
some rules like axiom instantiation specify substitutions, which are passed as list of var-term pairs
A TToken represents an LLK type declaration.
A TToken represents an LLK type declaration.
either "VARDEC" or "CONSTDEC"
a list of symbol names
the assigned type
The abstract class for tokens of an llk proof.
The abstract class for tokens of an llk proof. TTokens represent type declarations, ATokens represent axiom and definition declarations, and RTokens represent a rule inference.
This implements the second parsing pass, converting hlk Tokens to an LK Proof.
This implements the second parsing pass, converting hlk Tokens to an LK Proof. HybridLatexParser inherits from TokenToLKConverter to have a common interface, but the code here is only dependent on the AST. It uses the ASTtoHOL object to create LambdaExpressions from hol ASTs.
Top-level interface to LLK Parsing
This is a prover9 style formatting which can be parsed by LLK.
This is a Latex formatting which can be parsed by LLK.