Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting

Abstract

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.
Fichier principal
Vignette du fichier
main.pdf (625.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01943941 , version 1 (23-04-2019)
hal-01943941 , version 2 (20-05-2019)
hal-01943941 , version 3 (27-06-2019)
hal-01943941 , version 4 (15-10-2019)

Identifiers

Cite

Frédéric Blanqui, Guillaume Genestier, Olivier Hermant. Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. FSCD 2019 - 4th International Conference on Formal Structures for Computation and Deduction, Jun 2019, Dortmund, Germany. ⟨10.4230/LIPIcs.FSCD.2019.9⟩. ⟨hal-01943941v4⟩
284 View
164 Download

Altmetric

Share

Gmail Facebook X LinkedIn More