تقرير
Performant Dynamically Typed E-Graphs in Pure Julia
| العنوان: | Performant Dynamically Typed E-Graphs in Pure Julia |
|---|---|
| المؤلفون: | Cheli, Alessandro, Heim, Niklas |
| سنة النشر: | 2024 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Programming Languages, Computer Science - Symbolic Computation, I.1.3 |
| الوصف: | We introduce the third major version of Metatheory.jl, a Julia library for general-purpose metaprogramming and symbolic computation. Metatheory.jl provides a flexible and performant implementation of e-graphs and Equality Saturation (EqSat) that addresses the two-language problem in high-level compiler optimizations, symbolics and metaprogramming. We present results from our ongoing optimization efforts, comparing the state-of-the-art egg Rust library's performance against our system and show that performant EqSat implementations are possible without sacrificing the comfort of a direct 1-1 integration with a dynamic, high-level and an interactive host programming language. Comment: 8 pages, 5 figures, submission for 2024 PLDI e-graph workshop |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2404.08751 |
| رقم الأكسشن: | edsarx.2404.08751 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |