[Haskell-cafe] currying combinators

[David Sankel]

keep :: ((t -> b) -> u -> b) -> ((t1 -> t) -> b) -> (t1 -> u) -> b

On Wed, May 26, 2010 at 12:49 PM, Lennart Augustsson <lennart at augustsson.net
> wrote:

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

I wonder how one would prove that to be the case. I tried and didn't come up
with anything.

David

-- 
David Sankel
Sankel Software
www.sankelsoftware.com
585 617 4748 (Office)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20100526/a331a667/attachment.html