Quickcheck is a Haskell testing library which allows the programmer to write propositions about how a function should behave, and the library will try to find c

Quickcheck is a Haskell testing library which allows the programmer to write propositions about how a function should behave, and the library will try to find cases which falsify the proposition. If my understanding is correct, it can't "prove" any properties, only disprove them. For concretely proving properties of a program, you would need something like Idris's dependent type system, where you can prove that a function always returns a sorted list, for example. https://github.com/nick8325/quickcheck https://github.com/nick8325/quickcheck https://www.idris-lang.org/ https://www.idris-lang.org/