论文标题
Egel-曲折的图形重写
Egel -- Graph Rewriting with a Twist
论文作者
论文摘要
Egel是一种急切的组合玩具语言。它的主要目的是展示一种抽象的图形练习语义，允许在C ++中建立强大的内存安全结构。尽管通常由精心设计的机器实现了图形重写器，但是可以通过更改术语图的表示，可以避免这种情况。通过非正式的归纳论证，表明表示总是形成有向的无环图。此外，该图语义可以详尽地扩展以允许例外处理和廉价并发。解释器Egel通过从组合器到参考分数的C ++对象的直截了当映射来利用这种语义。
Egel is an untyped eager combinator toy language. Its primary purpose is to showcase an abstract graph-rewriting semantics allowing a robust memory-safe construction in C++. Though graph rewriters are normally implemented by elaborate machines, this can mostly be avoided with a change in the representation of term graphs. With an informal inductive argument, that representation is shown to always form directed acyclic graphs. Moreover, this graph semantics can trivially be extended to allow exception handling and cheap concurrency. Egel, the interpreter, exploits this semantics with a straight-forward mapping from combinators to reference-counted C++ objects.
