Instance Constructors
-
new
ExpansionTreeProofStrategy(expansionSequent: ExpansionSequent)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
-
final
def
==(arg0: Any): Boolean
-
-
final
def
asInstanceOf[T0]: T0
-
def
calcNextStep(seq: HOLSequent): Option[Action]
-
def
clone(): AnyRef
-
def
debug(msg: ⇒ String): Unit
-
-
-
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
error(msg: ⇒ String, e: Throwable): Nothing
-
def
error(msg: ⇒ String): Unit
-
-
def
finalize(): Unit
-
def
findBinaryLeft(seq: HOLSequent): Option[Action]
-
def
findBinaryRight(seq: HOLSequent): Option[Action]
-
def
findNullaryLeft(seq: HOLSequent): Option[Action]
-
def
findNullaryRight(seq: HOLSequent): Option[Action]
-
-
def
findUnaryLeft(seq: HOLSequent): Option[Action]
-
def
findUnaryRight(seq: HOLSequent): Option[Action]
-
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
info(msg: ⇒ String): Unit
-
final
def
isInstanceOf[T0]: Boolean
-
val
log: Logger
-
def
loggerName: String
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
trace(msg: ⇒ String): Unit
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
warn(msg: ⇒ String, e: Throwable): Unit
-
def
warn(msg: ⇒ String): Unit
-
Strategy for constructing a proof from an ExpansionSequent.
The internal state of this strategy is an ExpansionSequent. The action is a formula on a side of the sequent plus a witness term or eigenvariable respectively in case this formula starts with a quantifier.