object ContractionRightMacroRule
This macro rule simulates a series of contractions in the succedent.
- Alphabetic
- By Inheritance
- ContractionRightMacroRule
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
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: Formula, n: Int = 1): LKProof
Contracts one formula in the succedent down to n occurrences.
Contracts one formula in the succedent down to n occurrences. Use with care!
- p
A proof.
- form
A formula.
- n
Maximum number of occurrences of form in the succedent 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 succedent 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[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withSequentConnector(p: LKProof, form: Formula, n: Int = 1): (LKProof, SequentConnector)
Contracts one formula in the succedent down to n occurrences.
Contracts one formula in the succedent down to n occurrences. Use with care!
- p
A proof.
- form
A formula.
- n
Maximum number of occurrences of form in the succedent of the end sequent. Defaults to 1, i.e. all occurrences are contracted.
- returns
A proof and an SequentConnector connecting its end sequent with the end sequent of p.
- def withSequentConnector(p: LKProof, occs: Seq[SequentIndex]): (LKProof, SequentConnector)
- p
A proof.
- occs
A list of occurrences of a formula in the succedent of s1.
- returns
A proof ending with as many contraction rules as necessary to contract occs into a single occurrence and an SequentConnector.
This is the API documentation for GAPT.
The main package is gapt.