The York Abstract Machine

被引：1
作者：
Manning, Greg [1 ]
Plump, Detlef [1 ]
机构：
[1] Univ York, Dept Comp Sci, York, N Yorkshire, England
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2008年 / 211卷
关键词：
Graph transformation; GP; abstract machines; nondeterminism; backtracking;
D O I：
10.1016/j.entcs.2008.04.045
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：231 / 240
页数：10
相关论文
共 50 条
  • [31] A unifying logic for non-deterministic, parallel and concurrent abstract state machines
    Flavio Ferrarotti
    Klaus-Dieter Schewe
    Loredana Tec
    Qing Wang
    Annals of Mathematics and Artificial Intelligence, 2018, 83 : 321 - 349
  • [32] A functional correspondence between call-by-need evaluators and lazy abstract machines
    Ager, MS
    Danvy, O
    Midtgaard, J
    INFORMATION PROCESSING LETTERS, 2004, 90 (05) : 223 - 232
  • [33] A unifying logic for non-deterministic, parallel and concurrent abstract state machines
    Ferrarotti, Flavio
    Schewe, Klaus-Dieter
    Tec, Loredana
    Wang, Qing
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2018, 83 (3-4) : 321 - 349
  • [34] The Relational Machine Calculus
    Barrett, Chris
    Castle, Daniel
    Heijltjes, Willem
    PROCEEDINGS OF THE 39TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS 2024, 2024,
  • [35] A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
    Ager, MS
    Danvy, O
    Midtgaard, J
    THEORETICAL COMPUTER SCIENCE, 2005, 342 (01) : 149 - 172
  • [36] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
    Nystrom, SO
    INFORMATION PROCESSING LETTERS, 1996, 60 (06) : 289 - 293
  • [37] A Typed Attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams
    Hermann, Frank
    Ehrig, Hartmut
    Taentzer, Gabriele
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 211 (0C) : 261 - 269
  • [38] A Diamond Machine for Strong Evaluation
    Accattoli, Beniamino
    Barenbaum, Pablo
    PROGRAMMING LANGUAGES AND SYSTEMS, APLAS 2023, 2023, 14405 : 69 - 90
  • [39] On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
    Danvy, Olivier
    Millikin, Kevin
    INFORMATION PROCESSING LETTERS, 2008, 106 (03) : 100 - 109
  • [40] An Immanent Machine: Reconsidering grades, historical and present
    Tocci, Charles
    EDUCATIONAL PHILOSOPHY AND THEORY, 2010, 42 (07) : 762 - 778
12345