Strategic programming on graph rewriting systems

Maribel Fernández
(King's College London)
Olivier Namet
(King's College London)

We describe a strategy language to control the application of graph rewriting rules, and show how this language can be used to write high-level declarative programs in several application areas. This language is part of a graph-based programming tool built within the port-graph transformation and visualisation environment PORGY.

In Hélène Kirchner and César Muñoz: Proceedings International Workshop on Strategies in Rewriting, Proving, and Programming (IWS 2010), Edinburgh, UK, 9th July 2010, Electronic Proceedings in Theoretical Computer Science 44, pp. 1–20.
Published: 24th December 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.44.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org