AntiSymmetryInference

Instance Constructors

new AntiSymmetryInference(leftInEq: CertInequality, rightInEq: CertInequality, result: CertEquation, order: TermOrder)

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
final def asInstanceOf[T0]: T0

Definition Classes
Any
val assumedFormulas: Set[CertFormula]

Definition Classes
AntiSymmetryInference → BranchInference
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
lazy val constants: Set[ConstantTerm]

Set of constants occurring in this inference.
Set of constants occurring in this inference.

Definition Classes
BranchInference
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val leftInEq: CertInequality
val localBoundConstants: Set[ConstantTerm]

Constants bound by the inference.
Constants bound by the inference.

Definition Classes
BranchInference
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val order: TermOrder
def propagateConstraint(closingConstraint: Conjunction): Conjunction

Define the modification imposed by this rule application on the closing constraint.
Define the modification imposed by this rule application on the closing constraint.

Definition Classes
AntiSymmetryInference → BranchInference
val providedFormulas: Set[CertFormula]

Formulae that are introduced into the antecedent by this rule application.
Formulae that are introduced into the antecedent by this rule application. This will implicitly simplify formulae (all simplifications that are built into the datastructures are carried out).

Definition Classes
AntiSymmetryInference → BranchInference
val result: CertEquation
val rightInEq: CertInequality
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AntiSymmetryInference → AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object AntiSymmetryInference | package certificates

case class AntiSymmetryInference(leftInEq: CertInequality, rightInEq: CertInequality, result: CertEquation, order: TermOrder) extends BranchInference with Product with Serializable

Instance Constructors

new AntiSymmetryInference(leftInEq: CertInequality, rightInEq: CertInequality, result: CertEquation, order: TermOrder)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

val assumedFormulas: Set[CertFormula]

def clone(): AnyRef

lazy val constants: Set[ConstantTerm]

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

val leftInEq: CertInequality

val localBoundConstants: Set[ConstantTerm]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val order: TermOrder

def propagateConstraint(closingConstraint: Conjunction): Conjunction

val providedFormulas: Set[CertFormula]

val result: CertEquation

val rightInEq: CertInequality

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from BranchInference

Inherited from AnyRef

Inherited from Any

Ungrouped