On Feb 26, 10:58 am, Anand Patil <anand.prabhakar.pa...@gmail.com>
wrote:
> On Feb 26, 4:41 pm, mikel <mev...@mac.com> wrote:
>
> > Other people have explained currying and partial application, and why
> > it doesn't normally spply the feature you want.
>
> I'd be interested in reading about this if you know of a link.
What I meant was, other people have talked about it *in this
thread*. :-) As in, farther up the page. :-)
But you can find more about currying here:
http://en.wikipedia.org/wiki/Currying
> > Normally, in a lnaguage that supplies partial application, the way to
> > achieve the effect you want is to use combinators that change the
> > order of arguments.
>
> OK, that sounds like a clean functional way to do it. Thanks.
This article includes some discussion of combinators, including
examples of some standard ones:
http://en.wikipedia.org/wiki/Combinators#Examples_of_combinators
Combinators are sort of interesting in themselves; it turns out that
the standard combinators S and K are Turing complete; that is, a
language consisting only of S and K is sufficient to compute anything
that can be computed (although such a language would be neither
convenient nor efficient). That's sort of surprising.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Clojure" group.
To post to this group, send email to clojure@googlegroups.com
To unsubscribe from this group, send email to
clojure+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/clojure?hl=en
-~----------~----~----~----~------~----~------~--~---
