Totality-checking for Haskell?

Is anyone working on (or interested in) opt-in totality checking for Haskell? I’d love to be able to mark a function or module and have GHC guarantee it never hits bottom: no partial matches, no error/undefined, and no non-termination (perhaps with some notion of productivity for lazy/infinite data?). It feels like a natural extension of the purity philosophy, treating partiality as an effect to be tracked rather than something always implicitly allowed? I’ve enjoyed Idris’ totality checking, ...