Abstract
We introduce the York Abstract Machine (YAM) for implementing the graph programming language GP and, potentially, other graph transformation languages. The advantages of an abstract machine over a direct interpreter for graph transformation rules are better efficiency, use as a common target for compiling both future versions of GP and other languages, and portability of GP programs to different platforms.
Original language | English |
---|---|
Pages (from-to) | 231-240 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 211 |
DOIs | |
Publication status | Published - 1 Apr 2008 |
Keywords
- GP, Graph transformation, abstract machines, backtracking, nondeterminism