The following list contains an overview of all simplification techniques, which could
be applied to FP programs. All of these techniques require that the
TRS generated from the FP program is completely defined.
Automatic Symbolic Evaluation
Argument Elimination
Function-Combination
Identity-Transformation
Synonym-Transformation
Bool-Predefinition-Transformation
Fixed-Value-Transformation
Function-Merge
Context-Move
Parameter Enlargement
Recursion-Shifting
Context-Split
For an exhaustive description of these techniques please consult the following papers
[Gie95, Has04].