case class ExpansionTree(term: ETt, polarity: Polarity, shallow: Formula) extends DagProof[ExpansionTree] with Product with Serializable
Expansion tree.
A tree collecting instances of a formula. See, e.g., M. Baaz, S. Hetzl, D. Weller: On the complexity of proof deskolemization, Journal of Symbolic Logic, 77(2), 2012 for a formulation close to the one implemented here.
ExpansionTree wraps an expansion tree term together with the intended shallow formula and polarity. The term may not be necessarily correct for this shallow formula (i.e., calling deep may produce an exception). Calling ExpansionTree.check validates the correctness of the expansion tree (also with respect to the given gapt.proofs.context.Context).
The constructors ETAtom, ETAnd, etc. ensure that the produced expansion trees are correct.
- Source
- trees.scala
- Alphabetic
- By Inheritance
- ExpansionTree
- Serializable
- Serializable
- DagProof
- Product
- Equals
- 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
- Implicit
- This member is added by an implicit conversion from ExpansionTree to any2stringadd[ExpansionTree] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
->[B](y: B): (ExpansionTree, B)
- Implicit
- This member is added by an implicit conversion from ExpansionTree to ArrowAssoc[ExpansionTree] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply(pos: HOLPosition): Set[ExpansionTree]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
check()(implicit ctx: Maybe[Context]): Unit
Checks whether this expansion tree is correct (in the given Context).
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
def
dagLike: DagLikeOps[ExpansionTree]
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 deep: Formula
-
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: (ExpansionTree) ⇒ Boolean, msg: ⇒ Any): ExpansionTree
- Implicit
- This member is added by an implicit conversion from ExpansionTree to Ensuring[ExpansionTree] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (ExpansionTree) ⇒ Boolean): ExpansionTree
- Implicit
- This member is added by an implicit conversion from ExpansionTree to Ensuring[ExpansionTree] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): ExpansionTree
- Implicit
- This member is added by an implicit conversion from ExpansionTree to Ensuring[ExpansionTree] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): ExpansionTree
- Implicit
- This member is added by an implicit conversion from ExpansionTree to Ensuring[ExpansionTree] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- ExpansionTree → DagProof → Equals → AnyRef → Any
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from ExpansionTree to StringFormat[ExpansionTree] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
val
hashCode: Int
- Definition Classes
- DagProof
-
def
immediateSubProofs: Seq[ExpansionTree]
The immediate subproofs of this rule.
The immediate subproofs of this rule.
- Definition Classes
- ExpansionTree → DagProof
- def isAtom: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
longName: String
The name of this rule (in words).
The name of this rule (in words).
- Definition Classes
- DagProof
-
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
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val polarity: Polarity
- val shallow: Formula
-
def
stepString(subProofLabels: Map[Any, String]): String
- Attributes
- protected
- Definition Classes
- DagProof
-
def
subProofAt(pos: List[Int]): ExpansionTree
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[ExpansionTree]
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
- val term: ETt
- def toDoc(implicit sig: BabelSignature): Doc
- def toSigRelativeString(implicit sig: BabelSignature): String
-
def
toString(): String
- Definition Classes
- ExpansionTree → DagProof → AnyRef → Any
-
def
treeLike: TreeLikeOps[ExpansionTree]
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(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
→[B](y: B): (ExpansionTree, B)
- Implicit
- This member is added by an implicit conversion from ExpansionTree to ArrowAssoc[ExpansionTree] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
This is the API documentation for GAPT.
The main package is gapt.