106 articles – 48 Notices  [english version]
 HAL : inria-00186141, version 1
 7th International Workshop on Reduction Strategies in Rewriting and Programming - WRS 2007, Paris : France (2007)
 Towards a sharing strategy for the graph rewriting calculus
 (2008)
 The graph rewriting calculus is an extension of the $\rho$-calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using unification constraints in addition to the standard rho-calculus matching constraints. The transformations are performed by explicit application of rewrite rules as first class entities. The possibility of expressing sharing and cycles allows one to represent and compute over regular infinite entities. We propose in this paper a reduction strategy for the graph rewriting calculus which aims at maintaining the sharing information as long as possible in the terms. The corresponding reduction relation is shown to be confluent and complete with regards to the small-step semantics of the graph rewriting calculus.
 1 : Dipartimento di Informatica (DIPARTIMENTO DI INFORMATICA) Università degli studi Ca' Foscari di Venezia 2 : Laboratoire d'informatique Fondamentale de Marseille (LIF) CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I 3 : PROTHEO (INRIA Lorraine - LORIA) INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
 Domaine : Informatique/Langage de programmation
 inria-00186141, version 1 http://hal.inria.fr/inria-00186141 oai:hal.inria.fr:inria-00186141 Contributeur : Horatiu Cirstea <> Soumis le : Jeudi 8 Novembre 2007, 10:18:35 Dernière modification le : Mardi 10 Novembre 2009, 14:56:40