I'm pleased to announce v3.2 release of SBV, providing facilities for SMT based theorem proving in Haskell. This is mainly a bug-fix/maintenance release, together with one new feature: SBV now implements 'sAssert', which works similar to 'assert' calls in Haskell or other languages to check that certain program invariants always hold. Except, SBV allows the condition to be symbolic, and all violations will be caught and reported as the underlying program is symbolically executed. (For instance, this facility can be useful in other DSL's built on top of SBV to make sure the code they generate never divides by 0, or indexes out of bounds.) Full release notes: https://github.com/LeventErkok/sbv /blob/master/CHANGES.md SBV web page: http://leventerkok.github.io/sbv/ As usual, bug reports and feedback are most welcome! -Levent.