[Haskell-cafe] currying combinators

[Lennart Augustsson]

There are no interesting (i.e. total) functions of that type.

2010/5/25 Yitzchak Gale <gale at sefer.org>:
> Günther Schmidt wrote:
>> http://www.hpaste.org/fastcgi/hpaste.fcgi/view?id=25694
>> in which I attempt to develop a "currying combinator" library.
>> I'm stuck at some point and would appreciate any help.
>
> How about this:
>
> keep :: ((t -> b) -> u -> b) -> ((t1 -> t) -> b) -> (t1 -> u) -> b
>
> so then
>
> nameZip = keep (drop' . drop') names
>
> Regards,
> Yitz
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>