2010/5/26 Daniel Peebles <[email protected]>: > Djinn can't figure it out, and neither can I :P
Methinks Yitzchak made a typo; for starters, where does the t1 value come from (since it seems to be the base of the rest of it)? > > 2010/5/25 Günther Schmidt <[email protected]> >> >> Hi Yitz, >> >> embarrassingly I was unable to deduce the implementation from the type >> signature, don't be tease man, show me what you got :) >> >> Günther >> >> Am 25.05.10 18:27, schrieb 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 >> >> >> _______________________________________________ >> Haskell-Cafe mailing list >> [email protected] >> http://www.haskell.org/mailman/listinfo/haskell-cafe > > > _______________________________________________ > Haskell-Cafe mailing list > [email protected] > http://www.haskell.org/mailman/listinfo/haskell-cafe > > -- Ivan Lazar Miljenovic [email protected] IvanMiljenovic.wordpress.com _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
