package spin
- Source
- package.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- spin
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- class AxiomGenerator extends AnyRef
- class FormulaTester extends AnyRef
Tests formulas for counter examples.
Tests formulas for counter examples.
The formulas are tested as follows: first the free variables and the quantifiers are instantiated by a some random closed terms, the resulting formula is simplified according to the context, and tested for validity.
- case class Occurences(primary: Map[Expr, Seq[LambdaPosition]], accumulators: Map[Expr, Seq[LambdaPosition]], passive: Map[Expr, Seq[LambdaPosition]], underSame: Set[Set[Expr]]) extends Product with Serializable
- class OccurrencesFinder extends AnyRef
- case class Positions(rules: Set[ConditionalReductionRule], allPositions: Map[Const, Positions]) extends Product with Serializable
- class Spin extends AnyRef
- case class SpinOptions(performGeneralization: Boolean = true, sampleTestTerms: Int = 5, acceptNotNormalized: Boolean = false, splitting: Boolean = true, equality: Boolean = true, propositional: Boolean = false) extends Product with Serializable
- performGeneralization
Apply generalization to derived clauses.
- sampleTestTerms
The number of test terms to use for testing.
- acceptNotNormalized
Accept formulas for which no counterexample could be found because the samples do not reduce to literal form (e.g. if the formula contains non-simplifiable Skolem constants as in nil = s₁).
Value Members
- def isConstructor(c: Const)(implicit ctx: Context): Boolean
- def lambdaType(t: String): Boolean
- def negate(f: Formula): Formula
- def replaceExpr(f: Formula, x: Expr, e: Expr): Formula
- def resType(ty: Ty): Ty
- object Positions extends Serializable
- object Spin
- object asInductiveConst
- object constructorRules
- object isInductive
- object reflRules
This is the API documentation for GAPT.
The main package is gapt.