The design of GP 2

24Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

This papers defines the syntax and semantics of GP 2, a revised version of the graph programming language GP. New concepts are illustrated and explainedwith 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. © D. Plump.

Cite

CITATION STYLE

APA

Plump, D. (2011). The design of GP 2. In Electronic Notes in Theoretical Computer Science (pp. 1–16). https://doi.org/10.4204/EPTCS.82.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