28: Richard Eisenberg
The Haskell Interlude
00:00
How to Prove Associativity in Haskell
Haskell has a limited, painful form of dependent types. Liquid Haskell powered by an SMT solver knows about arithmetic and so you don't need to prove associatively short. But in a painful way, you can prove associativity of a pen and other elements.
Transcript
Play full episode
