case class Trans(p1: CongruenceProof, p2: CongruenceProof) extends CongruenceProof with Product with Serializable
- Alphabetic
- By Inheritance
- Trans
- Serializable
- Serializable
- CongruenceProof
- SequentProof
- DagProof
- Product
- Equals
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Instance Constructors
- new Trans(p1: CongruenceProof, p2: CongruenceProof)
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
*(that: CongruenceProof): CongruenceProof
- Definition Classes
- CongruenceProof
- def +(other: String): String
- def ->[B](y: B): (Trans, B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
auxFormulas: Seq[Seq[Atom]]
A list of lists containing the auxiliary formulas of the rule.
A list of lists containing the auxiliary formulas of the rule. The first list constains the auxiliary formulas in the first premise and so on.
- Definition Classes
- SequentProof
-
def
auxIndices: Nothing
A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule.
A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule. The first list contains the auxiliary formulas in the first premise and so on.
- Definition Classes
- CongruenceProof → SequentProof
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
conclusion: HOLClause
The conclusion of the rule.
The conclusion of the rule.
- Definition Classes
- CongruenceProof → SequentProof
-
def
dagLike: DagLikeOps[CongruenceProof]
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.
- Definition Classes
- DagProof
-
def
depth: Int
Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.
Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.
- Definition Classes
- DagProof
- def ensuring(cond: (Trans) ⇒ Boolean, msg: ⇒ Any): Trans
- def ensuring(cond: (Trans) ⇒ Boolean): Trans
- def ensuring(cond: Boolean, msg: ⇒ Any): Trans
- def ensuring(cond: Boolean): Trans
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- DagProof → Equals → AnyRef → Any
-
def
equation: Atom
- Definition Classes
- CongruenceProof
-
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
-
val
hashCode: Int
- Definition Classes
- DagProof
-
def
immediateSubProofs: Seq[CongruenceProof]
The immediate subproofs of this rule.
-
def
inv: CongruenceProof
- Definition Classes
- CongruenceProof
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
val
lhs: Expr
- Definition Classes
- Trans → CongruenceProof
-
def
longName: String
The name of this rule (in words).
The name of this rule (in words).
- Definition Classes
- DagProof
-
def
mainFormulas: Seq[Atom]
The list of main formulas of the rule.
The list of main formulas of the rule.
- Definition Classes
- SequentProof
-
def
mainIndices: Nothing
A list of SequentIndices denoting the main formula(s) of the rule.
A list of SequentIndices denoting the main formula(s) of the rule.
- Definition Classes
- CongruenceProof → SequentProof
-
def
name: String
The name of this rule (in symbols).
The name of this rule (in symbols).
- Definition Classes
- DagProof
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
occConnectors: Nothing
A list of occurrence connectors, one for each immediate subproof.
A list of occurrence connectors, one for each immediate subproof.
- Definition Classes
- CongruenceProof → SequentProof
- val p1: CongruenceProof
- val p2: CongruenceProof
-
def
premises: Seq[Sequent[Atom]]
The upper sequents of the rule.
The upper sequents of the rule.
- Definition Classes
- SequentProof
-
val
rhs: Expr
- Definition Classes
- Trans → CongruenceProof
-
def
stepString(subProofLabels: Map[Any, String]): String
- Attributes
- protected
- Definition Classes
- SequentProof → DagProof
-
def
subProofAt(pos: List[Int]): CongruenceProof
Returns the subproof at the given position: p.subProofAt(Nil) is p itself; p.subProofAt(i :: is) is the ith subproof of p.subProofAt(is).
Returns the subproof at the given position: p.subProofAt(Nil) is p itself; p.subProofAt(i :: is) is the ith subproof of p.subProofAt(is).
- Definition Classes
- DagProof
-
def
subProofs: Set[CongruenceProof]
Set of all (transitive) sub-proofs including this.
Set of all (transitive) sub-proofs including this.
- Definition Classes
- DagProof
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- DagProof → AnyRef → Any
-
def
treeLike: TreeLikeOps[CongruenceProof]
Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.
Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.
- Definition Classes
- DagProof
-
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
- @throws( ... )
- def →[B](y: B): (Trans, B)