Get the latest tech news
A Combinatory Rosetta Stone
Combinatory Programming : In [Combinatory Programming](./combinatory-programming.html), we attempt to provide motivating examples for the various combinators identified as useful to everyday programmers.
Nevertheless we can imagine a so-called pipe that behaves just like compose but in reverse order, which might feel more comfortable to those programmers who have grown used to the conveniences of-> and its cousins. In the tacit examples, we use their respective languages’ standard library pow function in order to be able to pass a first-class argument to the apply combinator. It’s worth noting that in both our JavaScript and Janet examples, the distinction between a unary recombined function, like minMax, and a variadic one, like plusOrMinus, is purely semantic: the syntax of application doesn’t change when the number of arguments expected by g and h do.
Or read this on Hacker News
