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

Further support for partial application lambda re-sugaring by supporting coerced vars #40

Closed
GoogleCodeExporter opened this issue Jun 21, 2015 · 2 comments

Comments

@GoogleCodeExporter
Copy link

The current re-sugaring is ad-hoc and we can improve it for example, given

    let f (x:obj) (y:obj) = x |> string

Before this fix the following expression decompilation

    <@ 2 |> f "2" @> |> decompile

would be

    "2 |> let x = "2" in fun y -> f x y"

due to coercion throwing off our pattern matching. But after this fix we'll have

    "2 |> f "2""

Original issue reported on code.google.com by stephen....@gmail.com on 5 Jul 2011 at 3:22

@GoogleCodeExporter
Copy link
Author

Original comment by stephen....@gmail.com on 5 Jul 2011 at 3:28

  • Changed state: Fixed

@GoogleCodeExporter
Copy link
Author

Original comment by stephen....@gmail.com on 7 Jul 2011 at 3:38

  • Added labels: Milestone-Release2.0.0

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

1 participant