trait LKVisitor[T] extends AnyRef
Implementation of the visitor pattern for at.logic.gapt.proofs.lk.LKProof. Proof transformations can implement this trait to reduce boilerplate code.
- T
Type of additional arguments that may be used in the transformation.
- Source
- LKVisitor.scala
- Alphabetic
- By Inheritance
- LKVisitor
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (LKVisitor[T], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
apply(proof: LKProof, otherArg: T): LKProof
Applies the proof transformation to an LKProof.
Applies the proof transformation to an LKProof.
- proof
The input proof.
- returns
The transformed proof.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
contractAfter[A](visitingFunction: (LKProof, A) ⇒ (LKProof, SequentConnector)): (LKProof, A) ⇒ (LKProof, SequentConnector)
Transforms a visiting function by inserting contractions after it.
Transforms a visiting function by inserting contractions after it. Only formula occurrences that were not in the old proof -- i.e., that have been added by the visitor -- are contracted.
- visitingFunction
The visiting function after which contractions should be inserted. In most cases, just using
recurse
here should be fine.- returns
A new visiting function that behaves the same as the old one, but contracts all duplicate new formulas at the end.
- def ensuring(cond: (LKVisitor[T]) ⇒ Boolean, msg: ⇒ Any): LKVisitor[T]
- def ensuring(cond: (LKVisitor[T]) ⇒ Boolean): LKVisitor[T]
- def ensuring(cond: Boolean, msg: ⇒ Any): LKVisitor[T]
- def ensuring(cond: Boolean): LKVisitor[T]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def one2one(proof: LKProof, arg: T)(func: (Seq[(LKProof, SequentConnector)]) ⇒ LKProof): (LKProof, SequentConnector)
-
def
recurse(proof: LKProof, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def transportToSubProof(arg: T, proof: LKProof, subProofIdx: Int): T
-
def
visitAndLeft(proof: AndLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitAndRight(proof: AndRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitBottomAxiom(otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitContractionLeft(proof: ContractionLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitContractionRight(proof: ContractionRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitCut(proof: CutRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitDefinitionLeft(proof: DefinitionLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitDefinitionRight(proof: DefinitionRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitEqualityLeft(proof: EqualityLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitEqualityRight(proof: EqualityRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitExistsLeft(proof: ExistsLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitExistsRight(proof: ExistsRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitExistsSkLeft(proof: ExistsSkLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitForallLeft(proof: ForallLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitForallRight(proof: ForallRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitForallSkRight(proof: ForallSkRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitImpLeft(proof: ImpLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitImpRight(proof: ImpRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitInduction(proof: InductionRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitLogicalAxiom(proof: LogicalAxiom, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitNegLeft(proof: NegLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitNegRight(proof: NegRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitOpenAssumption(proof: OpenAssumption, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitOrLeft(proof: OrLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitOrRight(proof: OrRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitProofLink(proof: ProofLink, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitReflexivityAxiom(proof: ReflexivityAxiom, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitTopAxiom(otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitWeakeningLeft(proof: WeakeningLeftRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
def
visitWeakeningRight(proof: WeakeningRightRule, otherArg: T): (LKProof, SequentConnector)
- Attributes
- protected
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def withIdentitySequentConnector(proof: LKProof): (LKProof, SequentConnector)
-
final
def
withSequentConnector(proof: LKProof, otherArg: T): (LKProof, SequentConnector)
Applies the proof transformation to an LKProof.
Applies the proof transformation to an LKProof.
- proof
The input proof.
- returns
Transformed proof, and the sequent connector with the new proof as lower sequent and the old proof as upper sequent.
- def →[B](y: B): (LKVisitor[T], B)
This is the API documentation for GAPT.
The main package is at.logic.gapt.