object LeftRankInductionReduction extends CutReduction
- Source
- rankReduction.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- LeftRankInductionReduction
- CutReduction
- Reduction
- 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
andThen(reduction: CutReduction): CutReduction
- Definition Classes
- CutReduction
-
def
andThen(reduction: Reduction): Reduction
- Definition Classes
- Reduction
-
def
apply(cut: CutRule): Option[LKProof]
Reduces a cut by moving the cut towards the proof's leaves.
Reduces a cut by moving the cut towards the proof's leaves.
- cut
The cut to be reduced.
- returns
A reduced proof if the given cut is reducible w.r.t to some induction inference, otherwise None.
- def applyWithSequentConnector(cut: CutRule): Option[(LKProof, SequentConnector)]
-
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
-
def
isRedex(proof: LKProof): Boolean
- Definition Classes
- Reduction
-
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()
-
def
orElse(reduction: CutReduction): CutReduction
- Definition Classes
- CutReduction
-
def
orElse(reduction: Reduction): Reduction
- Definition Classes
- Reduction
-
def
redexes(proof: LKProof): Seq[LKProof]
- Definition Classes
- Reduction
-
def
reduce(proof: CutRule): Option[LKProof]
- Definition Classes
- LeftRankInductionReduction → CutReduction
-
def
reduce(proof: LKProof): Option[LKProof]
- Definition Classes
- CutReduction → Reduction
-
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( ... )
This is the API documentation for GAPT.
The main package is gapt.