HTF
QuickCheck
Our great sponsors
HTF | QuickCheck | |
---|---|---|
- | 1 | |
50 | 692 | |
- | - | |
3.2 | 7.7 | |
6 months ago | 1 day ago | |
Haskell | Haskell | |
GNU Lesser General Public License v3.0 only | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
HTF
We haven't tracked posts mentioning HTF yet.
Tracking mentions began in Dec 2020.
QuickCheck
-
Ask HN: Is writing a math proof like programming without ever running your code?
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
What are some alternatives?
hspec - A Testing Framework for Haskell
hedgehog - Release with confidence, state-of-the-art property testing for Haskell.
test-framework - Framework for running and organising QuickCheck test properties and HUnit test cases
quickspec - Equational laws for free
HUnit - A unit testing framework for Haskell
hspec-wai - Helpers to test WAI applications with Hspec
checkers - Check properties on standard classes and data structures
target - Generate test-suites from refinement types.
quickcheck-state-machine - Test monadic programs using state machine based models