object WeakeningContractionMacroRule extends ConvenienceConstructor
This macro rule simulates multiple weakenings and contractions in both cedents.
- Source
- macroRules.scala
- Alphabetic
- By Inheritance
- WeakeningContractionMacroRule
- ConvenienceConstructor
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
type
IndexOrFormula = Either[SequentIndex, HOLFormula]
- Definition Classes
- ConvenienceConstructor
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
-
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
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.
-
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.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): 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[HOLFormula], Seq[Int], Seq[HOLFormula], Seq[Int])
- Definition Classes
- ConvenienceConstructor
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
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
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
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.
-
def
withSequentConnector(p: LKProof, antMap: Map[HOLFormula, Int], sucMap: Map[HOLFormula, Int], strict: Boolean): (LKProof, SequentConnector)
- 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 SequentConnector connecting its end sequent to the end sequent of p.