Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

Terminaison des systèmes de réécriture d'ordre supérieur basée sur la notion de clôture de calculabilité

Frédéric Blanqui 1
1 FORMES - Formal Methods for Embedded Systems
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : In this paper, we show how the notion of computability introduced by W. W. Tait and extended to polymorphic types by J.-Y. Girard can be used and easily extended to prove the termination of various kind of rewriting relations on lambda-terms, including matching on defined symbols, higher-order matching or class-rewriting modulo some equational theories. We also show how the notion of computability closure can easily be turned into a well-founded relation including J.-P. Jouannaud and A. Rubio's higher-order extension of N. Dershowitz' recursive path ordering.
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-00724233
Contributor : Frédéric Blanqui <>
Submitted on : Tuesday, August 21, 2012 - 4:07:21 AM
Last modification on : Tuesday, March 17, 2020 - 1:37:43 AM
Long-term archiving on: : Friday, March 31, 2017 - 11:56:18 AM

Files

Identifiers

  • HAL Id : tel-00724233, version 2

Collections

Citation

Frédéric Blanqui. Terminaison des systèmes de réécriture d'ordre supérieur basée sur la notion de clôture de calculabilité. Logique [math.LO]. Université Paris-Diderot - Paris VII, 2012. ⟨tel-00724233v2⟩

Share

Metrics

Record views

616

Files downloads

302