Nikos Baxevanis

@TysonMN, it'll gave up after 100 discards. @cmeeren, how you'd get the simplest value of a complex data structure?

I guess we could check `SIZEOF_HSINT == 8`. About `fromEnum`, see comments in #185 [(comment)](https://github.com/hedgehogqa/haskell-hedgehog/pull/185#issuecomment-384463697]) and https://github.com/hedgehogqa/haskell-hedgehog/pull/202/.

>We don't have empty packages in Debian so any uses of them (fail, nats, bytestring-builder, etc.) need to be patched out What's the current procedure for working around this issue?...

See this conversation regarding `PropertyT` https://github.com/hedgehogqa/haskell-hedgehog/pull/233/files#r234163334

>I actually wonder if it would be better to remove the MonadFail instance for Gen and have it be a compile error. This aligns pretty well with @sol's comment on...

Would something like this work? https://github.com/hedgehogqa/haskell-hedgehog/pull/173#pullrequestreview-158446660

https://github.com/hedgehogqa/haskell-hedgehog/issues/127#issuecomment-341927624

I haven't looked closely at https://github.com/qfpl/tasty-hedgehog-coverag and what this means for F# Hedgehog, but I've [ported some of the original paper](https://gist.github.com/moodmosaic/65c576732722b3b7a200) and IIRC this kind of thing was [fairly easy...

Essentially what we want is to add coverage combinators: `cover`, `classify`, `label`, and `collect`. --- **Notes** In the Haskell version: [`cover`](https://hackage.haskell.org/package/hedgehog/docs/Hedgehog.html#v:cover) records the number of times a predicate is satisfied...

Agreed 👍 That's what I mean; custom CE keywords are better. Those keywords may use the underlying combinators (to be added) in the Property module.