Algorithms through the lens of symbolic pattern matching

Re:Algorithms through the lens of symbolic pattern matching by mmaul on Wednesday August 14, 2024 @05:38PM (#41250772)

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.

[ Parent | on HN ]

Re:Algorithms through the lens of symbolic pattern matching by SPACECADET3D on Thursday August 15, 2024 @03:33AM (#41253835)

Pure looks interesting!

You can also use Symbolica in Rust, which also has operator overloading so it will look quite similar. At some point I will also add Julia bindings.

[ Parent | on HN ]