Argument filterings and usable rules in higher-order rewrite systems

Sho Suzuki 1 Keiichirou Kusakari 1 Frédéric Blanqui 2
2 FORMES - Formal Methods for Embedded Systems
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced for typed lambda-calculi. Argument filterings and usable rules are two important methods of the dependency pair framework used by current state-of-the-art first-order automated termination provers. In this paper, we extend the class of higher-order systems on which the static dependency pair method can be applied. Then, we extend argument filterings and usable rules to higher-order rewriting, hence providing the basis for a powerful automated termination prover for higher-order rewrite systems.
Type de document :
Article dans une revue
IPSJ Transactions on Programming, IPSJ, 2011, 4 (2), pp.1-12
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00555008
Contributeur : Frédéric Blanqui <>
Soumis le : mardi 20 septembre 2011 - 06:34:43
Dernière modification le : mercredi 10 octobre 2018 - 14:28:10
Document(s) archivé(s) le : mercredi 21 décembre 2011 - 02:20:27

Fichiers

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00555008, version 1
  • ARXIV : 1109.4357

Collections

Citation

Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui. Argument filterings and usable rules in higher-order rewrite systems. IPSJ Transactions on Programming, IPSJ, 2011, 4 (2), pp.1-12. 〈inria-00555008〉

Partager

Métriques

Consultations de la notice

332

Téléchargements de fichiers

99