Size-based termination of higher-order rewrite systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Size-based termination of higher-order rewrite systems

Résumé

This paper is concerned with the termination, in Church' simply-typed λ-calculus, of the combination of β-reduction and arbitrary user-defined rewrite rules fired using matching modulo α-congruence only. Several authors have devised termination criteria for fixpoint-based function definitions using deduction rules for bounding the size of terms inhabiting inductively defined types, where the size of a term is (roughly speaking) the set-theoretical height of the tree representation of its normal form. In the present paper, we extend this approach to rewriting-based function definitions and more general notions of size.
Fichier principal
Vignette du fichier
main.pdf (814.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01424921 , version 1 (06-01-2017)
hal-01424921 , version 2 (12-12-2017)
hal-01424921 , version 3 (09-02-2018)
hal-01424921 , version 4 (19-02-2018)
hal-01424921 , version 5 (20-02-2018)

Identifiants

  • HAL Id : hal-01424921 , version 1

Citer

Frédéric Blanqui. Size-based termination of higher-order rewrite systems. 2017. ⟨hal-01424921v1⟩
316 Consultations
340 Téléchargements

Partager

Gmail Facebook X LinkedIn More