class AndTree extends ProofTree
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- AndTree
- ProofTree
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def bindingContext: BindingContext
- Definition Classes
- ProofTree
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- lazy val closingConstantFreedom: ConstantFreedom
The constants that can be considered free (resp., that have to be considered non-free) in this proof tree.
- lazy val closingConstraint: Conjunction
The fully simplified closing constraint
- def constantFreedom: ConstantFreedom
- Definition Classes
- ProofTree
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- lazy val fixedConstantFreedom: Boolean
true
if the sets of free constants have reached a fixed point - final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- lazy val height: Int
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val left: ProofTree
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newConstantFreedomForSubtrees(cf: ConstantFreedom): (ConstantFreedom, ConstantFreedom)
Given a new constant freedom for this proof tree, derive the corresponding freedoms for the direct subtrees.
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def order: TermOrder
- Definition Classes
- ProofTree
- val partialCertificate: PartialCertificate
- val right: ProofTree
- lazy val stepMeaningful: Boolean
true
if there are chances that theclosingConstraint
of this tree changes by applying rules to any goal - lazy val stepPossible: Boolean
true
if it is possible to apply rules to any goal in this tree - lazy val subtrees: Seq[ProofTree]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AndTree → AnyRef → Any
- def update(newLeft: ProofTree, newRight: ProofTree, newPartialCertificate: PartialCertificate): ProofTree
- def update(newLeft: ProofTree, newRight: ProofTree, newConstantFreedom: ConstantFreedom): ProofTree
- def update(newSubtrees: Seq[ProofTree]): ProofTree
- val vocabulary: Vocabulary
the vocabulary available at a certain node in the proof
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)