Lazy AC-Pattern Matching for Rewriting

Walid Belkhir 1, 2 Alain Giorgetti 1, 2
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining computations. We integrate the lazy AC-matching in a strategy language: rewriting rule and strategy application produce a lazy list of terms
Type de document :
Communication dans un congrès
Santiago Escobar. 10th International Workshop on Reduction Strategies in Rewriting and Programming, May 2011, Novi Sad, Serbia. 82, pp.37-51, 2012, Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming. 〈10.4204/EPTCS.82.3〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00756343
Contributeur : Alain Giorgetti <>
Soumis le : jeudi 22 novembre 2012 - 18:34:45
Dernière modification le : vendredi 6 juillet 2018 - 15:06:10

Lien texte intégral

Identifiants

Citation

Walid Belkhir, Alain Giorgetti. Lazy AC-Pattern Matching for Rewriting. Santiago Escobar. 10th International Workshop on Reduction Strategies in Rewriting and Programming, May 2011, Novi Sad, Serbia. 82, pp.37-51, 2012, Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming. 〈10.4204/EPTCS.82.3〉. 〈hal-00756343〉

Partager

Métriques

Consultations de la notice

317