object Projections
- Source
- projections.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Projections
- 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(proof: LKProof, cut_ancs: Sequent[Boolean], pred: (Formula) => Boolean): Set[LKProof]
- def apply(proof: LKProof, pred: (Formula) => Boolean): Set[LKProof]
- def apply(proof: LKProof): Set[LKProof]
- def apply_(proof: LKProof, cut_ancs: Sequent[Boolean], pred: (Formula) => Boolean): Set[LKProof]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def copySetToAncestor(connector: SequentConnector, s: Sequent[Boolean]): Sequent[Boolean]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): 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[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getESAncs(proof: LKProof, cut_ancs: Sequent[Boolean]): HOLSequent
- def handleBinaryCutAnc(proof: LKProof, p1: LKProof, p2: LKProof, s1: Set[LKProof], s2: Set[LKProof], cut_ancs1: Sequent[Boolean], cut_ancs2: Sequent[Boolean]): Set[LKProof]
- def handleBinaryESAnc(proof: LKProof, parent1: LKProof, parent2: LKProof, s1: Set[LKProof], s2: Set[LKProof], constructor: (LKProof, SequentIndex, LKProof, SequentIndex) => LKProof): Set[LKProof]
- def handleBinaryRule(proof: LKProof, p1: LKProof, p2: LKProof, a1: SequentIndex, a2: SequentIndex, constructor: (LKProof, SequentIndex, LKProof, SequentIndex) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleContractionRule(proof: LKProof, p: LKProof, a1: SequentIndex, a2: SequentIndex, constructor: (LKProof, SequentIndex, SequentIndex) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleDefRule(proof: LKProof, p: LKProof, a: SequentIndex, m: Formula, constructor: (LKProof, SequentIndex, Formula) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleEqRule(proof: LKProof, p: LKProof, e: SequentIndex, a: SequentIndex, con: Abs, constructor: (LKProof, SequentIndex, SequentIndex, Abs) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleNegRule(proof: LKProof, p: LKProof, a: SequentIndex, constructor: (LKProof, SequentIndex) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleSkQuantRule(proof: LKProof, p: LKProof, a: SequentIndex, m: Formula, t: Expr, constructor: (LKProof, SequentIndex, Formula, Expr) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleStrongQuantRule(proof: LKProof, p: LKProof, constructor: (LKProof, SequentIndex, Var, Var) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleUnaryRule[T](proof: LKProof, p: LKProof, a1: SequentIndex, a2: SequentIndex, constructor: (LKProof, SequentIndex, SequentIndex) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleWeakQuantRule(proof: LKProof, p: LKProof, a: SequentIndex, f: Formula, t: Expr, qvar: Var, constructor: (LKProof, SequentIndex, Formula, Expr, Var) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def handleWeakeningRule(proof: LKProof, p: LKProof, m: Formula, constructor: (LKProof, Formula) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- 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()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- 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(classOf[java.lang.InterruptedException])
- 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()
- def weakenESAncs(esancs: HOLSequent, s: Set[LKProof]): Set[LKProof]
This is the API documentation for GAPT.
The main package is gapt.