Maximilian Algehed
Maximilian Algehed
This PR introduces QuickCheck generators for PIR. Pre-submit checklist: - Branch - [x] Tests are provided (if possible) - [ ] Commit sequence broadly makes sense - [ ] Key...
Hi, just dropping this here to let you know there is a bug in your implementation of ordinal `divmod`, `ordinals.ml:187` should probably be the ratio of the two different coefficients.
HugeLists found the following law: `length xs = length ys`
# Description I had to do some work to get profiling to work and after talking to MPJ things worked _on my machine_. I've updated the instructions to reflect what...
If you write the following code: ```haskell listSetRelation :: Spec BaseFn ([Int], Set Int) listSetRelation = constrained' $ \xs ys -> [ forAll xs $ \ x -> [ x...
This PR fixes #41.
Thoughts welcome, are there any outstanding PRs that we should try to incorporate in this release? I would be happy if we could get #387 and maybe #376 (but I'm...
Closes #363 The tricky thing here is the lazy behaviour of `Gen` and `forAll`. That's what makes me unsure whether or not `suchThatDiscard` is a good idea in practice.
After a discussion about changing the interaction between `checkCoverage` and `withMaxSuccess` whereby `checkCoverage` will ignore the number given in `withMaxSuccess` (because `checkCoverage` may require _more_ tests than what is specified)...
There are a bunch of types that have been added to `base` in recent years. The goal here is to bring `Test.QuickCheck.Arbitrary` up to speed with these new types. closes...