-
Notifications
You must be signed in to change notification settings - Fork 20
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
extend ComputationExpression builders with Map : m<'a> * ('a -> 'b) -> m<'b> #36
Comments
Going over old issues: just to say that I agree this is a reasonable suggestion. |
Just a note that the conversion from UserVoice glitched on this issue: the two occurrences of |
@rmunn Thanks, fixed. |
Yes please. This is partly why the continuation monad is so crazy expensive right? |
@dsyme needs-rfc tag can be removed |
Was completed a while back |
Submitted by Georg Haaser on 1/31/2016 12:00:00 AM
8 votes on UserVoice prior to migration
In many scenarios computation expressions could be executed way more efficiently when having just a little more information. The typical use-case for that would be something like
which currently gets translated to:
By monad laws (borrowed from haskell here) this must be equal to:
In many scenarios the latter can be implemented with a lot less overhead, so in my opinion it would be profitable to allow users to provide this "shortcut".
Original UserVoice Submission
Archived Uservoice Comments
The text was updated successfully, but these errors were encountered: