[Haskell-cafe] Proofs for program testing
iakd0 at clusterf.urz.uni-halle.de
Fri Sep 17 13:32:27 EDT 2004
I saw that many introductions to Haskell contain proofs of properties of
implemented functions. This is probably due to the fact that pure
functions can be handled more easily than imperative programs with hidden
states. I wondered whether one can use proofs of Haskell functions for
I found QuickCheck
which, as far as I understand, relies on random inputs and I found
which sounds like some GUI driven program.
Is there something that can be used for automatical testing, e.g. for
darcs' tests to check patch integrity?
More information about the Haskell-Cafe