The Design of GP 2

Detlef Plump
(The University of York)

This papers defines the syntax and semantics of GP 2, a revised version of the graph programming language GP. New concepts are illustrated and explained with example programs. Changes to the first version of GP include an improved type system for labels, a built-in marking mechanism for nodes and edges, a more powerful edge predicate for conditional rule schemata, and functions returning the indegree and outdegree of matched nodes. Moreover, the semantics of the branching and loop statement have been simplified to allow their efficient implementation.

Invited Paper in Santiago Escobar: Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), Novi Sad, Serbia, 29 May 2011 , Electronic Proceedings in Theoretical Computer Science 82, pp. 1–16.
Published: 24th April 2012.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: