[racket-dev] Fancy application/automatic anonymous functions

From: Neil Toronto (neil.toronto at gmail.com)
Date: Wed May 18 00:16:06 EDT 2011

Robby Findler wrote:
> On Tue, May 17, 2011 at 9:52 PM, Matthias Felleisen
> <matthias at ccs.neu.edu> wrote:
>> For a while I decided to try point-free programming. You can do it in
>> Racket as well as in Haskell. Then I ran across someone's rules for
>> writing Scheme and he had written
>>  (lambda (n) (+ x n))
>> is just as readable if not more than
>>  (curry + x)
>> and often (not here) it is shorter. I tested it in my project and he's
>> right.
> +1 to this choice!

I prefer

     (λ (n) (+ x n))

CTRL-\ is one of my best friends when I use a lot of higher-order 
functions in Racket. It just looks so clean.

Neil T

Posted on the dev mailing list.