object EqualityLeftMacroRule extends ConvenienceConstructor
- Source
- macroRules.scala
- Alphabetic
- By Inheritance
- EqualityLeftMacroRule
- 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
-
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(subProof: LKProof, equation: IndexOrFormula, auxFormula: IndexOrFormula, con: Abs): EqualityLeftRule
Like EqualityLeftRule, but the equation need not exist in the premise.
Like EqualityLeftRule, but the equation need not exist in the premise. If it doesn't, it will automatically be added via weakening. Note that the auxiliary formula does have to occur in the premise.
- subProof
The subproof.
- equation
Index of the equation or the equation itself.
- auxFormula
Index of the aux formula or the formula itself.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
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[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
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() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
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(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
withSequentConnector(subProof: LKProof, equation: IndexOrFormula, auxFormula: IndexOrFormula, con: Abs): (EqualityLeftRule, SequentConnector)
Like EqualityLeftRule, but the equation need not exist in the premise.
Like EqualityLeftRule, but the equation need not exist in the premise. If it doesn't, it will automatically be added via weakening. Note that the auxiliary formula does have to occur in the premise.
- subProof
The subproof.
- equation
Index of the equation or the equation itself.
- auxFormula
Index of the aux formula or the formula itself.
- returns
An LKProof and an SequentConnector connecting its end sequent with the end sequent of subProof.
This is the API documentation for GAPT.
The main package is gapt.