Journal ArticleOPEN ACCESS

Strategic programming on graph rewriting systems

  • Fernández M
  • Namet O
Electronic Proceedings in Theoretical Computer Science (2010) 44 1-20
DOI: 10.4204/eptcs.44.1
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Fernández, M., & Namet, O. (2010). Strategic programming on graph rewriting systems. Electronic Proceedings in Theoretical Computer Science, 44, 1–20. https://doi.org/10.4204/eptcs.44.1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free