7 citations · 18 across the 6 of their papers we have counts for
5 papers · 1 filter
Fast Rule-Based Graph Programs
Graham Campbell, Brian Courtehoute, Detlef Plump
Implementing graph algorithms efficiently in a rule-based language is challenging because graph pattern matching is expensive. In this paper, we present a number of linear-time imp…
A Fast Graph Program for Computing Minimum Spanning Trees
Brian Courtehoute, Detlef Plump
When using graph transformation rules to implement graph algorithms, a challenge is to match the efficiency of programs in conventional languages. To help overcome that challenge,…
The Improved GP 2 Compiler
Graham Campbell, Jack Romo, Detlef Plump
GP 2 is a rule-based programming language based on graph transformation rules which aims to facilitate program analysis and verification. Writing efficient programs in such a langu…
Improving the GP 2 Compiler
Graham Campbell, Jack Romo, Detlef Plump
GP 2 is an experimental programming language based on graph transformation rules which aims to facilitate program analysis and verification. Writing efficient programs in such a la…
A Reference Interpreter for the Graph Programming Language GP 2
Christopher Bak, Glyn Faulkner, Detlef Plump +1
GP 2 is an experimental programming language for computing by graph transformation. An initial interpreter for GP 2, written in the functional language Haskell, provides a concise…