Code your own QuickCheck (Shrink)

In the previous posts, we started to implement our own QuickCheck in Haskell, which we named RapidCheck, based on the original publication on QuickCheck. The first post went over the basic concepts needed to build such a module, while our last post focused on how we can write generator for arbitrary functions. You might want... Continue Reading →

Code your own QuickCheck (HOF)

In the previous post, we started to build our own QuickCheck implementation in Haskell, which we named RapidCheck. We went over the basic concepts needed to build such a module, based on the original publication on QuickCheck. In particular, we explained in details and implemented the following concepts from QuickCheck: Gen a: a generator of... Continue Reading →

Code your own QuickCheck

In the next posts, we will go through a small implementation challenge. The goal will be to implement our own limited version of QuickCheck, the famous generative testing framework of Haskell. Whether or not you do know about the concept of generative testing, I advice you to have a look at the original publication of... Continue Reading →

Beautiful Code: Control.Foldl

The last three posts were about providing useful higher order functions that go hand in hand with C++ STL algorithms and ranges. In particular, we were interested in combining several functions together to create concise and efficient traversals. While documenting on the subject, I went looking at other example in other languages. And I encountered... Continue Reading →

Create a website or blog at WordPress.com

Up ↑

%d bloggers like this: