In A quick look at reduce, foldl, foldr, and associative order, we discussed foldl
and foldr
, and we said that foldl
leftassociated its function, while foldr
rightassociated its function.
These expressions sound familiar. In high school (perhaps sooner!), we learned that some mathematical operators, such as plus and multiply, are associative, or have the associative property. Is this the same thing?
The answer is short, and would fit in a footnote. They are not the same thing. But let’s take our time, we can write some interesting code to demonstrate that they are not the same thing.
the associative property
A binary operation is “associative” if, when there is an expression containing two or more occurrences in a row of the same associative operator, the order in which the operations are performed does not matter as long as the sequence of the operands is not changed.
Let’s take “plus” as an example. If we want to add the numbers from one to four in JavaScript, we get the same answer no matter which one of these we write:
(((1 + 2) + 3) + 4)
((1 + (2 + 3)) + 4)
((1 + 2) + (3 + 4))
(1 + ((2 + 3) + 4))
(1 + (2 + (3 + 4)))
Because we always get the same answer, we say that plus has the associative property. Other binary operators that have the associative property include multiplication and catenation (of strings arrays, or lists in general).
Not all binary operators have the associative property. Subtraction does not have the associative property: ((4  3)  1) === 0
, but (4  (3  1)) === 2
. And as we saw in the previous post, binary composition does not have the associative property.
checking the associative property
The right thing to do when considering whether an operator has the associative property is to prove it. But we are software developers holding a testdriven hammer, and therefore every problem looks like a testsuite nail. So let’s write a little checker for the associative property.
First things first, let’s write a representation for the order of operations. We start with an example, let’s say ((1 + (2 + 3)) + 4)
.
We’ll rewrite it using brackets: [[1 + [2 + 3]] + 4]
.
Then we’ll remove the operators: [[1 [2 3]] 4]
.
And add commas: [[1, [2, 3]], 4]
.
We now have nested arrays. What do they represent? A binary tree:
1 2 3 4
\ \ / /
\ + /
\ / /
+ /
\ /
+
The leaves of the tree are the operands, and the nodes are the places where we apply the operator. This is useful: We have taken something implicit, the order of applying an operator, and made it an explicit data structure.
Given this data structure, we can write a function that applies a binary operation to it. Naturally, we will represent the binary operation as a function:
const plus = (a, b) => a + b;
const applyOperator = (operator, [left, right]) => {
if (left instanceof Array) {
left = applyOperator(operator, left);
}
if (right instanceof Array) {
right = applyOperator(operator, right);
}
return operator(left, right);
}
And we can use our function to check that plus
has the associative property:
applyOperator(plus, [[[1, 2], 3], 4])
//=> 10
applyOperator(plus, [[1, [2, 3]], 4])
//=> 10
applyOperator(plus, [[1, 2], [3, 4]])
//=> 10
applyOperator(plus, [1, [[2, 3], 4]])
//=> 10
applyOperator(plus, [1, [2, [3, 4]]])
//=> 10
Unfortunately, our function won’t work for operations that take arrays as operands, so here’s a hacked up version using a Tuple
subclass of Array
, with an example of its use:^{1}
function Tuple (...elements) {
if (this === undefined) {
return Array.of.apply(Tuple, elements);
}
}
Tuple.prototype = Object.create(Array.prototype);
const applyOperator = (operator, [left, right]) => {
if (left instanceof Tuple) {
left = applyOperator(operator, left);
}
if (right instanceof Tuple) {
right = applyOperator(operator, right);
}
return operator(left, right);
}
const catenate = (a, b) => a.concat(b);
applyOperator(catenate, Tuple(Tuple(Tuple([1], [2]), [3]), [4]))
//=> [1, 2, 3, 4]
applyOperator(catenate, Tuple(Tuple([1], Tuple([2], [3])), [4]))
//=> [1, 2, 3, 4]
applyOperator(catenate, Tuple(Tuple([1], [2]), Tuple([3], [4])))
//=> [1, 2, 3, 4]
applyOperator(catenate, Tuple([1], Tuple(Tuple([2], [3]), [4])))
//=> [1, 2, 3, 4]
applyOperator(catenate, Tuple([1], Tuple([2], Tuple([3], [4]))))
//=> [1, 2, 3, 4]
associating an expression consisting of an operator and two or more operands
Now that we have a representation for the way we associate an expression, a tree of tuples, we can write functions that generate associations. That’s the way of JavaScript: Anything that can be represented as a value can be passed to a function or returned from a function.
Here’s a function that makes a leftassociated tree for any number of operands:
const leftAssociate = operands => {
const [first, second, ...rest] = operands;
const left = Tuple(first, second);
if (rest.length === 0) {
return left;
} else {
return leftAssociate([left, ...rest]);
}
}
leftAssociate([1, 2, 3, 4)]
//=> Tuple(Tuple(Tuple(1, 2), 3), 4)
And another that makes a rightassociated tree for any number of operands:
const rightAssociate = operands => {
const rest = operands.slice(0, operands.length  2);
const secondLast = operands[operands.length  2];
const last = operands[operands.length  1];
const right = Tuple(secondLast, last);
if (rest.length === 0) {
return right;
} else {
return rightAssociate([...rest, right]);
}
}
rightAssociate([1, 2, 3, 4])
//=> Tuple(1, Tuple(2, Tuple(3, 4)))
Given these two functions, we can write a pair of application methods that apply an operator to a set of operands, either leftassociated or rightassociated:
const leftApply = (operator, operands) =>
applyOperator(operator, leftAssociate(operands));
const rightApply = (operator, operands) =>
applyOperator(operator, rightAssociate(operands));
Of course, this makes no difference if, like +
, the operator has the associative property:
leftApply(plus, [4, 3, 2, 1])
//=> 10
rightApply(plus, [4, 3, 2, 1])
//=> 10
And every difference if the operator doesn’t:
const minus = (x, y) => x  y;
leftApply(minus, [4, 3, 2, 1])
//=> 2
rightApply(minus, [4, 3, 2, 1])
//=> 2
back to foldl and foldr
So now we can revisit foldl
and foldr
, and underscore what we mean when we say that foldl
leftassociates the folding function we supply. We mean that if we write:
foldl(minus, [4, 3, 2, 1])
foldr(minus, [4, 3, 2, 1])
We get the same results as if we write:
leftApply(minus, [4, 3, 2, 1])
rightApply(minus, [4, 3, 2, 1])
The difference being, of course, that our foldl
and foldr
functions are written to incrementally consume their operands from any iterable, while leftApply
and rightApply
explicitly construct a binary tree of associations before evaluating anything.
And if someone asks us what this has to do with the associative property, we reply that an operator with the associative property is one for which for any association of operator and multiple operands, there is no difference to the computed result.
this seems like a lot of bother
Yes, it is a lot of bother just to explain that leftassociating and rightassociating are related to, but not the same as, the associative property of operators.
But foldl
and foldr
implicitly associated their folding functions, and it is very interesting to write code that takes something implicit and makes it explicit, in this case, the association. It is also interesting to factor our code such that we separate the association and application from the operator and operands.
So really, all of this is just an excuse to get some practice thinking about how code can be rewritten to make the implicit, explicit. And that is one of the cornerstones of software design: Choosing what we make explicit, and what implicit goes along with choosing what we name, and what we do not name. Or what we becomes a firstclass entity, and what is subordinate to other entities.
It’s an excercise in deciding what we want our code to communicate, what we want our code to make flexible, and what we want our code to manipulate.
(discuss on /r/javascript)
notes
I’m working on a new book. Have a look at Raganwald’s Tooling for Turing Machines and let me know if you’re interested. Thanks!

We could, of course, simply use an object with
left
andright
properties. We’ll leave that as “an exercise for the reader.” ↩