t

at.logic.gapt.formats.llk

TokenToLKConverter

trait TokenToLKConverter extends Logger

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 Exprs from hol ASTs.

Source
LLKImporter.scala
Linear Supertypes
Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TokenToLKConverter
  2. Logger
  3. AnyRef
  4. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter to any2stringadd[TokenToLKConverter] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (TokenToLKConverter, B)
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter to ArrowAssoc[TokenToLKConverter] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. val axformula: Atom
  8. val axioms_prove_sequent: Sequent[Atom]
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def completeProof(proofname: Formula, proofs: Map[Formula, LKProof], naming: (String) ⇒ Expr, rules: List[RToken], axioms: Map[Formula, Formula], definitions: Map[Expr, Expr]): LKProof
  11. def createAxioms(naming: (String) ⇒ Expr, l: List[AToken]): Map[Formula, Formula]
  12. def createConjunctions(l: List[Formula]): Formula
  13. def createConjunctions_(l: List[Formula]): List[Formula]
  14. def createDefinitions(naming: (String) ⇒ Expr, l: List[AToken], axioms: Map[Formula, Formula]): Map[Expr, Expr]
  15. def createLKProof(l: List[Token]): ExtendedProofDatabase
  16. def createNaming(r: List[Token]): (String) ⇒ Expr
  17. def createSubstitution(naming: (String) ⇒ Expr, astlist: List[(Var, LambdaAST)]): Substitution
  18. def debug(msg: ⇒ Any): Unit
    Attributes
    protected
    Definition Classes
    Logger
  19. def ensuring(cond: (TokenToLKConverter) ⇒ Boolean, msg: ⇒ Any): TokenToLKConverter
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter to Ensuring[TokenToLKConverter] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  20. def ensuring(cond: (TokenToLKConverter) ⇒ Boolean): TokenToLKConverter
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter to Ensuring[TokenToLKConverter] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  21. def ensuring(cond: Boolean, msg: ⇒ Any): TokenToLKConverter
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter to Ensuring[TokenToLKConverter] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  22. def ensuring(cond: Boolean): TokenToLKConverter
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter to Ensuring[TokenToLKConverter] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  23. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  24. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  25. def error(msg: ⇒ Any, e: Throwable): Nothing
    Attributes
    protected
    Definition Classes
    Logger
  26. def error(msg: ⇒ Any): Unit
    Attributes
    protected
    Definition Classes
    Logger
  27. def filterContext(fs_old1: HOLSequent, fs_old2: HOLSequent, fs_new: HOLSequent): (HOLSequent, HOLSequent, HOLSequent)
  28. def filterContext(fs_old: HOLSequent, fs_new: HOLSequent): (HOLSequent, HOLSequent, HOLSequent)
  29. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  30. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter to StringFormat[TokenToLKConverter] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  31. def getAxiomLookupProof(name: Formula, axiom: Formula, instance: Formula, axiomconj: Formula, axiomproof: LKProof, sub: Substitution, definitions: List[Definition]): (Formula, LKProof)
  32. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  33. def getDependecyMap(naming: (String) ⇒ Expr, pm: Map[Formula, List[RToken]]): Map[Formula, List[Formula]]
  34. def getOrdering[T](pm: Map[T, List[T]]): List[T]
  35. def handleBinaryLogicalOperator(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  36. def handleContraction(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  37. def handleCut(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  38. def handleDefinitions(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken, llk_definitions: Map[Expr, Expr]): List[LKProof]
  39. def handleEQAxiom(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], subterm: List[(Var, LambdaAST)], naming: (String) ⇒ Expr, rt: RToken, axioms: Map[Formula, Formula], definitions: Map[Expr, Expr]): List[LKProof]
  40. def handleEquality(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  41. def handleInstAxiom(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], subterm: List[(Var, LambdaAST)], naming: (String) ⇒ Expr, rt: RToken, axioms: Map[Formula, Formula], definitions: Map[Expr, Expr]): List[LKProof]
  42. def handleLink(proofs: Map[Formula, LKProof], current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  43. def handleNegation(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  44. def handleStrongQuantifier(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  45. def handleUnaryLogicalOperator(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  46. def handleWeakQuantifier(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  47. def handleWeakening(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) ⇒ Expr, rt: RToken): List[LKProof]
  48. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  49. def info(msg: ⇒ Any): Unit
    Attributes
    protected
    Definition Classes
    Logger
  50. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  51. def llkDefinitionToLKDefinition(exp: Expr, to: Expr): Definition
  52. def makeVerbose(): Unit
    Definition Classes
    Logger
  53. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  54. def normalize(exp: Expr): Expr
  55. final def notify(): Unit
    Definition Classes
    AnyRef
  56. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  57. def printRules(r: List[Token]): List[HOLSequent]
  58. def proveInstance(axiom: Formula, instance: Formula, sub: Substitution): LKProof
  59. def proveInstanceFrom(axiom: Formula, instance: Formula, sub: Substitution, uproof: LKProof): LKProof
  60. def proveInstance_(axiom: Formula, instance: Formula, sub: Substitution, axiomproof: LKProof): (Formula, LKProof)
  61. def stripUniversalQuantifiers(f: Formula): (List[Var], Formula)
  62. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  63. def toString(): String
    Definition Classes
    AnyRef → Any
  64. def trace(msg: ⇒ Any): Unit
    Attributes
    protected
    Definition Classes
    Logger
  65. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  66. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  67. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  68. def warn(msg: ⇒ Any, e: Throwable): Unit
    Attributes
    protected
    Definition Classes
    Logger
  69. def warn(msg: ⇒ Any): Unit
    Attributes
    protected
    Definition Classes
    Logger
  70. def [B](y: B): (TokenToLKConverter, B)
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter to ArrowAssoc[TokenToLKConverter] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Logger

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from TokenToLKConverter to any2stringadd[TokenToLKConverter]

Inherited by implicit conversion StringFormat from TokenToLKConverter to StringFormat[TokenToLKConverter]

Inherited by implicit conversion Ensuring from TokenToLKConverter to Ensuring[TokenToLKConverter]

Inherited by implicit conversion ArrowAssoc from TokenToLKConverter to ArrowAssoc[TokenToLKConverter]

Ungrouped