Constructs for Programming with Graph Rewrites

Rodgers, Peter (2000) Constructs for Programming with Graph Rewrites. In: Ehrig, Hartmut and Taentzer, Gabi, eds. GRATRA 2000: Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems. . pp. 59-66. (KAR id:22043)

PDF Language: English
Download this file (PDF/69kB)
Request a format suitable for use with assistive technology e.g. a screenreader

Abstract

Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce the size of programs, improve the efficiency of execution and simplify the host graph undergoing rewriting.

Item Type:	Conference or workshop item (Paper)
Uncontrolled keywords:	Graph Rewriting, Graph Transformation, Graph Grammars, Graph Rewriting Programming Languages
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Peter Rodgers
Date Deposited:	01 Sep 2009 17:43 UTC
Last Modified:	16 Nov 2021 10:00 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/22043 (The current URI for this page, for reference purposes)

University of Kent Author Information

Rodgers, Peter.

Creator's ORCID:	https://orcid.org/0000-0002-4100-3596
CReDIT Contributor Roles:

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.