object WeakeningLeftMacroRule
This macro rule simulates a series of weakenings in the antecedent.
- Source
- macroRules.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- WeakeningLeftMacroRule
- AnyRef
- Any
- Hide All
- Show All
Visibility
- 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, formula: Formula): LKProof
-
def
apply(p: LKProof, formula: Formula, n: Int): LKProof
- p
An LKProof.
- formula
A Formula.
- n
A natural number.
- returns
p extended with weakenings such that formula occurs at least n times in the antecedent of the end sequent.
-
def
apply(p: LKProof, formulas: Seq[Formula]): LKProof
- p
A proof.
- formulas
A list of formulas.
- returns
A new proof whose antecedent contains new occurrences of the formulas in formulas.
-
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
-
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
-
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
-
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(p: LKProof, formula: Formula, n: Int): (LKProof, SequentConnector)
- p
An LKProof.
- formula
A Formula.
- n
A natural number.
- returns
p extended with weakenings such that formula occurs at least n times in the antecedent of the end sequent and an SequentConnector.
-
def
withSequentConnector(p: LKProof, formulas: Seq[Formula]): (LKProof, SequentConnector)
- p
A proof.
- formulas
A list of formulas.
- returns
A new proof whose antecedent contains new occurrences of the formulas in formulas and an SequentConnector.
This is the API documentation for GAPT.
The main package is gapt.