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

Include lower bound in MaxSize[N] predicate #473

Closed
fthomas opened this issue Apr 11, 2018 · 0 comments
Closed

Include lower bound in MaxSize[N] predicate #473

fthomas opened this issue Apr 11, 2018 · 0 comments
Assignees

Comments

@fthomas
Copy link
Owner

fthomas commented Apr 11, 2018

In #455 (comment) @matthedude noticed that the type MaxSize[N] = Size[LessEqual[N]] predicate should include a lower bound like this type MaxSize[N] = Size[NonNegative And LessEqual[N]]. In case of the Arbitrary instance for collections with any Size[P], this would give as a correct Arbitrary[Int Refined P] for the size of such collection that does not generate negative values when Size[P] is MaxSize[N].

I agree that we should do this.

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

No branches or pull requests

1 participant