Packages

t

gapt.formats.llk

TokenToLKConverter

trait TokenToLKConverter extends AnyRef

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
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TokenToLKConverter
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

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 toany2stringadd[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 toArrowAssoc[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[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
  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 ensuring(cond: (TokenToLKConverter) => Boolean, msg: => Any): TokenToLKConverter
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter toEnsuring[TokenToLKConverter] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  19. def ensuring(cond: (TokenToLKConverter) => Boolean): TokenToLKConverter
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter toEnsuring[TokenToLKConverter] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  20. def ensuring(cond: Boolean, msg: => Any): TokenToLKConverter
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter toEnsuring[TokenToLKConverter] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  21. def ensuring(cond: Boolean): TokenToLKConverter
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter toEnsuring[TokenToLKConverter] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  22. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  24. def filterContext(fs_old1: HOLSequent, fs_old2: HOLSequent, fs_new: HOLSequent): (HOLSequent, HOLSequent, HOLSequent)
  25. def filterContext(fs_old: HOLSequent, fs_new: HOLSequent): (HOLSequent, HOLSequent, HOLSequent)
  26. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter toStringFormat[TokenToLKConverter] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  27. def getAxiomLookupProof(name: Formula, axiom: Formula, instance: Formula, axiomconj: Formula, axiomproof: LKProof, sub: Substitution, definitions: List[Definition]): (Formula, LKProof)
  28. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  29. def getDependecyMap(naming: (String) => Expr, pm: Map[Formula, List[RToken]]): Map[Formula, List[Formula]]
  30. def getOrdering[T](pm: Map[T, List[T]]): List[T]
  31. def handleBinaryLogicalOperator(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  32. def handleContraction(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  33. def handleCut(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  34. 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]
  35. 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]
  36. def handleEquality(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  37. 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]
  38. def handleLink(proofs: Map[Formula, LKProof], current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  39. def handleNegation(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  40. def handleStrongQuantifier(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  41. def handleUnaryLogicalOperator(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  42. def handleWeakQuantifier(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  43. def handleWeakening(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
  44. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  45. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  46. def llkDefinitionToLKDefinition(exp: Expr, to: Expr): Definition
  47. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  48. def normalize(exp: Expr): Expr
  49. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  50. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  51. def printRules(r: List[Token]): List[HOLSequent]
  52. def proveInstance(axiom: Formula, instance: Formula, sub: Substitution): LKProof
  53. def proveInstanceFrom(axiom: Formula, instance: Formula, sub: Substitution, uproof: LKProof): LKProof
  54. def proveInstance_(axiom: Formula, instance: Formula, sub: Substitution, axiomproof: LKProof): (Formula, LKProof)
  55. def stripUniversalQuantifiers(f: Formula): (List[Var], Formula)
  56. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  57. def toString(): String
    Definition Classes
    AnyRef → Any
  58. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  59. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  60. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

  2. def [B](y: B): (TokenToLKConverter, B)
    Implicit
    This member is added by an implicit conversion from TokenToLKConverter toArrowAssoc[TokenToLKConverter] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromTokenToLKConverter to any2stringadd[TokenToLKConverter]

Inherited by implicit conversion StringFormat fromTokenToLKConverter to StringFormat[TokenToLKConverter]

Inherited by implicit conversion Ensuring fromTokenToLKConverter to Ensuring[TokenToLKConverter]

Inherited by implicit conversion ArrowAssoc fromTokenToLKConverter to ArrowAssoc[TokenToLKConverter]

Ungrouped