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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
