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: [EMAIL PROTECTED]
WWW: http://brahms.fmi.uni-passau.de/cl/staff/herrmann.html
- Higher-order function application Tim Sweeney
- Re: Higher-order function application Adrian Hey
- Re: Higher-order function application George Russell
- Re: Higher-order function application Ch. A. Herrmann
- Re: Higher-order function application Andreas Rossberg
- Re: Higher-order function application D. Tweed
- RE: Higher-order function application Andrew Kennedy
- Re: Higher-order function application Bjorn Lisper
- Re: Higher-order function application Ralf Muschall
- Re: Higher-order function application William Lee Irwin III
