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
Known Subclasses
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- TokenToLKConverter
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- 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
- 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()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val axformula: Atom
- val axioms_prove_sequent: Sequent[Atom]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def completeProof(proofname: Formula, proofs: Map[Formula, LKProof], naming: (String) => Expr, rules: List[RToken], axioms: Map[Formula, Formula], definitions: Map[Expr, Expr]): LKProof
- def createAxioms(naming: (String) => Expr, l: List[AToken]): Map[Formula, Formula]
- def createConjunctions(l: List[Formula]): Formula
- def createConjunctions_(l: List[Formula]): List[Formula]
- def createDefinitions(naming: (String) => Expr, l: List[AToken], axioms: Map[Formula, Formula]): Map[Expr, Expr]
- def createLKProof(l: List[Token]): ExtendedProofDatabase
- def createNaming(r: List[Token]): (String) => Expr
- def createSubstitution(naming: (String) => Expr, astlist: List[(Var, LambdaAST)]): Substitution
- 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
- 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
- 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
- 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
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def filterContext(fs_old1: HOLSequent, fs_old2: HOLSequent, fs_new: HOLSequent): (HOLSequent, HOLSequent, HOLSequent)
- def filterContext(fs_old: HOLSequent, fs_new: HOLSequent): (HOLSequent, HOLSequent, HOLSequent)
- def getAxiomLookupProof(name: Formula, axiom: Formula, instance: Formula, axiomconj: Formula, axiomproof: LKProof, sub: Substitution, definitions: List[Definition]): (Formula, LKProof)
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def getDependecyMap(naming: (String) => Expr, pm: Map[Formula, List[RToken]]): Map[Formula, List[Formula]]
- def getOrdering[T](pm: Map[T, List[T]]): List[T]
- def handleBinaryLogicalOperator(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- def handleContraction(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- def handleCut(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- 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]
- 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]
- def handleEquality(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- 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]
- def handleLink(proofs: Map[Formula, LKProof], current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- def handleNegation(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- def handleStrongQuantifier(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- def handleUnaryLogicalOperator(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- def handleWeakQuantifier(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- def handleWeakening(current_proof: List[LKProof], ruletype: String, fs: HOLSequent, auxterm: Option[LambdaAST], naming: (String) => Expr, rt: RToken): List[LKProof]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def llkDefinitionToLKDefinition(exp: Expr, to: Expr): Definition
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def normalize(exp: Expr): Expr
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def printRules(r: List[Token]): List[HOLSequent]
- def proveInstance(axiom: Formula, instance: Formula, sub: Substitution): LKProof
- def proveInstanceFrom(axiom: Formula, instance: Formula, sub: Substitution, uproof: LKProof): LKProof
- def proveInstance_(axiom: Formula, instance: Formula, sub: Substitution, axiomproof: LKProof): (Formula, LKProof)
- def stripUniversalQuantifiers(f: Formula): (List[Var], Formula)
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- 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
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)
instead ofvalue.formatted(formatString)
, or use thef""
string interpolator. In Java 15 and later,formatted
resolves to the new method in String which has reversed parameters.
- 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.
This is the API documentation for GAPT.
The main package is gapt.