Object/Class

at.logic.gapt.algorithms.rewriting

DefinitionElimination

Related Docs: class DefinitionElimination | package rewriting

Permalink

object DefinitionElimination extends DefinitionElimination

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DefinitionElimination
  2. DefinitionElimination
  3. Logger
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. type DefinitionsMap = Map[LambdaExpression, LambdaExpression]

    Permalink
    Definition Classes
    DefinitionElimination
  2. type ProcessedDefinitionsMap = Map[SymbolA, (List[Var], HOLFormula)]

    Permalink
    Definition Classes
    DefinitionElimination

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. def apply(dmap: DefinitionsMap, p: LKProof): LKProof

    Permalink
    Definition Classes
    DefinitionElimination
  5. def apply(dmap: DefinitionsMap, f: LambdaExpression): LambdaExpression

    Permalink
    Definition Classes
    DefinitionElimination
  6. def apply(dmap: DefinitionsMap, f: HOLFormula): HOLFormula

    Permalink
    Definition Classes
    DefinitionElimination
  7. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def debug(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  10. def eliminate_in_proof(rewrite: (LambdaExpression) ⇒ LambdaExpression, proof: LKProof): LKProof

    Permalink
    Definition Classes
    DefinitionElimination
  11. def eliminate_in_proof_(rewrite: (LambdaExpression) ⇒ LambdaExpression, proof: LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  12. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  14. def error(msg: ⇒ String, e: Throwable): Nothing

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  15. def error(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  16. def expand_dmap(dmap: DefinitionsMap): DefinitionsMap

    Permalink
    Definition Classes
    DefinitionElimination
  17. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def fixedpoint_seq[A](f: (A) ⇒ A, l: Seq[A]): Seq[A]

    Permalink
    Definition Classes
    DefinitionElimination
  19. def fixedpoint_val[A](f: (A) ⇒ A, l: A): A

    Permalink
    Definition Classes
    DefinitionElimination
  20. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  21. def handleBinaryLogicalRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof1: LKProof, uproof2: LKProof, root: OccSequent, aux1: FormulaOccurrence, aux2: FormulaOccurrence, prin: FormulaOccurrence, createRule: (LKProof, LKProof, FormulaOccurrence, FormulaOccurrence) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  22. def handleContractionRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof: LKProof, root: OccSequent, aux1: FormulaOccurrence, aux2: FormulaOccurrence, createRule: (LKProof, FormulaOccurrence, FormulaOccurrence) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  23. def handleDefinitionRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof: LKProof, root: OccSequent, aux: FormulaOccurrence, prin: FormulaOccurrence, createRule: (LKProof, FormulaOccurrence, HOLFormula) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  24. def handleEquationalRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof1: LKProof, uproof2: LKProof, root: OccSequent, aux1: FormulaOccurrence, aux2: FormulaOccurrence, prin: FormulaOccurrence, createRule: (LKProof, LKProof, FormulaOccurrence, FormulaOccurrence, HOLFormula) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  25. def handleNegationRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof: LKProof, root: OccSequent, aux: FormulaOccurrence, createRule: (LKProof, FormulaOccurrence) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  26. def handleStrongQuantifierRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof: LKProof, root: OccSequent, aux: FormulaOccurrence, prin: FormulaOccurrence, eigenvar: Var, createRule: (LKProof, FormulaOccurrence, HOLFormula, Var) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  27. def handleUnaryLogicalRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof: LKProof, root: OccSequent, aux: FormulaOccurrence, weakened_formula: HOLFormula, createRule: (LKProof, FormulaOccurrence, HOLFormula) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  28. def handleWeakQuantifierRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof: LKProof, root: OccSequent, aux: FormulaOccurrence, prin: FormulaOccurrence, substituted_term: LambdaExpression, createRule: (LKProof, FormulaOccurrence, HOLFormula, LambdaExpression) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  29. def handleWeakeningRule(rewrite: (LambdaExpression) ⇒ LambdaExpression, uproof: LKProof, root: OccSequent, prin: FormulaOccurrence, createRule: (LKProof, HOLFormula) ⇒ LKProof): (Map[FormulaOccurrence, FormulaOccurrence], LKProof)

    Permalink
    Definition Classes
    DefinitionElimination
  30. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  31. def info(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  32. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  33. val log: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  34. def loggerName: String

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  35. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  36. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  38. def replaceAll_in(dmap: DefinitionsMap, e: LambdaExpression): LambdaExpression

    Permalink
    Definition Classes
    DefinitionElimination
  39. def replaceAll_informula(dmap: DefinitionsMap, e: HOLFormula): HOLFormula

    Permalink
    Definition Classes
    DefinitionElimination
  40. def switchargs[A, B, C, D](f: (A, B, C) ⇒ D): (A, C, B) ⇒ D

    Permalink
    Definition Classes
    DefinitionElimination
  41. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  42. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  43. def trace(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  44. def try_to_match(dmap: DefinitionsMap, e: LambdaExpression): LambdaExpression

    Permalink
    Definition Classes
    DefinitionElimination
  45. def try_to_matchformula(dmap: DefinitionsMap, e: LambdaExpression): HOLFormula

    Permalink
    Definition Classes
    DefinitionElimination
  46. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. def warn(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  50. def warn(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger

Inherited from DefinitionElimination

Inherited from Logger

Inherited from AnyRef

Inherited from Any

Ungrouped