| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423273 | Electronic Notes in Theoretical Computer Science | 2008 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
