[Haskell-cafe] currying combinators

[Yitzchak Gale]

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