3 ms·
>>Except that there is a real advantage to using pure functional programming; being able to easily prove theorems about your code and understand different compo
by tmptmp 10y ago
>>Except that there is a real advantage to using pure functional programming; being able to easily prove theorems about your code and understand different components in isolation.
How much of the Haskell (a pure FP language) library code is formally proved? Just curious.
Also I wonder, if code like xmonad can be proved at all.
- eru 10y agoXMonad comes with quite a few QuickCheck properties. See https://donsbot.wordpress.com/2007/05/17/roll-your-own-window-manager-tracking-focus-with-a-zipper/ https://donsbot.wordpress.com/2007/05/17/roll-your-own-windo... and https://donsbot.wordpress.com/2007/05/01/roll-your-own-window-manager-part-1-defining-and-testing-a-model/ https://donsbot.wordpress.com/2007/05/01/roll-your-own-windo... for some readable introduction. One might consider proving the properties instead of just checking them with a few thousand random examples.