*To*: Lars Hupel <hupel at in.tum.de>, <cl-isabelle-users at lists.cam.ac.uk>*Subject*: Re: [isabelle] Quickcheck setup for finite sets*From*: Andreas Lochbihler <andreas.lochbihler at inf.ethz.ch>*Date*: Wed, 8 Jul 2015 12:20:42 +0200*In-reply-to*: <559BC90F.5090004@in.tum.de>*References*: <559BC90F.5090004@in.tum.de>*User-agent*: Mozilla/5.0 (X11; Linux x86_64; rv:31.0) Gecko/20100101 Thunderbird/31.7.0

Hi Lars,

quickcheck_generator fset constructors: "{||}", finsert

Best, Andreas On 07/07/15 14:41, Lars Hupel wrote:

Dear list, is there any reason why there's no Quickcheck setup for finite sets? I couldn't find any, so I tried setting it up (see attached theory). I'm hardly a Quickcheck expert, so I have no idea whether it makes sense â at least it works for some cases I tried. Slightly related question: How does the interaction between the datatype package and Quickcheck work? It appears that it produces instances of full_exhaustive in certain cases and not in others, but I'm not quite sure in which cases. (Current working hypothesis: It doesn't when nested recursion is involved.) Is there any other way to conveniently obtain full_exhaustive instances? Cheers Lars

**Follow-Ups**:**Re: [isabelle] Quickcheck setup for finite sets***From:*Lars Hupel

**References**:**[isabelle] Quickcheck setup for finite sets***From:*Lars Hupel

- Previous by Date: Re: [isabelle] Monotonicity of rtrancl for inductive/inductive_set
- Next by Date: Re: [isabelle] Quickcheck setup for finite sets
- Previous by Thread: [isabelle] Quickcheck setup for finite sets
- Next by Thread: Re: [isabelle] Quickcheck setup for finite sets
- Cl-isabelle-users July 2015 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list