Class

ap.parser

AbstractCompleteFunctionPreproc

Related Doc: package parser

Permalink

abstract class AbstractCompleteFunctionPreproc extends FunctionPreproc

Introduction of triggers using the complete strategy that avoids the need for totality axioms (as in Kanger's calculus).

Linear Supertypes
FunctionPreproc, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. AbstractCompleteFunctionPreproc
  2. FunctionPreproc
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AbstractCompleteFunctionPreproc(args: FunctionPreprocArgs)

    Permalink

Abstract Value Members

  1. abstract val newFors: Seq[INamedPart]

    Permalink
    Definition Classes
    FunctionPreproc

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. lazy val allTriggeredFunctions: Set[IFunction]

    Permalink
    Attributes
    protected
    Definition Classes
    FunctionPreproc
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def encodeFunctions(f: IFormula): IFormula

    Permalink
    Attributes
    protected
    Definition Classes
    FunctionPreproc
  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. val functionOccurrences: HashMap[IFunction, Int]

    Permalink
    Attributes
    protected
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. val impliedTotalFunctions: Array[(INamedPart, Set[IFunction])]

    Permalink
    Attributes
    protected
  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  17. def newOrder: TermOrder

    Permalink
    Definition Classes
    FunctionPreproc
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. val problemFunctions: Set[IFunction]

    Permalink
    Attributes
    protected
    Definition Classes
    FunctionPreproc
  21. lazy val stdTriggerGenerator: TriggerGenerator

    Permalink
    Attributes
    protected
    Definition Classes
    FunctionPreproc
  22. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  23. val theoryTriggerFunctions: Set[IFunction]

    Permalink
    Attributes
    protected
    Definition Classes
    FunctionPreproc
  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  25. val totalFunctions: Set[IFunction]

    Permalink
    Attributes
    protected
  26. def updateFunctionOccurrences(oldFuns: Set[IFunction], newDisjunct: IFormula): Unit

    Permalink
    Attributes
    protected
  27. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from FunctionPreproc

Inherited from AnyRef

Inherited from Any

Ungrouped