object ExponentialCompression extends TacticsProof
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ExponentialCompression
- TacticsProof
- TacticsProof0
- 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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- val certainlyTheEndSequentForRealTrustMeDude: Sequent[Formula]
- val chiBc: LKProof
- val chiSc: LKProof
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
- val conjunction: Sequent[Formula]
-
implicit
def
ctx: ImmutableContext
- Definition Classes
- TacticsProof0
-
def
ctx_=(newContext: ImmutableContext): Unit
- Attributes
- protected
- Definition Classes
- TacticsProof0
- val endSequent: Sequent[Formula]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val esChiBc: Sequent[(String, Formula)]
- val esChiSc: Sequent[(String, Formula)]
- val esOmegaBc: Sequent[(String, Formula)]
- val esOmegaSc: Sequent[(String, Formula)]
- val esPhiBc: Sequent[(String, Formula)]
- val esPhiSc: Sequent[(String, Formula)]
- val esPreOmegaBc: Sequent[(String, Formula)]
- val esPreOmegaSc: Sequent[(String, Formula)]
- val esPreXhiBc: Sequent[(String, Formula)]
- val esPreXhiSc: Sequent[(String, Formula)]
- val esTauBc: Sequent[(String, Formula)]
- val esTauSc: Sequent[(String, Formula)]
- val esXhiBc: Sequent[(String, Formula)]
- val esXhiSc: Sequent[(String, Formula)]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val intermediateEndSequent: Sequent[Formula]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val leftBranch: Sequent[Formula]
-
def
main(args: Array[String]): Unit
- Definition Classes
- TacticsProof
-
val
mutableContext: MutableContext
- Attributes
- protected
- Definition Classes
- TacticsProof0
-
implicit
def
mutableCtxImplicit: MutableContext
- Attributes
- protected
- Definition Classes
- TacticsProof
-
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()
- val omegaBc: LKProof
- val omegaSc: LKProof
- val phiBc: LKProof
- val phiSc: LKProof
- val preOmegaBc: LKProof
- val preOmegaSc: LKProof
- val preRightBranch: Sequent[Formula]
- val preXhiBc: LKProof
- val preXhiSc: LKProof
- val rightBranch: Sequent[Formula]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- val tauBc: LKProof
- val tauSc: LKProof
-
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( ... )
- val xhiBc: LKProof
- val xhiSc: LKProof
This is the API documentation for GAPT.
The main package is gapt.