Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

You should have a look at QuickCheck. It's a Haskell library where you (more or less) specify laws that your program should satisfy, and it generates test cases on its own. I found it very useful.


QuickCheck is cool. But don't make the mistake of thinking that it proves that the properties hold universally.


Yes. But it's closer to that goal than coding up test cases by hand. (If `closer' is a suitable expression for comparing infinite distances.)

SmallCheck and Lazy SmallCheck seem also to be worth a look. But I did not use them, yet.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: