A while back, @mbrock told me to check out this trio that might be used in combination: QuickCheck, QuickSpec, and HipSpec. HipSpec Github is here. I still have some stashed submissions on invariants and automated formal methods I’ll be posting, too, over next few weeks.
https://hackage.haskell.org/package/fitspec is also really cool. It’s mutation testing of properties. Ensures you have minimal properties!
Thanks for the link. Sounds good.
I fail to see the point. Writing arbitrary code and only then figuring out what equational laws it satisfies is… errr… technically possible, but methodologically backwards.
I do it, especially when working with other code other teams or people have written:
That was a very cool example, thanks.