Towards a sharing strategy for the graph rewriting calculus

Abstract : 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.
Type de document :
Communication dans un congrès
Jürgen Giesl. 7th International Workshop on Reduction Strategies in Rewriting and Programming - WRS 2007, Jun 2007, Paris, France. Elsevier, 204, 2008, Electronic Notes in Theoretical Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00186141
Contributeur : Horatiu Cirstea <>
Soumis le : jeudi 8 novembre 2007 - 10:18:35
Dernière modification le : vendredi 9 mars 2018 - 11:26:00

Identifiants

  • HAL Id : inria-00186141, version 1

Collections

Citation

Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner. Towards a sharing strategy for the graph rewriting calculus. Jürgen Giesl. 7th International Workshop on Reduction Strategies in Rewriting and Programming - WRS 2007, Jun 2007, Paris, France. Elsevier, 204, 2008, Electronic Notes in Theoretical Computer Science. 〈inria-00186141〉

Partager

Métriques

Consultations de la notice

119