# Better counterexample minimization

**URL:** <https://discourse.haskell.org/t/better-counterexample-minimization/12387>\
**Category:** Links\
**Created:** [June 27, 2025, 1:25am UTC](https://discourse.haskell.org/t/better-counterexample-minimization/12387 "2025-06-27T01:25:31Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![effectfully](https://sea2.discourse-cdn.com/flex002/user_avatar/discourse.haskell.org/effectfully/32/3266_2.png) [@effectfully](https://discourse.haskell.org/u/effectfully)\
**Post date:** [June 27, 2025, 1:25am UTC](https://discourse.haskell.org/t/better-counterexample-minimization/12387/1 "2025-06-27T01:25:31Z")

</div>

QuickCheck’s docs advise to implementing shrinking for tree-like data types the wrong way. This post explains how to do it better:

> **[sketches/better-counterexample-minimization at master · effectfully-ou/sketches](https://github.com/effectfully-ou/sketches/tree/master/better-counterexample-minimization)**
>
> A Haskell blog. Contribute to effectfully-ou/sketches development by creating an account on GitHub.