Class/Object

ap.proof.tree

AndTree

Related Docs: object AndTree | package tree

Permalink

class AndTree extends ProofTree

Linear Supertypes
ProofTree, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AndTree
  2. ProofTree
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def bindingContext: BindingContext

    Permalink
    Definition Classes
    ProofTree
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. lazy val closingConstantFreedom: ConstantFreedom

    Permalink

    The constants that can be considered free (resp., that have to be considered non-free) in this proof tree.

    The constants that can be considered free (resp., that have to be considered non-free) in this proof tree.

    Definition Classes
    AndTreeProofTree
  8. lazy val closingConstraint: Conjunction

    Permalink

    The fully simplified closing constraint

    The fully simplified closing constraint

    Definition Classes
    AndTreeProofTree
  9. def constantFreedom: ConstantFreedom

    Permalink
    Definition Classes
    ProofTree
  10. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  12. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. lazy val fixedConstantFreedom: Boolean

    Permalink

    true if the sets of free constants have reached a fixed point

    true if the sets of free constants have reached a fixed point

    Definition Classes
    AndTreeProofTree
  14. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  16. lazy val height: Int

    Permalink
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. val left: ProofTree

    Permalink
  19. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  20. def newConstantFreedomForSubtrees(cf: ConstantFreedom): (ConstantFreedom, ConstantFreedom)

    Permalink

    Given a new constant freedom for this proof tree, derive the corresponding freedoms for the direct subtrees.

  21. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. def order: TermOrder

    Permalink
    Definition Classes
    ProofTree
  24. val partialCertificate: PartialCertificate

    Permalink
  25. val right: ProofTree

    Permalink
  26. lazy val stepMeaningful: Boolean

    Permalink

    true if there are chances that the closingConstraint of this tree changes by applying rules to any goal

    true if there are chances that the closingConstraint of this tree changes by applying rules to any goal

    Definition Classes
    AndTreeProofTree
  27. lazy val stepPossible: Boolean

    Permalink

    true if it is possible to apply rules to any goal in this tree

    true if it is possible to apply rules to any goal in this tree

    Definition Classes
    AndTreeProofTree
  28. lazy val subtrees: Seq[ProofTree]

    Permalink
    Definition Classes
    AndTreeProofTree
  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  30. def toString(): String

    Permalink
    Definition Classes
    AndTree → AnyRef → Any
  31. def update(newLeft: ProofTree, newRight: ProofTree, newPartialCertificate: PartialCertificate): ProofTree

    Permalink
  32. def update(newLeft: ProofTree, newRight: ProofTree, newConstantFreedom: ConstantFreedom): ProofTree

    Permalink
  33. def update(newSubtrees: Seq[ProofTree]): ProofTree

    Permalink
  34. val vocabulary: Vocabulary

    Permalink

    the vocabulary available at a certain node in the proof

    the vocabulary available at a certain node in the proof

    Definition Classes
    AndTreeProofTree
  35. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from ProofTree

Inherited from AnyRef

Inherited from Any

Ungrouped