The York Abstract Machine

Authors:
Greg Manning;Detlef Plump
Affiliations:
Department of Computer Science, The University of York, UK;Department of Computer Science, The University of York, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 5
Cited 1

Warren's abstract machine: a tutorial reconstruction

Warren's abstract machine: a tutorial reconstruction
The PROGRES approach: language and environment

Handbook of graph grammars and computing by graph transformation
The AGG approach: language and environment

Handbook of graph grammars and computing by graph transformation
Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java

TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Starting Forth: An Introduction to the Forth Language and Operating System for Beginners and Professionals (Prentice-Hall Software Series)

Starting Forth: An Introduction to the Forth Language and Operating System for Beginners and Professionals (Prentice-Hall Software Series)

The Graph Programming Language GP

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics

Quantified Score

Hi-index	0.00

Visualization

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.