The Design of GP 2
Programming Languages
2012-04-26 v1 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1204.5541,
title = {The Design of GP 2},
author = {Detlef Plump},
journal= {arXiv preprint arXiv:1204.5541},
year = {2012}
}
Comments
In Proceedings WRS 2011, arXiv:1204.5318