This reminds me a lot of Pure (https://agraef.github.io/pure-lang/). What I liked about Pure is the symbolic rewrite + the Haskell-esque syntax with out the strictness + easy ffi.
I really do like how you have smoothly integrated this into Python. Though the symbolic pattern matching is well pretty amazing and make me think about things a little different now. You could probably implement something like this in Julia with it's macros and flexibility in manipulating the AST. I hate Python, but I'm forced to bow to the ecosystem.
I believe there is a family of programming languages named OBJ that are known as "term re-writing" languages that operate at this symbolic/syntatic level.
Are you familiar with them? How does Symbolica compare/contrast with them?
Not the author of Symbolica but I will take a stab at responding. Symbolica is fundamentally a CAS (computer algebra system) so it should be compared with other CAS. And compared with other CAS, Symbolica aims to provide much better performance. In addition it is much more hackable, being written from scratch in Rust.
I used mermaid, which gets live-compiled on the website, that is built using quarto. Here is an example:
```{mermaid}
flowchart LR
A -- 1 --- B
B -- 2 --- C
B -- 8 --- E
C -- 3 --- D
C -- 9 --- F
D -- 10 --- E
D -- 4 --- G
G -- 5 --- H
G -- 6 --- F
E -- 9 --- F
```
I really do like how you have smoothly integrated this into Python. Though the symbolic pattern matching is well pretty amazing and make me think about things a little different now. You could probably implement something like this in Julia with it's macros and flexibility in manipulating the AST. I hate Python, but I'm forced to bow to the ecosystem.