[Haskell-cafe] Re: currying combinators

Daniel Peebles pumpkingod at gmail.com
Tue May 25 21:02:00 EDT 2010


Djinn can't figure it out, and neither can I :P

2010/5/25 Günther Schmidt <gue.schmidt at web.de>

> 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
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20100525/c8a75e0d/attachment.html


More information about the Haskell-Cafe mailing list