Hello!
I'd like to announce the first release of the quickcheck-instances
package, which aims to consolidate commonly needed class instances for
use with QuickCheck.
These instances are appropriate when your tests don't have strong
requirements on the nature of the input data - for e
Often times QuickCheck properties are polymophic/overloaded without
giving a monomorphic type signature. But there can be several types
that you are interested. You can write scripts that check all the types
you are interested annotating the generic property for each different
monotype, which is
t Data.Foldable
> import Data.Monoid
> import Test.QuickCheck
-
Hello everyone,
This message is my answer a common question coming from
QuickCheck users: "How do I use QuickCheck on polymorphic
properties?". The
> > I guess what I would like is to reuse most of the mechanisms in
> > QuickCheck to have it say one of these two things:
> >
> > 1. Found an satisfying instance after 73 tries: [gives instance]
> >
> > 2. After 100 tries, could not find a satisfyi
Norman,
I guess what I would like is to reuse most of the mechanisms in
QuickCheck to have it say one of these two things:
1. Found an satisfying instance after 73 tries: [gives instance]
2. After 100 tries, could not find a satisfying instance.
Like failure, the first tells you
On Sun, 19 Oct 2008 00:39:32 +0200, Norman Ramsey <[EMAIL PROTECTED]> wrote:
I guess what I would like is to reuse most of the mechanisms in
QuickCheck to have it say one of these two things:
1. Found an satisfying instance after 73 tries: [gives instance]
2. After 100 tries, cou
> The answer is that QuickCheck can't correctly constructively verify an
> existential condition without a constructive mechanism to generate the
> existential (i.e. the Skolem function mentioned before).
I agree but don't think it's relevant. QuickCheck can
this is probably the most serious short-coming of QuickCheck.
--Ben
On 14 Oct 2008, at 23:36, Norman Ramsey wrote:
But how do I use QuickCheck to check an existential?
The "standard" method in QuickCheck is to be constructive, and
actually implement the function that constructs for the va
The answer is that QuickCheck can't correctly constructively verify an
existential condition without a constructive mechanism to generate the
existential (i.e. the Skolem function mentioned before).
If you think about it from a plausible reasoning and constructive logic
sense, QuickCheck s
> > But how do I use QuickCheck to check an existential?
>
> The "standard" method in QuickCheck is to be constructive, and
> actually implement the function that constructs for the value. So,
> instead of
>
> forAll x . exists y . P(x,y)
>
> y
Hi Norman,
> But how do I use QuickCheck to check an existential?
The "standard" method in QuickCheck is to be constructive, and
actually implement the function that constructs for the value. So,
instead of
forAll x . exists y . P(x,y)
you write
forAll x . P(x, find_y(x))
f
I recently used QuickCheck to check on some calculations for image compression.
(I love exact rational arithmetic!) But I thought only to check for
inverse properties, and I realized afterward I had failed to check for
ranges. For example I should have checked that
boundedB block = -1 <
Dear Haskellers,
We would like to draw your attention to the following. At the DEFUN
event (in conjunction with ICFP in Victoria in September), there will
be a half day tutorial titled:
Using QuickCheck and HPC - Obtaining Quality Assurance for Haskell
Code
The tutorial will be given by
On 24 nov 2006, at 22.04, Audrey Tang wrote:
在 Nov 24, 2006 9:29 PM 時，Björn Bringert 寫到：
This is just a quick announcement that the development version of
QuickCheck 2 is now available in a public darcs repository.
Some highlights:
- Shrinks failing test cases.
- Supports testing monadic
在 Nov 24, 2006 9:29 PM 時，Björn Bringert 寫到：
This is just a quick announcement that the development version of
QuickCheck 2 is now available in a public darcs repository.
Some highlights:
- Shrinks failing test cases.
- Supports testing monadic code.
Wonderful. Many thanks for QC2! :-)
By
This is just a quick announcement that the development version of
QuickCheck 2 is now available in a public darcs repository.
Some highlights:
- Shrinks failing test cases.
- Supports testing monadic code.
- Handles exceptions gracefully.
- coarbitrary has moved to a separate class, to make it
PQC: QuickCheck in the Age of Concurrency
An SMP parallel QuickCheck driver
Do you:
* Have (or want) lots of QuickCheck properties?
* Run
Has anyone got any examples of these working together?
Thanks, Dominic.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Koen Claessen (Wed, Apr 12, 2006 at 11:06:50AM +0200):
> >>There is currently an old QuickCheck version in the standard hierarchy
> >>in Test.QuickCheck. As the new QuickCheck is incompatible with the old
> >>one, I do not want to override that place. Rather, I woul
There is currently an old QuickCheck version in the standard hierarchy
in Test.QuickCheck. As the new QuickCheck is incompatible with the old
one, I do not want to override that place. Rather, I would like to
create my own little space in the hierarchy where the new version can
sit and develop
Koen Claessen wrote:
For the past couple of years, I have been quietly hacking on a brand new
version of QuickCheck with lots of cool features. I have been
distributing copies to some friends, but have not released any official
package.
Now, after lots of peer pressure, the time has come that
ompiler/interpreter command line.
The response to my proposal was semi-positive, but I don't think any
work has gone towards implementing it (certainly not by myself).
Cheers,
Frederik
On Tue, Apr 11, 2006 at 01:02:51PM +0200, Koen Claessen wrote:
> Dear all,
>
> For the past co
Dear all,
For the past couple of years, I have been quietly hacking on a brand new
version of QuickCheck with lots of cool features. I have been
distributing copies to some friends, but have not released any official
package.
Now, after lots of peer pressure, the time has come that I want to
27;t usually count on being able to
> prove these by construction.
Still, including QuickCheck tests for typeclass laws would be nice.
For example, QuickCheck.Utils has isAssociative, isCommutable, isTotalOrder.
http://www.haskell.org/ghc/docs/latest/html/libraries/QuickCheck/Test.QuickCheck.Util
Can someone remind me how to change the number of tests that QuickCheck
performs? I'm sure I knew how to do this but I can't find it in the
documentation and a web search revealed no examples.
Thanks, Dominic.
___
Haskell mailing list
[EMAIL
Dear Haskell-QuickCheck user,
When John and I published the first paper about QuickCheck
in 2000, we released a Haskell module that was cleary marked
as DRAFT.
Since then, a lot of things have happened; we and other
people have made extensions and improvements to QuickCheck,
but only very few of
(Reviving an old message here. You can see the original message at
http://www.stud.tu-ilmenau.de/~robertw/haskell/doc/contract_notations.lhs
)
On Tue, Feb 17, 2004 at 10:50:30AM +0100, Robert Will wrote:
> 4. A notation for preconditions. ...
>Presently I use the following coding style:
>
>
her ugly. Does anyone have a
better idea?
The most lightweight way to specify preconditions would be via another
function definition with the same parameters and a systematically
chosen name, for example
take_pre n xs = n>=0
thus making it easy to generate the QuickCheck property
> import QuickCheck
Dear developers of QuickCheck and Haddock,
Dear Haskell-Community,
((Summary: I'm trying to find notations for Design by Contract in Haskell
which can be standardised to be used by tools like Haddock and
QuickCheck. This will give Haskell programmers an
QuickCheck is in de "util" package. You can load a package with the
-package flag:
$ ghci -package util
Prelude> :browse QuickCheck
class Arbitrary a where {
arbitrary :: Gen a; coarbitrary :: forall b. a -> Gen b -> Gen b; }
arbitrary :: forall a. (Arbitrary a) => Gen
[EMAIL PROTECTED] (Norman Ramsey) writes:
> Can anyone help me figure out how to load QuickCheck into GHCI?
> QuickCheck is included in my Debian package, but my attempts
> at loading it are bootless:
>
> Prelude> :load QuickCheck
> Any advice, anyone?
You need to lo
Can anyone help me figure out how to load QuickCheck into GHCI?
QuickCheck is included in my Debian package, but my attempts
at loading it are bootless:
Prelude> :load QuickCheck
can't find module `QuickCheck'
Prelude> :load util/QuickCheck
can't find module `util/Quick
Hi all,
John Hughes and I have been working on a Haskell
module called "QuickCheck", which allows one to
express properties about Haskell functions in
a program.
The module also provides functions that can
generate random test cases for these properties,
and perform the testing.
33 matches
Mail list logo
