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
F# 5 applicative computation expression #268
Comments
Is this a duplicate of #267? |
I'm not sure what happened, thanks for bringing that up. When I submitted the first issue I got the Github 404 page and just submitted again. I've closed #267 in favor of this issue. |
For which of our monadic types is its monadic behavior different from its application behavior? I do not know of any but I could be missing something. |
Oh, I realized how the applicative behavior would differ from the monadic behavior. Hedgehog currently shrinks "multiple" generators sequentially. This is required for the monadic behavior. The applicative behavior could be different; it could for example, cyclically shrink the generators until no improvement is possible (i.e. a Pareto optimal position). I find this very interesting. |
@moodmosaic, does Haskell Hedgehog have this applicative behavior? |
I was thinking of how this could differ, especially wrt That would be an interesting way to control the integrated shrinking behavior of Hedgehog. |
My intuition is that the applicative behavior of
I don't think that would be a good idea. Then applicatively generating a list would produce a list with the same value throughout.
I don't know what you mean by "grow". |
This is included in version 0.12.1. |
With F# 5 on the horizon, I think we should consider adding support for the new applicative computation expressions therein. This is mostly a tracking issue so we don't forget. Brief notes on this are here.
The text was updated successfully, but these errors were encountered: