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.
机构:
Institut für Computersprachen, Technische Universität Wien, Argentinierstraße 8, A-1040 Wien, AustriaInstitut für Computersprachen, Technische Universität Wien, Argentinierstraße 8, A-1040 Wien, Austria
Krall, Andreas
Journal of Logic Programming,
29
(1-3):
: 85
-
106