p

gapt.proofs.lk

transformations

package transformations

Content Hierarchy
Ordering
  1. Alphabetic
Visibility
  1. Public
  2. All

Type Members

  1. class IterativeParallelStrategy extends ReductionStrategy

    Applies the given reduction exhaustively to lowermost redexes.

  2. class IterativeSelectiveStrategy extends ReductionStrategy
  3. class LKToNDTranslationException extends Exception
  4. class LeftRankInductionUnfoldingReduction extends CutReduction
  5. class LowerMostRedexReducer extends RedexReducer

    Applies a given reduction to the lowermost redexes.

  6. class ParallelAtDepthStrategy extends ReductionStrategy
  7. trait RedexReducer extends AnyRef

    Describes objects that can apply a reduction to redexes.

  8. trait ReductionStrategy extends AnyRef
  9. class ReductiveCutNormalization extends AnyRef

    This class implements a version of Gentzen's cut-reduction procedure for our sequent calculus LK.

  10. trait Selector extends AnyRef
  11. class UnfoldInductions extends AnyRef
  12. class UppermostFirstStrategy extends ReductionStrategy

    Applies the given reduction exhaustively to uppermost redexes.

  13. class eliminateDefinitions extends Function[Expr, Expr]

    Implements definition elimination.

  14. class unfoldInduction extends AnyRef

Value Members

  1. object LKToExpansionProof
  2. object LKToND
  3. object MG3iToLJ
  4. object StuckCutReduction
  5. object acnf
  6. object acnfTop
  7. object cleanCuts

    Algorithm that removes some unnecessary cuts.

    Algorithm that removes some unnecessary cuts. At the moment it only removes cuts where one of the premises is a logical axiom.

  8. object cleanStructuralRules
  9. object cutNormal
  10. object eliminateDefinitions

    Eliminates definitions from a lambda expression, HOL formula, or LK proof.

  11. object equalityLeftReduction
  12. object equalityRightReduction
  13. object folSkolemize
  14. object inductionNormalForm
  15. object introOrCut
  16. object isAcnf
  17. object isAcnfTop
  18. object isAtomicCut
  19. object makeInductionExplicit
  20. object makeTheoryAxiomsExplicit

    Given a list of formulas Π, this transforms a proof π of Σ :- Δ into a proof π' of Π, Σ :- Δ.

    Given a list of formulas Π, this transforms a proof π of Σ :- Δ into a proof π' of Π, Σ :- Δ.

    It replaces theory axioms on sequents S that are subsumed by Π with propositional proofs of Π, S.

  21. object moveStrongQuantifierRulesDown

    Modifies an LK proof to introduce strong quantifiers as soon as possible.

  22. object pushAllWeakeningsToLeaves
  23. object pushEqualityInferencesToLeaves
  24. object pushSingleWeakeningToLeaves
  25. object skolemizeLK
  26. object unfoldInduction
  27. object weakeningOnlySubTree

Ungrouped