more flexible partial application

[lennart at augustsson.net]

I think this is doable, but you have to specify carefully
where those lambdas are inserted.
Where are they inserted in your suggestion?
It has to be a syntactic transformation, because using
type information would make it too complex in my opinion.

In my opinion, it's a useful feature, but I'm not
convinced it's useful enough to add to Haskell.

  -- Lennart


Quoting Sebastian Sylvan <sebastian.sylvan at gmail.com>:

> Are there any subtle reasons for why something like the following
> couldn't be allowed?
>
>
>> foo x y z w = ...
>> bar x w = foo x _ _ w
>
> I.e. a more flexible version of partial application. This would be
> translated too
>
>> bar x w = \y z -> foo x y z w
>
> I.e a function which takes the "_" parameters in the same order they
> were encountered in the function application.
>
> Some other languages allow this, such as Nemerle. Quite handy.
>
> /S
>
> --
> Sebastian Sylvan
> +46(0)736-818655
> UIN: 44640862
> _______________________________________________
> Haskell-prime mailing list
> Haskell-prime at haskell.org
> http://haskell.org/mailman/listinfo/haskell-prime
>