WeakeningContractionMacroRule

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(p: LKProof, targetSequent: HOLSequent, strict: Boolean = true): LKProof

   
   p

   An LKProof.

   targetSequent

   The proposed end sequent.

   strict

   If true, will require that the end sequent of p contains no formula that doesn't appear at least once in targetSequent.

   returns

   p with its end sequent modified to targetSequent by means of weakening and contraction.

6. def apply(p: LKProof, antMap: Map[HOLFormula, Int], sucMap: Map[HOLFormula, Int], strict: Boolean): LKProof

   
   p

   An LKProof.

   antMap

   Map of type HOLFormula => Int that expresses “f should occur n times in the antecedent”.

   sucMap

   Map of type HOLFormula => Int that expresses “f should occur n times in the succedent”.

   strict

   If true: requires that for f -> n in antMap or sucMap, if f occurs in the root of s1, then n > 0.

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

12. 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

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

    

    Definition Classes

    ConvenienceConstructor

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

    

    Definition Classes

    AnyRef → Any

15. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

17. val longName: String

    

    The long name of the rule.

    The long name of the rule.

    Definition Classes

    ConvenienceConstructor

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

    

    Definition Classes

    AnyRef

19. final def notify(): Unit

    

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

22. def toString(): String

    

    Definition Classes

    AnyRef → Any

23. 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

24. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. def withOccConnector(p: LKProof, targetSequent: HOLSequent, strict: Boolean = true): (LKProof, OccConnector[HOLFormula])

    
    p

    An LKProof.

    targetSequent

    The proposed end sequent.

    strict

    If true, will require that the end sequent of p contains no formula that doesn't appear at least once in targetSequent.

    returns

    p with its end sequent modified to targetSequent by means of weakening and contraction and an OccConnector.

28. def withOccConnector(p: LKProof, antMap: Map[HOLFormula, Int], sucMap: Map[HOLFormula, Int], strict: Boolean): (LKProof, OccConnector[HOLFormula])

    
    p

    An LKProof.

    antMap

    Map of type HOLFormula => Int that expresses “f should occur n times in the antecedent”.

    sucMap

    Map of type HOLFormula => Int that expresses “f should occur n times in the succedent”.

    strict

    If true: requires that for f -> n in antMap or sucMap, if f occurs in the root of s1, then n > 0.

    returns

    A proof and an OccConnector connecting its end sequent to the end sequent of p.