Metatheory.jl：具有可扩展等式饱和的Julia快速优雅代数计算
Metatheory.jl: Fast and Elegant Algebraic Computation in Julia with Extensible Equality Saturation
摘要：
我们引入Metatheory.jl：一种轻量级和高性能的通用符号和元编程框架，旨在简化编写复杂Julia元程序的行为，并基于最先进的等式饱和技术和动态第一类抽象树（AST）模式匹配系统，利用本机项重写系统显著增强Julia，其中AST系统可以以代数方式动态组合，充分利用语言强大的反射能力。我们的贡献允许执行通用的符号数学，操作，优化，合成或分析语法上有效的Julia表达式与一个干净简洁的编程接口，无论是在编译或执行程序。
英文摘要：
We introduce Metatheory.jl: a lightweight and performant general purpose symbolics and metaprogramming framework meant to simplify the act of writing complex Julia metaprograms and to significantly enhance Julia with a native term rewriting system, based on state-of-the-art equality saturation techniques, and a dynamic first class Abstract Syntax Tree (AST) pattern matching system that is dynamically composable in an algebraic fashion, taking full advantage of the language's powerful reflection capabilities. Our contribution allows to perform general purpose symbolic mathematics, manipulation, optimization, synthesis or analysis of syntactically valid Julia expressions with a clean and concise programming interface, both during compilation or execution of programs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
