object ContractionLeftMacroRule
This macro rule simulates a series of contractions in the antecedent.
- Source
- macroRules.scala
- Alphabetic
- By Inheritance
- ContractionLeftMacroRule
- 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
apply(p: LKProof, form: HOLFormula, n: Int = 1): LKProof
Contracts one formula in the antecedent down to n occurrences.
Contracts one formula in the antecedent down to n occurrences. Use with care!
- p
A proof.
- form
A formula.
- n
Maximum number of occurrences of form in the antecedent of the end sequent. Defaults to 1, i.e. all occurrences are contracted.
-
def
apply(p: LKProof, occs: Seq[SequentIndex]): LKProof
- p
A proof.
- occs
A list of occurrences of a Formula in the antecedent of s1.
- returns
A proof ending with as many contraction rules as necessary to contract occs into a single occurrence.
-
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] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
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
-
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
withOccConnector(p: LKProof, form: HOLFormula, n: Int = 1): (LKProof, OccConnector[HOLFormula])
Contracts one formula in the antecedent down to n occurrences.
Contracts one formula in the antecedent down to n occurrences. Use with care!
- p
A proof.
- form
A formula.
- n
Maximum number of occurrences of form in the antecedent of the end sequent. Defaults to 1, i.e. all occurrences are contracted.
- returns
A proof and an OccConnector connecting its end sequent with the end sequent of p.
-
def
withOccConnector(p: LKProof, occs: Seq[SequentIndex]): (LKProof, OccConnector[HOLFormula])
- p
A proof.
- occs
A list of occurrences of a Formula in the antecedent of s1.
- returns
A proof ending with as many contraction rules as necessary to contract occs into a single occurrence and an OccConnector.