o

gapt.proofs.ceres

Projections

object Projections

Source
projections.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Projections
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply(proof: LKProof, cut_ancs: Sequent[Boolean], pred: (Formula) => Boolean): Set[LKProof]
  5. def apply(proof: LKProof, pred: (Formula) => Boolean): Set[LKProof]
  6. def apply(proof: LKProof): Set[LKProof]
  7. def apply_(proof: LKProof, cut_ancs: Sequent[Boolean], pred: (Formula) => Boolean): Set[LKProof]
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  10. def copySetToAncestor(connector: SequentConnector, s: Sequent[Boolean]): Sequent[Boolean]
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  14. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def getESAncs(proof: LKProof, cut_ancs: Sequent[Boolean]): HOLSequent
  16. def handleBinaryCutAnc(proof: LKProof, p1: LKProof, p2: LKProof, s1: Set[LKProof], s2: Set[LKProof], cut_ancs1: Sequent[Boolean], cut_ancs2: Sequent[Boolean]): Set[LKProof]
  17. def handleBinaryESAnc(proof: LKProof, parent1: LKProof, parent2: LKProof, s1: Set[LKProof], s2: Set[LKProof], constructor: (LKProof, SequentIndex, LKProof, SequentIndex) => LKProof): Set[LKProof]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. def handleNegRule(proof: LKProof, p: LKProof, a: SequentIndex, constructor: (LKProof, SequentIndex) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
  23. 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]
  24. def handleStrongQuantRule(proof: LKProof, p: LKProof, constructor: (LKProof, SequentIndex, Var, Var) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
  25. 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]
  26. 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]
  27. def handleWeakeningRule(proof: LKProof, p: LKProof, m: Formula, constructor: (LKProof, Formula) => LKProof, pred: (Formula) => Boolean)(implicit cut_ancs: Sequent[Boolean]): Set[LKProof]
  28. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  29. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  30. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  32. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  33. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  34. def toString(): String
    Definition Classes
    AnyRef → Any
  35. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  36. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  37. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  38. def weakenESAncs(esancs: HOLSequent, s: Set[LKProof]): Set[LKProof]

Inherited from AnyRef

Inherited from Any

Ungrouped