Compile time checks that a computation considers producing data through all possible constructors http://github.com/ocharles/exhaustive

Version on this page:1.1.1
LTS Haskell 11.22:1.1.6
Stackage Nightly 2018-03-12:1.1.5
Latest on Hackage:1.1.7

See all snapshots exhaustive appears in

BSD-3-Clause licensed by Oliver Charles
Maintained by ollie@ocharles.org.uk

Module documentation for 1.1.1

For a brief tutorial to exhaustive, check out the documentation for Control.Exhaustive, which contains a small example.


1.1.7 – 2018-10-23

Other Changes

  • Changed bounds of template-haskell to only support This release is thus only compatible with GHC 8.6. If this is a problem, please open an issue and I can add CPP to support older GHCs.

  • Increased upper-bound of base to < 4.13.


Other Changes

  • Increased upper-bound of base to < 4.12.


Other Changes

  • Increased upper-bound of base.


Other Changes

  • Increased upper-bound of generics-sop to < 0.4.


  • Compile with base-4.9.


  • Compile with generics-sop 0.2. Thanks to @kosmikus for this change.


  • Increased the upper-bound of base to allow < 4.9 and transforms < 0.5. Now builds on GHC 7.10.1.


  • New API new using Template Haskell to provide named constructors. Users should check the latest documentation for ‘Control.Exhaustive’ to see how the new API is used.


  • Initial release
Used by 1 package:
comments powered byDisqus