object WeakeningMacroRule extends ConvenienceConstructor
This macro rule simulates a series of weakenings in both cedents.
- Source
- WeakeningMacroRule.scala
- Alphabetic
- By Inheritance
- WeakeningMacroRule
- ConvenienceConstructor
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- 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
- 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.
- 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.
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- 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
- def findIndicesOrFormulasInPremise(premise: HOLSequent)(antIndicesFormulas: Seq[IndexOrFormula], sucIndicesFormulas: Seq[IndexOrFormula]): (Seq[Formula], Seq[Int], Seq[Formula], Seq[Int])
- Definition Classes
- ConvenienceConstructor
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val longName: String
- Definition Classes
- ConvenienceConstructor
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- 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.
- 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.
This is the API documentation for GAPT.
The main package is gapt.