object FactorialFunctionEqualityExampleProof extends ProofSequence
Proof of f(n) = g(n, 1), where f is the head recursive and g the tail recursive formulation of the factorial function
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- FactorialFunctionEqualityExampleProof
- ProofSequence
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
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(n: Int): LKProof
- Definition Classes
- FactorialFunctionEqualityExampleProof → ProofSequence
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val assoc_mul_axiom: AllQuantifiedConditionalAxiomHelper
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- val compat_mul_axiom: AllQuantifiedConditionalAxiomHelper
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- val f: String
- def f1(sym: String, arg: FOLTerm): FOLTerm
- def f2(arg1: FOLTerm, sym: String, arg2: FOLTerm): FOLTerm
- def f2(sym: String, arg1: FOLTerm, arg2: FOLTerm): FOLTerm
- val f_ax_1: FOLAtom
- val f_ax_2: FOLFormula
- val g: String
- val g_ax_1: AllQuantifiedConditionalAxiomHelper
- val g_ax_2: FOLFormula
- val g_compat_2: AllQuantifiedConditionalAxiomHelper
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def induction_steps(n: Int): LKProof
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val m: String
- val mul_neutral_axiom: AllQuantifiedConditionalAxiomHelper
- val mul_neutral_axiom_2: AllQuantifiedConditionalAxiomHelper
- def name: String
- Definition Classes
- ProofSequence
- 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 p: String
- val refl_axiom: AllQuantifiedConditionalAxiomHelper
- val s: String
- val symm_axiom: FOLFormula
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- val trans_axiom: AllQuantifiedConditionalAxiomHelper
- 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])
- val x: FOLVar
- val y: FOLVar
- val z: FOLVar
This is the API documentation for GAPT.
The main package is gapt.