ImpRightMacroRule

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def LKRuleCreationException(text: String): LKRuleCreationException

   

   Create an LKRuleCreationException with a message starting with "Cannot create $longName: ..."

   Create an LKRuleCreationException with a message starting with "Cannot create $longName: ..."

   text

   The rest of the message.

   Attributes

   protected

   Definition Classes

   ConvenienceConstructor

5. def apply(subProof: LKProof, impPremise: IndexOrFormula, impConclusion: IndexOrFormula): ImpRightRule

   

   This simulates an additive →:r-rule: if either aux formula (but not both) is missing, it will be added to the premise by weakening before creating the →:r inference.

   This simulates an additive →:r-rule: if either aux formula (but not both) is missing, it will be added to the premise by weakening before creating the →:r inference.

   Each of the aux formulas can be given as an index or a formula. If it is given as a formula, the constructor will attempt to find an appropriate index on its own.

   subProof

   The subproof.

   impPremise

   Index of the premise or the premise itself.

   impConclusion

   Index of the conclusion or the conclusion itself.

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11. def findAndValidate(premise: HOLSequent)(antIndicesFormulas: Seq[IndexOrFormula], sucIndicesFormulas: Seq[IndexOrFormula]): (Seq[Int], Seq[Int])

    

    Combines findIndicesOrFormulasInPremise and validateIndices.

    Combines findIndicesOrFormulasInPremise and validateIndices. That is, it will return a pair of lists of indices and throw an exception if either list contains a -1.

    premise

    The sequent in question.

    antIndicesFormulas

    The list of indices or formulas in the antecedent.

    sucIndicesFormulas

    The list of indices or formulas in the succedent.

    Attributes

    protected

    Definition Classes

    ConvenienceConstructor

12. def findIndicesOrFormulasInPremise(premise: HOLSequent)(antIndicesFormulas: Seq[IndexOrFormula], sucIndicesFormulas: Seq[IndexOrFormula]): (Seq[HOLFormula], Seq[Int], Seq[HOLFormula], Seq[Int])

    

    Definition Classes

    ConvenienceConstructor

13. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

15. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

16. val longName: String

    

    The long name of the rule.

    The long name of the rule.

    Definition Classes

    ConvenienceConstructor

17. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

18. final def notify(): Unit

    

    Definition Classes

    AnyRef

19. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

20. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

21. def toString(): String

    

    Definition Classes

    AnyRef → Any

22. def validateIndices(premise: HOLSequent)(antFormulas: Seq[HOLFormula], antIndices: Seq[Int], sucFormulas: Seq[HOLFormula], sucIndices: Seq[Int]): Unit

    

    Throws an exception if the output of findFormulasInPremise contains any -1 entries.

    Throws an exception if the output of findFormulasInPremise contains any -1 entries.

    premise

    The sequent in question.

    antFormulas

    The list of formulas in the antecedent.

    antIndices

    The list of indices corresponding to antFormulas.

    sucFormulas

    The list of formulas in the succedent.

    sucIndices

    The list indices corresponding to sucFormulas.

    Attributes

    protected

    Definition Classes

    ConvenienceConstructor

23. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

24. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

25. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. def withOccConnector(subProof: LKProof, impPremise: IndexOrFormula, impConclusion: IndexOrFormula): (ImpRightRule, OccConnector[HOLFormula])

    

    This simulates an additive →:r-rule: if either aux formula (but not both) is missing, it will be added to the premise by weakening before creating the →:r inference.

    This simulates an additive →:r-rule: if either aux formula (but not both) is missing, it will be added to the premise by weakening before creating the →:r inference.

    Each of the aux formulas can be given as an index or a formula. If it is given as a formula, the constructor will attempt to find an appropriate index on its own.

    subProof

    The subproof.

    impPremise

    Index of the premise or the premise itself.

    impConclusion

    Index of the conclusion or the conclusion itself.

    returns

    An LKProof and an OccConnector connecting its end sequent with the end sequent of subProof.