quickcheck-state-machine
Test monadic programs using state machine based models (by advancedtelematic)
QuickCheck
Automatic testing of Haskell programs. (by nick8325)
| quickcheck-state-machine | QuickCheck | |
|---|---|---|
| - | 2 | |
| 196 | 746 | |
| - | 0.7% | |
| 1.0 | 6.3 | |
| almost 4 years ago | about 2 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
quickcheck-state-machine
Posts with mentions or reviews of quickcheck-state-machine.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning quickcheck-state-machine yet.
Tracking mentions began in Dec 2020.
QuickCheck
Posts with mentions or reviews of QuickCheck.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2025-04-18.
-
What Are the Best Haskell Libraries in 2025?
Website: QuickCheck GitHub
-
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?
When comparing quickcheck-state-machine and QuickCheck you can also consider the following projects:
hedgehog - Release with confidence, state-of-the-art property testing for Haskell.
hspec - A Testing Framework for Haskell
genvalidity - Validity and validity-based testing
speculate - Speculate laws about Haskell functions
quickspec - Equational laws for free