Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Auto-shrinkable IR #111

Open
phadej opened this issue May 26, 2015 · 2 comments
Open

Auto-shrinkable IR #111

phadej opened this issue May 26, 2015 · 2 comments
Milestone

Comments

@phadej
Copy link
Member

phadej commented May 26, 2015

DRMacIver But the main thing I had in mind is simplification.
DRMacIver I noticed that you couldn't simplify unions because your unions are untagged.
DRMacIver Which suggests to me (I haven't looked into the details) that you're using the standard Haskell quickcheck simplify implementation, which 
          works badly for dynamic languages, and you could benefit from either reiddraper or my techniques for attaching simplification to 
          generation strategies
DRMacIver In test.check you generate lazy simplification trees. In Hypothesis you generate and simplify an intermediate representation which you can 
          later convert to a value of the desired type.
DRMacIver Either of these have the nice property (heh) that you can write simplification rules that respect the constraints you generated with.

simplification = shrinking

@phadej phadej modified the milestone: 0.7.0 Jul 27, 2015
@phadej phadej modified the milestones: 0.7.0, 0.8.0 Aug 22, 2015
@bradleyayers
Copy link

What's "IR" in this context?

@phadej
Copy link
Member Author

phadej commented Oct 11, 2015

IR = Intermediate representation

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants