Difference between revisions of "GP (Graph Programs)"

From The Programming Languages and Systems Research Group
Jump to: navigation, search
([cposkitt logged in as colin])
 
([cposkitt logged in as colin])
Line 7: Line 7:
 
===Overviews===
 
===Overviews===
  
* S. Steinert: '''[http://www.cs.york.ac.uk/ftpdir/reports/2007/YCST/15/YCST-2007-15.pdf The Graph Programming Language GP] (.pdf)'''. PhD thesis, The University of York, 2007.
+
* Detlef Plump: '''[http://www.cs.york.ac.uk/plasma/publications/pdf/Plump.CAI.09.pdf The Graph Programming Language GP] (.pdf)'''. In ''Proc. Algebraic Informatics, Third International Conference (CAI 2009)'', volume 5725 of ''Lecture Notes in Computer Science'', pages 99-122. Springer-Verlag, 2009.
 +
 
 +
* Sandra Steinert: '''[http://www.cs.york.ac.uk/ftpdir/reports/2007/YCST/15/YCST-2007-15.pdf The Graph Programming Language GP] (.pdf)'''. PhD thesis, The University of York, 2007.
  
 
===Semantics===
 
===Semantics===

Revision as of 03:16, 23 December 2009

GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step application of a set of conditional graph-transformation rules, sequential composition, branching and iteration. The language has a formal structural operational semantics, as well as a prototype implementation.

Sandra Steinert, Greg Manning, and Detlef Plump worked on the design and implementation of GP; Chris Poskitt and Detlef Plump are currently investigating the formal verification of Graph Programs.

GP Literature

Overviews

  • Detlef Plump: The Graph Programming Language GP (.pdf). In Proc. Algebraic Informatics, Third International Conference (CAI 2009), volume 5725 of Lecture Notes in Computer Science, pages 99-122. Springer-Verlag, 2009.

Semantics

Implementation

Example Graph Programs