TorosFanny
TorosFanny
I got a easier way to resolve this issue: > When running the code, if you get an error saying: /usr/lib/x86_64-linux-gnu/libharfbuzz.so.0: > undefined symbol: FT_Face_GetCharVariantIndex, try adding /usr/lib/x86_64-linux- > gnu/libfreetype.so.6(or...
I'm still confused, but much more clear
Yes, that's a good idea.
Then, do you think Morte can transform a slow algorithm into a faster one? Do you think algorithm design is still needed?
For a very simple example transform `\x -> \y -> (x + y) - x` to `\_ -> \y -> y`. As Morte can't prove [addition commutes](https://github.com/Gabriel439/Haskell-Morte-Library/issues/43), I think maybe...