egglog
herbie
egglog | herbie | |
---|---|---|
4 | 6 | |
337 | 724 | |
3.3% | 0.7% | |
9.5 | 9.9 | |
9 days ago | 2 days ago | |
Rust | HTML | |
MIT License | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
egglog
-
Towards a New SymPy
The herbie project using egraphs to explore different ways of rewriting floating point expressions. https://herbie.uwplse.org/ One can also write custom rulesets in egglog (a new egraph rewriting system / language / datalog) https://egraphs-good.github.io/egglog/?example=herbie
The approach is not yet anywhere near being able to touch all the domains sympy can handle. Destructive term rewriting tends to be a bit more forgiving to unsoundness in the rules and still returning roughly meaningful results. EGraph rewriting (and other automated reasoning systems) tend to just return junk as soon as you aren't careful about your semantics. Associativity and commutativity are ubiquitous in CAS applications and encoding these concepts in general purpose terms is rather unsatisfying. The post above emphasizes specialty methods for polynomials, which it would be desirable to find a clean way to integrate into egraph techniques. Variable binding (which is treated in a rather mangled form in CAS systems) is seemingly important for treating summation, differentiation, and integration correctly. The status of doing variable binding efficiently and correctly in egraphs is also unclear imo.
-
What is the state of the art for creating domain-specific languages (DSLs) with Rust?
For semantic analyzers, check out egg and egglog. They're custom data structures for representing compiler rewrite rules in a non-destructive way.
-
Ask HN: What is new in Algorithms / Data Structures these days?
The recent work on relational, datalog-inspired egraphs in PLDI this year ("Unifying Datalog and Equality Saturation") is actually interesting because it can solve cases like the y/x*x -> y identity example, by the power of an interval analysis on x (among other things.) Sort of like adding a postulate but instead it's by adding relations between terms in the graph.
https://github.com/egraphs-good/egglog
https://arxiv.org/pdf/2304.04332.pdf
-
Better Together: Unifying Datalog and Equality Saturation
Close, but the link is on Page 13, and it points here: https://github.com/mwillsey/egg-smol
Unfortunately the naming is all a bit confusing, isn't it....
herbie
- Herbie: Find and fix floating-point accuracy problems
-
Towards a New SymPy
The herbie project using egraphs to explore different ways of rewriting floating point expressions. https://herbie.uwplse.org/ One can also write custom rulesets in egglog (a new egraph rewriting system / language / datalog) https://egraphs-good.github.io/egglog/?example=herbie
The approach is not yet anywhere near being able to touch all the domains sympy can handle. Destructive term rewriting tends to be a bit more forgiving to unsoundness in the rules and still returning roughly meaningful results. EGraph rewriting (and other automated reasoning systems) tend to just return junk as soon as you aren't careful about your semantics. Associativity and commutativity are ubiquitous in CAS applications and encoding these concepts in general purpose terms is rather unsatisfying. The post above emphasizes specialty methods for polynomials, which it would be desirable to find a clean way to integrate into egraph techniques. Variable binding (which is treated in a rather mangled form in CAS systems) is seemingly important for treating summation, differentiation, and integration correctly. The status of doing variable binding efficiently and correctly in egraphs is also unclear imo.
-
Q: Automated floating point error analysis
As a starting point, check Herbie: https://herbie.uwplse.org/
-
Someone’s Been Messing with My Subnormals
Here is a really cool automatic tool that rewrites floating point expressions to be more accurate: https://herbie.uwplse.org/
-
Multiple precision floating point library
On a related note, see tools like Herbie which rewrite floating point expressions to improve accuracy without altering the underlying data-type. It's worth being aware that sometimes you get really bad diminishing returns from using bigger floats and what you really need to do is to rewrite the calculation to avoid a weakness of floating point representation, see numerically unstable calculations.
- Herbie – optimize floating-point expressions for accuracy
What are some alternatives?
ezno - A JavaScript compiler and TypeScript checker written in Rust with a focus on static analysis and runtime performance
bigint-benchmark-rs - Bechmarks for Rust big integer implementations
libclc - Cache Line Container - C11
ibig-rs - A big integer library in Rust with good performance.
scryer-prolog - A modern Prolog implementation written mostly in Rust.
MuladdMacro.jl - This package contains a macro for converting expressions to use muladd calls and fused-multiply-add (FMA) operations for high-performance in the SciML scientific machine learning ecosystem
flix - The Flix Programming Language
r6rs
yjs - Shared data types for building collaborative software
mpack - MPack - A C encoder/decoder for the MessagePack serialization format / msgpack.org[C]
ntfy-android - Android app for ntfy.sh
moros - MOROS: Obscure Rust Operating System 🦉