Matching modulo superdeveloppements. Application to second-order matching.

Germain Faure 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : To perform higher-order matching, we need to decide the beta eta-equivalence on \lambda-terms. The first way to do it is to use simply typed lambda-calculus and this is the usual framework where higher-order matching is performed. Another approach consists in deciding a restricted equivalence based on finite superdevelopments. We consider higher-order matching modulo this equivalence over untyped lambda-terms for which we propose a terminating, sound and complete matching algorithm. This is in particular of interest since all second-order beta-matches are matches modulo superdevelopments. We further propose a restriction to second-order matching that gives exactly all second-order matches.
Type de document :
Communication dans un congrès
13th International Conference on Logic for Programming Artificial Intelligence and Reasoning - LPAR 2006, Nov 2006, Phnom Penh/Cambodge, 2006
Liste complète des métadonnées

https://hal.inria.fr/inria-00095608
Contributeur : Germain Faure <>
Soumis le : lundi 18 septembre 2006 - 08:45:12
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58
Document(s) archivé(s) le : jeudi 20 septembre 2012 - 10:40:48

Fichier

Identifiants

  • HAL Id : inria-00095608, version 1

Collections

Citation

Germain Faure. Matching modulo superdeveloppements. Application to second-order matching.. 13th International Conference on Logic for Programming Artificial Intelligence and Reasoning - LPAR 2006, Nov 2006, Phnom Penh/Cambodge, 2006. 〈inria-00095608〉

Partager

Métriques

Consultations de la notice

96

Téléchargements de fichiers

82