Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting
Résumé
Dependency pairs are a key concept at the core of modern automated termination provers for first-order term rewriting systems. In this paper, we introduce an extension of this technique for a large class of dependently-typed higher-order rewriting systems. This extends previous results
by Wahlstedt on the one hand and the first author on the other hand to strong normalization and non-orthogonal rewriting systems. This new criterion is implemented in the type-checker Dedukti.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|