https://guide.aelve.com/haskell/feed/category/n3fql3kc2019-01-27T14:17:10Zkvos7f3u2019-01-27T14:17:10Z<h1> <span class="item-name">dejafu</span> (<a href="https://hackage.haskell.org/package/dejafu">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>af2ffb902019-01-06T14:28:26Z<h1> <span class="item-name">testing-feat</span> (<a href="https://hackage.haskell.org/package/testing-feat">Hackage</a>) </h1><p>Enumerates values by size.</p> <h2>Pros</h2><ul><p><li>Increasing size generally makes the search space grow smaller than increasing depth, with greater variability of generated inputs.</li></p></ul><h2>Cons</h2><ul></ul>zxfhvwmq2019-01-06T14:28:19Z<h1> <span class="item-name">smallcheck</span> (<a href="https://hackage.haskell.org/package/smallcheck">Hackage</a>) </h1><p>Property-based enumerative testing.</p> <p>Enumerates values by increasing depth.</p> <h2>Pros</h2><ul><p><li>Increasing depth is perhaps the simplest enumeration strategy.</li></p><p><li>Deterministic for a fixed number of test cases.</li></p></ul><h2>Cons</h2><ul></ul>mdxe90oy2019-01-06T14:28:16Z<h1> <span class="item-name">leancheck</span> (<a href="https://hackage.haskell.org/package/leancheck">Hackage</a>) </h1><p>Property-based enumerative testing.</p> <ul> <li><a href="https://github.com/rudymatela/leancheck/blob/master/doc/faq.md">LeanCheck FAQ</a></li> </ul> <h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>skqhakg52019-01-06T14:20:45Z<h1> <span class="item-name">Hedgehog</span> (<a href="https://hackage.haskell.org/package/hedgehog">Hackage</a>) </h1><p>Property-based random testing.</p> <h2>Pros</h2><ul><p><li>Generators also specify shrinking, so they guarantee the same invariants by construction.</li></p><p><li>A rich set of generator combinators</li></p></ul><h2>Cons</h2><ul></ul>m39lcafx2016-05-01T18:12:25Z<h1> <span class="item-name">webdriver</span> (<a href="https://hackage.haskell.org/package/webdriver">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>ledmkam02016-05-01T18:12:03Z<h1> <span class="item-name">tasty</span> (<a href="https://hackage.haskell.org/package/tasty">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>r0chdlf02016-05-01T18:11:58Z<h1> <span class="item-name">test-framework</span> (<a href="https://hackage.haskell.org/package/test-framework">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>lvns009q2016-05-01T18:11:50Z<h1> <a href="https://hspec.github.io" class="item-name">Hspec</a> (<a href="https://hackage.haskell.org/package/hspec">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>a8qlbj2t2016-05-01T18:11:48Z<h1> <span class="item-name">HUnit</span> (<a href="https://hackage.haskell.org/package/HUnit">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>a4o1t0ee2016-05-01T18:11:40Z<h1> <span class="item-name">QuickCheck</span> (<a href="https://hackage.haskell.org/package/QuickCheck">Hackage</a>) </h1><p>Property-based random testing.</p> <p>Write high-level properties that can be tested by generating many random inputs to search counterexamples. Counterexamples are then shrunk to a minimal example to help pinpoint the source of the error.</p> <h2>Pros</h2><ul><p><li>Some properties are natural to understand, such as type class laws.</li></p><p><li>Automated test case generation helps with better coverage.</li></p><p><li>Shrinking makes failures easy to reproduce and debug.</li></p></ul><h2>Cons</h2><ul><p><li>Properties and test case generators can become arbitrarily complex, ultimately hiding bugs.</li></p></ul><h2>Ecosystem</h2><ul> <li> <p>Random generators can often be derived generically: <a href="https://hackage.haskell.org/package/generic-random">generic-random</a>.</p> </li> <li> <p>To test stateful programs, QuickCheck has a module <code>Test.QuickCheck.Monadic</code>. There is also <a href="https://hackage.haskell.org/package/quickcheck-state-machine">quickcheck-state-machine</a>.</p> </li> <li> <p>When QuickCheck tests fail, they only print the counterexample. To extract counterexamples in code, you can use an alternative interface in <a href="https://hackage.haskell.org/package/quickcheck-with-counterexamples">quickcheck-with-counterexamples</a>.</p> </li> <li> <p>Orphan instances: <a href="https://hackage.haskell.org/package/quickcheck-instances">quickcheck-instances</a>.</p> </li> </ul>