The following pages link to TPA (Q22083):
Displaying 12 items.
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- Methods for proving termination of rewriting-based programming languages by transformation (Q2808239) (← links)
- Innermost termination of rewrite systems by labeling (Q2873673) (← links)
- (Q3077191) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- Modular and Certified Semantic Labeling and Unlabeling (Q5389090) (← links)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations (Q5448658) (← links)