2024-11-16 🔄 programmerhumor ┃ edited ┃ RE: ?
Implementing Equality in Haskell:
deriving (Eq, Ord)
After learning how easy it was to implement functional programming in Rust (it’s almost like the language requires it sometimes), I decided to go back and learn the one I had heard about the most.
It opened my mind. Rust takes so many cues from Haskell, I don’t even know where to begin. Strong typing, immutable primitives, derived types, Sum types. Iterating and iterables, closures, and pattern matching are big in Haskell.
I’m not saying Rust uses these because Graydon Hoare wanted a more C-like Haskell, but it is clear it took a lot of elements from the functional paradigm, and the implementations the designers were familiar with had descended through Haskell at some point.
Also, deriving is not the same as implementing. One is letting the compiler make an educated guess about what you want to compare, the other is telling it specifically what you want to compare. You’re making, coincidentally, a bad comparison.
The first iteration of the Rust compiler was written in OCaml…
Don’t need the Ord instance for equality, just Eq is sufficient. Ord is for inequalities.
The point of the post is that most mainstream languages don’t provide a way to automatically derive […]
────