[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Higher-order function application

Hi Tim,

    Tim> 6. Applying a function f:t->u to a list x::[t] translates to
    Tim> "map f x".

the problem is that we loose much of the strength the Haskell type
system provides and a lot of programming errors will remain
undetected.

What you can do is write a preprocessor that provides a
nicer syntax for you.

Cheers
-- 
 Christoph Herrmann
 E-mail:  herrmann@fmi.uni-passau.de
 WWW:     http://brahms.fmi.uni-passau.de/cl/staff/herrmann.html