package transformations
- Alphabetic
- Public
- Protected
Type Members
- class IterativeParallelStrategy extends ReductionStrategy
Applies the given reduction exhaustively to lowermost redexes.
- class IterativeSelectiveStrategy extends ReductionStrategy
- class LKToNDTranslationException extends Exception
- class LeftRankInductionUnfoldingReduction extends CutReduction
- class LowerMostRedexReducer extends RedexReducer
Applies a given reduction to the lowermost redexes.
- class ParallelAtDepthStrategy extends ReductionStrategy
- trait RedexReducer extends AnyRef
Describes objects that can apply a reduction to redexes.
- trait ReductionStrategy extends AnyRef
- class ReductiveCutNormalization extends AnyRef
This class implements a version of Gentzen's cut-reduction procedure for our sequent calculus LK.
- trait Selector extends AnyRef
- class UnfoldInductions extends AnyRef
- class UppermostFirstStrategy extends ReductionStrategy
Applies the given reduction exhaustively to uppermost redexes.
- class eliminateDefinitions extends Function[Expr, Expr]
Implements definition elimination.
- class unfoldInduction extends AnyRef
Value Members
- object LKToExpansionProof
- object LKToND
- object MG3iToLJ
- object StuckCutReduction
- object acnf
- object acnfTop
- 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.
- object cleanStructuralRules
- object cutNormal
- object eliminateDefinitions
Eliminates definitions from a lambda expression, HOL formula, or LK proof.
- object equalityLeftReduction
- object equalityRightReduction
- object folSkolemize
- object inductionNormalForm
- object introOrCut
- object isAcnf
- object isAcnfTop
- object isAtomicCut
- object makeInductionExplicit
- 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.
- object moveStrongQuantifierRulesDown
Modifies an LK proof to introduce strong quantifiers as soon as possible.
- object pushAllWeakeningsToLeaves
- object pushEqualityInferencesToLeaves
- object pushEqualityInferencesToLeaves2 extends LKVisitor[Unit]
- object pushSingleWeakeningToLeaves
- object skolemizeLK
- object unfoldInduction
- object weakeningOnlySubTree
This is the API documentation for GAPT.
The main package is gapt.