XMonad comes with quite a few QuickCheck properties. See https://donsbot.wordpress.com/2007/05/17/roll-your-own-windo... and 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.
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.