trait DagProof[Proof <: DagProof[Proof]] extends Product
DAG-like proof.
Proofs are recursive structures that are represented as case classes. Equality is standard case class equality (but implemented in such a way that it is efficient on DAGs).
- Proof
The type of proof, e.g. at.logic.gapt.proofs.lk.LKProof.
- Self Type
- Proof
- Source
- DagProof.scala
- Alphabetic
- By Inheritance
- DagProof
- Product
- Equals
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Abstract Value Members
Concrete 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): (DagProof[Proof], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
dagLike: DagLikeOps[Proof]
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.
-
def
depth: Int
Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.
- def ensuring(cond: (DagProof[Proof]) ⇒ Boolean, msg: ⇒ Any): DagProof[Proof]
- def ensuring(cond: (DagProof[Proof]) ⇒ Boolean): DagProof[Proof]
- def ensuring(cond: Boolean, msg: ⇒ Any): DagProof[Proof]
- def ensuring(cond: Boolean): DagProof[Proof]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- DagProof → Equals → 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()
- val hashCode: Int
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
longName: String
The name of this rule (in words).
-
def
name: String
The name of this rule (in symbols).
-
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
productIterator: Iterator[Any]
- Definition Classes
- Product
-
def
productPrefix: String
- Definition Classes
- Product
-
def
stepString(subProofLabels: Map[Any, String]): String
- Attributes
- protected
-
def
subProofAt(pos: List[Int]): Proof
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).
-
def
subProofs: Set[Proof]
Set of all (transitive) sub-proofs including this.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- DagProof → AnyRef → Any
-
def
treeLike: TreeLikeOps[Proof]
Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.
-
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 →[B](y: B): (DagProof[Proof], B)
This is the API documentation for GAPT.
The main package is at.logic.gapt.