Trait/Object

ap.proof.tree

ProofTreeOneChild

Related Docs: object ProofTreeOneChild | package tree

Permalink

trait ProofTreeOneChild extends ProofTree

Common superclass for proof trees that have exactly one direct subtree. Such trees know about two TermOrders: the TermOrder of the closing constraint coming from the subtree, and the TermOrder of the constraint of this ProofTree

Linear Supertypes
ProofTree, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ProofTreeOneChild
  2. ProofTree
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract 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
    ProofTree
  2. abstract val closingConstraint: Conjunction

    Permalink

    The fully simplified closing constraint

    The fully simplified closing constraint

    Definition Classes
    ProofTree
  3. abstract 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
    ProofTree
  4. abstract def newConstantFreedomForSubtree(cf: ConstantFreedom): ConstantFreedom

    Permalink

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

  5. abstract 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
    ProofTree
  6. abstract val subtree: ProofTree

    Permalink
  7. abstract val subtreeOrder: TermOrder

    Permalink
    Attributes
    protected
  8. abstract def update(newSubtree: ProofTree, newConstantFreedom: ConstantFreedom): ProofTree

    Permalink

    Replace the subtree and the constant freedom status with new values.

  9. abstract 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
    ProofTree

Concrete 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. def constantFreedom: ConstantFreedom

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  17. def order: TermOrder

    Permalink
    Definition Classes
    ProofTree
  18. 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
    ProofTreeOneChildProofTree
  19. lazy val subtrees: Seq[ProofTree]

    Permalink
    Definition Classes
    ProofTreeOneChildProofTree
  20. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit

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

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

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

Inherited from ProofTree

Inherited from AnyRef

Inherited from Any

Ungrouped