Work

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting

Year: 2016

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.4230/lipics.fscd.2019.9

Authors: Blanqui, Frédéric, Genestier, Guillaume, Hermant, Olivier

Institutions: Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Université Paris-Saclay, Laboratoire de Mathématiques Blaise Pascal, Université Paris Sciences et Lettres, École Nationale Supérieure des Mines de Paris

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2595623463

Cites: 28

Cited by: 1

Related to: 10