Ruler: Inferring Rewrite rules with Equality Saturation
ztatlock.net · 3,329 words · saved by 1 readers
N/A
Rewrite Rule Inference Using Equality Saturation Chandrakana Nandi, Max Willsey, Amy Zhu, Yisu Remy Wang, Brett Saiki, Adam Anderson, Adriana Schulz, Dan Grossman, Zachary Tatlock OOPSLA 2021 Rewrite Rules Are Ubiquitous! Compilers Program Synthesizers Simplifiers / Optimizers SMT Solvers ML Frameworks Rewrite Engines must be Efficient and Reliable! Compilers Program Synthesizers Simplifiers / Optimizers…
saved by
related reading
- List of rules of inferenceen.wikipedia.org
- As Rocks May Think | Eric Jangevjang.com
- Exotic Programming Ideas, Part 2 (Term Rewriting)stephendiehl.com
- Program Synthesis Explained — James Bornholtcs.utexas.edu
- L-system - Wikipediaen.wikipedia.org
- GitHub - konst-int-i/lucid-rules: Rule Extraction Methods for Interactive eXplainabilitygithub.com
- Senior SWE-Benchsenior-swe-bench.snorkel.ai
- SAT Competitionssatcompetition.github.io
- 2502.18449arxiv.org
- Spatialspatial-lang.org
- GitHub - google/re2: RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library.github.com
- Formally speaking, "Transpiler" is a useless word | Rachit Nigampeople.csail.mit.edu