Currying and partial application are really nice when you have a pipeline operator, which is why the partial application and pipeline operator proposals are so intertwined.
users
|> List.map (fn user -> user.Email)
|> sendEmail
|> Result.mapError (fn _ -> "Error sending emails")Currying != partial application.
And while currying is useful in curried languages (to convert back from uncurried to curried), and partial application is useful period, the question is whether currying is useful, in general, in an uncurried language.
I don't think it is:
* You usually want to perform partial application, currying is an unnecessary intermediate step.
* Currying conflicts with rich "imperative" parameters e.g. overloading, default parameters, keyword parameters.
* Uncurried languages are usually imperative and effectful, that you have filled all the parameter spots does not mean you want to invoke the function.
Having a curried language is neat, and in curried languages converting back from uncurried to curried functions is tremendously useful. But it's not so for uncurried languages (which is most of them).
> which is why the partial application and pipeline operator proposals are so intertwined.
Again, partial application != currying. And pipeline operators can perform partial application (implicitly or explicitely) on their own. For a flagrant example, just see Clojure:
(->> users
(map :email)
(sendEmail)
(mapError (constantly "Error sending emails"))In particular I don't know what's meant by "curried" and "uncurried" languages
add :: Int -> Int -> Int
This is a function that takes one integer and returns a function which itself takes another integer and then finally returns an integer. Syntax sugar allows you to define it and call it like a single function.An uncurried function in these languages is a function that takes multiple arguments as a tuple.
add :: (Int, Int) -> Int
You don't see a lot of functions defined this way in Haskell because there isn't really any advantage to doing so in a lazy, pure language. It's more common in Standard ML from what I've seen, because SML is strict and impure.Currying is the conversion of an n-ary function into a chain of 1-ary function e.g. `fn(a, b, c) -> d` becomes `fn(a) -> fn(b) -> fn(c) -> d`.
Partial application is what it says on the tin, it only applies k parameters to the function returning an (n-k) parameters function, without actually running the function.
Currying is one method allowing partial application, but not necessarily the only one, or usually the best fit as it tends to not interact well with features like overloading, default parameters, keyword parameters, …
> In particular I don't know what's meant by "curried" and "uncurried" languages
Languages like Haskell, OCaml, or Elm are "curried" by default: when you define an n-ary function it's really just sugar for a chain of 1-ary functions; and the application of multiple arguments is similarly the implicit application of single arguments multiple times e.g.
map : (a -> b) -> List a -> List b
map f l =
case l of
[] -> []
(h::t) -> (f h) :: (map f t)
can be called as map fn [1, 2, 3]
or (map fn) [1, 2, 3]
the semantics are identical, which is not the case in an uncurried language like Javascript or Python: map(fn, [1, 2, 3])
and map(fn)([1, 2, 3])
will behave very differently unless the implementer has taken special steps to handle this case e.g. dynamic behaviour based on an optional second parameter, overloading, etc…What would be the use of this? Just delaying the execution of the function's side-effects?
I'll tip my hand: I'm working on a JS-like (and JS-targeted) language that I want to support partial-application/currying by default. Under the hood everything is represented in a curried way, but syntactically you can both define and invoke/partially-invoke functions with the more familiar syntax (commas). But this is fully superficial right now; it all happens at the parser level. Is there a downside to doing things this way?
For defaults/optionals, given "fn f(x, y, z=10)", if "f(1, 2)" evaluates to "f(1)(2)", does that return a function or the result of "f(1)(2)(10)"? What if you have "fn f(x, y = 10, z)"? All of this is a lot easier if you can evaluate the full argument list at the time of function invocation.
As for keyword arguments, they just don't play well with any kind of enforced ordering.
I wonder if that ambiguity could be resolved using contextual type info? I.e. if one of the two interpretations fits the expected type, use that. Otherwise, type-error.
Maybe that would be confusing, not sure.
I read your post yesterday. Good luck with your language!
To be honest this comments section has me seriously reconsidering the "everything is partially-applicable by default" feature, haha.
This doesn't contradict anything you said, but I think Idris is a language that curries everything and has default parameters.
https://docs.idris-lang.org/en/latest/tutorial/miscellany.ht...
errors = list()
for user in users:
if not sendEmail(user.email)
errors.append("Error sending emails")Because I say "what" do to do without going into details of "how" I feel like I have spent less mental capacity reading this portion of code.
However, it does require your transformations to be simple and composable, shove a giant multi-line lambda in there it yes, the loop will be better.
For what it's worth, your example doesn't map 1-to-1 to the intention of what I wrote. Doing it in a more imperative style, I'd have to write
emails = list()
for user in users:
emails.push(user.email)
res = sendEmail emails
if res.IsError:
Error("Error sending emails")
else:
res
(excuse my pseudo Python) try:
return sendEmail(user.email for user in users)
except IsError:
Error("Error sending emails") # if it does something
I agree FP pipelines are nice, but not everything needs it. users.stream()
.map(User::getEmail)
.map(Email::send)
.map(res -> "Error sending email: " + res)
.collect(toList())https://docs.oracle.com/javase/8/docs/api/java/util/stream/p...
with elixir (the previous example) you'd likely use simple hashmaps or lists like {email: "mail"} or [:error, "reason for failure"].
That doesn't sound like its amazing, but actually is in practice, because the whole language is written with that in mind (pattern matching to effectively do function/method overloading depending on the value of each argument for example)
its very concise while still being very explicit. The same would be possible with java, but you'll need to create a lot of classes/interfaces/enums/boilerplate to facilitate it.
i'd still prefer java any time at a dayjob though, because boring and dumb is generally better if you need to write code that's gonna be in use for decades... and likely going to be changed by a lot of people with varying levels of experience.
No, in most cases you don't. The stream interface is mostly designed around simple Lists, Sets and Maps. It also interacts very well with the Collection framework (e.g. myHashmap.entrySet() yielding a set, etc.) which is part of the standard library.
You can extend streams with custom collectors, but rarely if ever you need to define intermediate data structures. You do need to define initial and terminal structures, but I'd argue that's good practice regardless.
that lets you pass the result from each function to the next without explicitly stating what form they have, yes.
You'll still be missing the conciseness/explicitness because the language isn't meant to be used like that and is missing necessary features in order to facilitate it such as pattern matching by the passed in values into function.
to make a simple example, you could theoretically write the following pseudo-code
def sendEmail({email}) do
// send email
end
def sendEmail({id}) do
// get email address
sendEmail({email})
end
sendEmail({id: 244})
or to make sure your code stops executing if an error occurs (positional return values this time) [:ok, msg] = sendEmail(lkajsdf) .collect(Collectors.groupingBy(...))maybe actually learn to program sometimes, then you will figure out what it does.
An error could be a malformed e-mail address, or a timeout from the e-mail server.
What you do not want is to send 10000 e-mail, then have an error like "Error sending emails", then re-run a few time, only to have some people receive 5 e-mail, and some people receive 0 e-mail.
Dependency injection and currying both do the same thing, and they are both useless most of the time just like Inheritence. You want to avoid nesting as much as possible. We should be rejecting dependencies. We should be returning values and passing them through functional pipelines.
Free yourself from the dogma, just do what makes sense.
I dare mention Rich Hickey and his talk “Simple Made Easy”, and postulate that we should be using whatever abstraction is _the simplest_ (not the easiest one) to reason about, to which the grand parent rightfully refers, as far as I understand.
Objects are easy to many, but far from being objectively simple.
I can't find it but there once was a blog that expressed this as: Reddit is a site where you can talk about anything with the exception of a few banned topics. Voat(might have been another reddit clone?) is a much less popular site where you can talk about anything. What do they talk about on Voat? Only the few topics banned on reddit.
While is strictly more powerful than for, for is strictly more powerful than foreach, foreach is strictly more powerful than map. And yet 95% of the time, the power in map is sufficient. Therefore 95% of the time you should use map. When you encounter a foreach, you should be expecting non-purity. When you encounter a while, you know that it's doing some recursive operation that requires that power.
This let's you reason about it. This allows you to compose these less powerful things.
[0]: https://blog.codinghorror.com/the-principle-of-least-power/
I have no preference for either fyi.
All together, "Favor composition over inheritence" is like "Favor pipelining over currying/dependency injection".
There's an example of a pipeline down the thread in p2t2p's comment[1].
The point being, essentially they are the same thing, they hold the same power, and it's just a stylistic difference.
Mark Seeman's blog[0][1][2](many more related articles, these are particularly related) helped me grasp some of this stuff.
[0]: https://blog.ploeh.dk/2014/06/10/pure-di/
[1]: https://blog.ploeh.dk/2017/01/30/partial-application-is-depe...
[2]: https://blog.ploeh.dk/2017/01/27/dependency-injection-is-pas...
What about partial application of named parameters?
Builder pattern. In a language that accommodates it well, such as Elm, it would look like this:
IconLib.downloadIcon
|> IconLib.withSize 12
|> IconLib.withColor "red"
|> IconLib.withCssClass "dl-icon"
Allowing currying of any parameter like: standardDownloadIcon = IconLib.downloadIcon
|> IconLib.withSize 12
largeDownloadIcon = IconLib.downloadIcon
|> IconLib.withSize 16 half = (`div` 2)
Also, I think the idea with curried languages is that you're supposed to write your functions with the parameter that people are most likely to want to curry first.I believe this is a notational issue more than anything. Fixpoint style in languages like Haskell is very natural and intuitive, if you have to write a `curry` function like the article shows, you have already lost.
It's much more convenient to `ad-hoc curry` with things like:
const f = x => myFunc(someArg, x, someOtherArg);
return myArr.map(f).whateverElse();In uncurried langages, generic curring has few use cases. Partial application does, and some libraries may want to provide both curried and uncurried versions of some things, but generally “curry” itself is unhelpful.
Partial application is the application of an n-ary function to k arguments (k <= n, often but not necessarily l < n) without actually evaluating (calling) the function, so given the same `f = (a, b, c) => d`, `partial(f, 1, 2)` returns a function `c => d`.
A closure is a function which "closes over" its lexical initialisation context and carries it along.
A curried function is trivially partially applicable, just call it with less than `n` parameters and it'll yield a (also curried) function taking `n - k` parameters. It's useful to build a language on that principle, it's not really useful to provide that as a generic utility, because in most scenarios you'd rather just partially apply a function.
A closure is a completely freeform tool so it can do more or less anything you want.
Theoretically they're equivalent, but practically not really especially when you introduce more complicated "imperative" features e.g. default parameters or overloading.
They also have API impacts e.g. because Haskell is curried, its HoFs are generally of the form `fn param`, that way you can trivially partially apply the callback and use the same partially applied function to different parameters.
In method-based languages, there is no way to partially apply the callback, and in uncurried languages in general since partial application is a secondary concern you'll often see the callback last regardless so the non-callback parameters don't "get lost" at the tail end of a long callback.
For example this allows you to write methods that only take 1 input and 1 output type arg and handle all function cases with any amount of arguments. e.g. in Java/C# you typically have lots of types/anonymous class shapes to define different function shapes to represent lambdas/functions.
e.g. C# delegate syntax (Java has a more verbose way to do this last time I checked)
delegate T Action<T>(); delegate T Func<T>(); delegate R Func<T, R>(T firstArg); delegate R Func<T1, T2, R>(T1 firstArg, T2 secondArg);
Java has things like Consumer<>, Supplier<>, Function<> etc. If you want more than a https://docs.oracle.com/javase/8/docs/api/java/util/function... you typically have to define your own template that's not standard.
However in curried languages all use cases typically are handled by one form and the compiler does the mapping for you (e.g Haskell, F#, etc).
type Func<T, R> = T -> R
The compiler translates a method like foo(a, b) to foo(a)(b) and has certain compile tricks to avoid intermediate allocations if you're specifying all the args at once.
In practice it means writing a LOT less overloads to deal with all the different argument length cases defined and a lot less "Function" types to consider. Instead of an overload in Java for example with Function, BiFunction, etc or C# with Func<>, Func<_, _>, etc you just write the one or two and chain it.
Consider advanced component creation in virtual dom frameworks. Components may want to yield some render responsibilities to the end-user while not exposing their inner api. They can use currying here to hide details from the end-user while providing their own public api.
I've also seen it be useful when you have sub components editing different parts of a model. You write one generic prop-assigner setModelProp(prop, val) alongside the model in the scope that owns the model. Then you give each subcomponent a curried setter with the prop locked in. Those sub-components don't have the ability to edit the model any other way now, and you haven't written a ton of boilerplate setters.
That's really not true. The Y combinator is not generally useful for instance, because every modern language supports recursion.
> Currying is indispensable in some composability workflows.
It's not.
> Then you give each subcomponent a curried setter with the prop locked in.
That's partial application, not currying.
There are convenience use cases for libraries providing curried versions of some functions e.g. you might want to provide both `setModelProp(prop, val)` and `setModelProp(prop)(val)`. But that's because you expect significant use cases fo partially applied versions of the utility functions. Currying is not necessary for this, it just makes things more convenient for users.
I wish I had been told that before trying to understand and actually use it. I once wrote a JS benchmark based on Rosetta code to compute Fibonacci numbers. Not only is the Y combinator code convoluted and quite hard to understand, it's also between 1e5...2e5 times slower than a plain iterative implementation.
Somehow I find it ironic to post such a result here.
In that case I don't know any indispensible situations for currying.
Same here. I think this is a correct approach, sprinkled with some reactive code here and there (prefer reactive over other abstractions such as 2-way binding et al).
I'm not a big fan of OOP either, the older I get the more I end up writing a cross between procedural and functional code with the least possible abstractions in the way - while also trying to find the smallest natural coupling between blocks of code.
Patterns are very subjective, and they usually have a place where it's objectively good to use them - but I'm not sure about currying, it feels more like a hack for when you can't do what should be done to the underlying code.