Packages

o

gapt.proofs.lk

WeakeningMacroRule

object WeakeningMacroRule extends ConvenienceConstructor

This macro rule simulates a series of weakenings in both cedents.

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

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

    A proof.

    targetSequent

    A sequent of formulas.

    strict

    If true, will require that targetSequent contains the end sequent of p.

    returns

    A proof whose end sequent is targetSequent.

  6. def apply(p: LKProof, antList: Seq[Formula], sucList: Seq[Formula]): LKProof

    p

    A proof.

    antList

    A list of formulas.

    sucList

    A list of formulas.

    returns

    A new proof whose antecedent and succedent contain new occurrences of the formulas in antList and sucList, respectively.

  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @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[Formula], Seq[Int], Seq[Formula], Seq[Int])
    Definition Classes
    ConvenienceConstructor
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. val longName: String
    Definition Classes
    ConvenienceConstructor
  18. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  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[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
  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
    @native() @throws( ... )
  27. def withSequentConnector(p: LKProof, targetSequent: HOLSequent, strict: Boolean = true): (LKProof, SequentConnector)

    p

    A proof.

    targetSequent

    A sequent of formulas.

    strict

    If true, will require that targetSequent contains the end sequent of p.

    returns

    A proof whose end sequent is targetSequent and an SequentConnector.

  28. def withSequentConnector(p: LKProof, antList: Seq[Formula], sucList: Seq[Formula]): (LKProof, SequentConnector)

    p

    A proof.

    antList

    A list of formulas.

    sucList

    A list of formulas.

    returns

    A new proof whose antecedent and succedent contain new occurrences of the formulas in antList and sucList, respectively, and an SequentConnector.

Inherited from ConvenienceConstructor

Inherited from AnyRef

Inherited from Any

Ungrouped