object natdivisible extends Theory
- Source
- nat.scala
- Alphabetic
- By Inheritance
- natdivisible
- Theory
- Theory0
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- case class LemmaHandle(proofName: Expr) extends Product with Serializable
Captures an LKProof together with the set of previous lemmas used in it.
Captures an LKProof together with the set of previous lemmas used in it.
- Definition Classes
- Theory
- case class indfn(constName: String, desc: Formula) extends LemmaHelper[Unit] with Product with Serializable
- Attributes
- protected
- Definition Classes
- Theory
- case class lemma(openFormula: Formula, attributes: String*) extends LemmaHelper[LemmaHandle] with Product with Serializable
- Attributes
- protected
- Definition Classes
- Theory
Value Members
- object LemmaHandle extends Serializable
- Definition Classes
- Theory
- 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 addNow(update: Update): Unit
- Attributes
- protected
- Definition Classes
- Theory0
- def addProof(name: Expr, proof: => LKProof): Unit
- Attributes
- protected
- Definition Classes
- Theory0
- def allProofs: Vector[(String, Eval[DelayedProofResult])]
- Definition Classes
- Theory
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def attr(attrNames: String*)(lemmaNames: String*): Unit
Adds a list of attributes to a list of lemmas.
Adds a list of attributes to a list of lemmas.
- Attributes
- protected
- Definition Classes
- Theory
- def axiom(f: Formula)(implicit name: Name): Unit
Adds a formula to this theory as an axiom.
Adds a formula to this theory as an axiom.
- Attributes
- protected
- Definition Classes
- Theory
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def const(c: Const): Unit
Adds a constant to this theory's context.
Adds a constant to this theory's context.
- Attributes
- protected
- Definition Classes
- Theory
- implicit def ctx: Context
- Definition Classes
- Theory0
- def ctxWithProofDefinitions(): ImmutableContext
- Definition Classes
- Theory
- implicit def curCtx: Context
- Attributes
- protected
- Definition Classes
- Theory
- def dfn(eqn: Formula): Unit
- Attributes
- protected
- Definition Classes
- Theory
- val dvd0: LemmaHandle
- val dvd0l: LemmaHandle
- val dvd1: LemmaHandle
- val dvd1r: LemmaHandle
- val dvdantisym: LemmaHandle
- val dvdcancel: LemmaHandle
- val dvdcancel2: LemmaHandle
- val dvdle: LemmaHandle
- val dvdmod: LemmaHandle
- val dvdmul: LemmaHandle
- val dvdmulr: LemmaHandle
- val dvdprime: LemmaHandle
- val dvdprime_: LemmaHandle
- val dvdprime__: LemmaHandle
- val dvdrefl: LemmaHandle
- val dvds0: LemmaHandle
- val dvdtrans: LemmaHandle
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def fun(c: Const, equations: String*): Unit
- Attributes
- protected
- Definition Classes
- Theory
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- val imports: List[Theory]
- Definition Classes
- Theory0
- def indTy(ty0: Ty, ctrs: Const*): Unit
- Attributes
- protected
- Definition Classes
- Theory
- def infix(operator: String, precedence: Int, leftAssociative: Boolean = true, const: String = null): Unit
Adds an operator as infix notation for an existing constant.
Adds an operator as infix notation for an existing constant.
- operator
The operator to add.
- precedence
The precedence of the operator.
- leftAssociative
Whether the operator associates to the left.
- const
The constant which the operator denotes. If nothing is supplied, it will assumed to have the same name as the operator.
- Attributes
- protected
- Definition Classes
- Theory
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def main(args: Array[String]): Unit
- Definition Classes
- Theory
- val muldiv: LemmaHandle
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- val notprime0: LemmaHandle
- val notprime1: LemmaHandle
- val prime2: LemmaHandle
- val primecomp: LemmaHandle
- val primene0: LemmaHandle
- val primene1: LemmaHandle
- def proof(name: String): LKProof
- Definition Classes
- Theory
- def proofsHere: Vector[(String, Eval[DelayedProofResult])]
- Definition Classes
- Theory0
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- val transitiveImports: Vector[Theory]
- Definition Classes
- Theory
- 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()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
This is the API documentation for GAPT.
The main package is gapt.