The Design of GP 2

TL;DR

This paper introduces GP 2, an improved graph programming language with enhanced syntax, semantics, and features like a better type system, marking, and efficient control structures, facilitating more effective graph manipulations.

Contribution

It presents the design and formalization of GP 2, including new concepts, syntax, semantics, and practical improvements over the original GP language.

Findings

Enhanced type system for labels

Built-in marking mechanism for nodes and edges

Simplified semantics for branching and loops

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 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.