Rewriting with strategies in ELAN: a functional semanticsReportar como inadecuado




Rewriting with strategies in ELAN: a functional semantics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications 2 PROTHEO - Constraints, automatic deduction and software properties proofs INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications

Abstract : In this work, we consider term rewriting from a functional point of view. A rewrite rule is a function that can be applied to a term using an explicit application function. From this starting point, we show how to build more elaborated functions, describing first rewrite derivations, then sets of derivations. These functions, that we call strategies, can themselves be defined by rewrite rules and the construction can be iterated leading to higher-order strategies. Furthermore, the application function is itself defined using rewriting in the same spirit. We present this calculus and study its properties. Its implementation in the ELAN language is used to motivate and exemplify the whole approach. The expressiveness of ELAN is illustrated by examples of polymorphic functions and strategies.

Mots-clés : calcul de réécriture matching rewriting calculus rewriting logic strategy rewrite based language term rewriting logique de réécriture stratégie langage à base de règles réécriture de termes filtrage





Autor: Peter Borovansky - Claude Kirchner - Hélène Kirchner - Christophe Ringeissen -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados