o

gapt.proofs.lk.rules.macros

WeakeningContractionMacroRule

object WeakeningContractionMacroRule extends ConvenienceConstructor

This macro rule simulates multiple weakenings and contractions in both cedents.

Source
WeakeningContractionMacroRule.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WeakeningContractionMacroRule
  2. ConvenienceConstructor
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

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. final 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[Formula, Int], sucMap: Map[Formula, Int], strict: Boolean): LKProof

    p

    An LKProof.

    antMap

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

    sucMap

    Map of type Formula => 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[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  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[Formula], Seq[Int], Seq[Formula], Seq[Int])
    Definition Classes
    ConvenienceConstructor
  13. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. val longName: String
    Definition Classes
    ConvenienceConstructor
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  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[Formula], antIndices: Seq[Int], sucFormulas: Seq[Formula], 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(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  26. def withSequentConnector(p: LKProof, targetSequent: HOLSequent, strict: Boolean = true): (LKProof, SequentConnector)

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

  27. def withSequentConnector(p: LKProof, antMap: Map[Formula, Int], sucMap: Map[Formula, Int], strict: Boolean): (LKProof, SequentConnector)

    p

    An LKProof.

    antMap

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

    sucMap

    Map of type Formula => 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 SequentConnector connecting its end sequent to the end sequent of p.

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from ConvenienceConstructor

Inherited from AnyRef

Inherited from Any

Ungrouped