Argument filterings and usable rules in higher-order rewrite systems - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2010

Argument filterings and usable rules in higher-order rewrite systems

Sho Suzuki
  • Fonction : Auteur
  • PersonId : 884376
Keiichirou Kusakari
  • Fonction : Auteur
  • PersonId : 861355
Frédéric Blanqui

Résumé

The static dependency pair method is a method for proving the termination of higher-order rewrite systems &aagrave; 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.
Fichier principal
Vignette du fichier
main.pdf (136 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00543160 , version 1 (20-09-2011)

Identifiants

  • HAL Id : inria-00543160 , version 1

Citer

Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui. Argument filterings and usable rules in higher-order rewrite systems. [Research Report] IEICE-TR-SS2010-24.Vol110.N169, 2010. ⟨inria-00543160⟩
174 Consultations
119 Téléchargements

Partager

Gmail Facebook X LinkedIn More