I wrote:
keep :: ((t - b) - u - b) - ((t1 - t) - b) - (t1 - u) - b
so then
nameZip = keep (drop' . drop') names
Günther Schmidt wrote:
don't be tease man, show me what you got :)
Ivan Miljenovic wrote:
Methinks Yitzchak made a typo
Yes, sorry about that. Tested in ghci this time
I wrote:
keep :: (forall c . (t - c) - u - c) - ((t1 - t) - b) - (t1 -
u) - b
keep transform rec = \fn - rec $ transform id . fn
Just to clarify - you don't really need the RankNTypes here, I just
wrote it that way so you could see what I had been thinking,
and to make it clear how the
Djinn can't figure it out, and neither can I :P
2010/5/25 Günther Schmidt gue.schm...@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
