# Fusion Property of Fold

## An Explanation for Composability of Clojure Transducers

*In **A Tutorial on the Universality and Expressiveness of Fold**, Graham Hutton presents in a clear and understandable way the advantages of programming by folds. Most of the core concepts exposed there, among which the universal and fusion property of folds are to be found in **Bird's book**. In this short article we'll apply some of those ideas to *C*lojure transducers**, and we'll show how the fusion property implies the efficiency and composability of transducers. It's beyond of this writing to compare **left and right folds for Clojure and their lazyness**, since Clojure reduce is (notationally) a left fold and we'll assume all lists are left lists (say Clojure vectors). Note also that what follows is not about *C*lojure's fold** as found in **clojure.core.reducers**.*

## The Universal Property of Fold

Following Hutton, we can define a fold function on lists by means of the following properties. For sets $\alpha$and $\beta$, define $A_{\beta,\alpha}$the set of all functions $f\colon\beta\times\alpha\rightarrow\beta$ which we'll call *right actions* of $\alpha$on $\beta$and when the function $f$is clear from the context, we'll just write $b\cdot a$for $f(b, a)$. The $\mathsf{fold}$function can be defined as

such that, for a given $b\in\beta$the following properties hold:

where $\bar{x}\colon\!x$is the list obtained as conjunction of a list $\bar{x}$with an element $x$of $\alpha$(in Clojure $(\mathsf{conj}\,\bar{x}\,x)$).

Now for fixed $b$, (u1) and (u2) form indeed a **universal property**, i.e. if such a function exists then it's unique and $\mathsf{fold}$ is fully caracterized by these properties. Unicity is proven by means of induction: assume there's functions $\mathsf{f}$ and $\mathsf{f}^{'}$which satisfy (u1) and (u2) but which disagree i.e. $\mathsf{f}(f, b, \hat{x})\neq\mathsf{f}'(f, b, \hat{x})$on some list $\hat{x}=\bar{x}\colon\!x$. Now by (u2) they also need to disagree on $\bar{x}$, hence $\hat{x}$must have length zero contradicting (u1).

We can also restate (u2) by saying that for all $f,\,b$then as a function of $[\alpha]$in $\beta$the partial application $\mathsf{fold}_{f\,b}$commutes with $\colon\!x$and $\cdot x$, that is:

*Existence* of a fold function is proved *by implementation* in the context of the majority of programming languages. In Clojure, fold is the reduce function, but the universal property (u1) and (u2) can actually provide a constructive definition:

(defn fold [f i l] (if-some [last (peek (vec l))] (f (fold f i (butlast l)) last) i))

Since $\tt{fold}$above satisfies (u1) and (u2) by definition, and we can easily prove it for $\tt{reduce}$, then they have to be the same function, but we can build some *cheap* function-equality check on integer vectors

(require '[clojure.test.check :as c]) (require '[clojure.test.check.generators :as gen]) (require '[clojure.test.check.properties :as p]) (defn =' [& fns] (let [pr (p/for-all [v (gen/vector gen/int)] (apply = (map #(% v) fns)))] (c/quick-check 100 pr)))

to get a hint our definition is sound, trying out some concrete example

(=' (partial fold + 0) (partial reduce + 0))

(=' (partial fold str "") (partial reduce str ""))

## Expressing List Operations in Terms of Fold: Transducers

It is possible to express a lot of functions on lists in terms of fold, amongst the most popular are filter and map:

(defn filter' [pred] (fn [xs x] (if (pred x) (conj xs x) xs))) (fold (filter' odd?) [] (range 10))

(defn map' [phi] (fn [xs x] (conj xs (phi x)))) (fold (map' inc) [] (range 9))

where $(\tt{filter}'\,\pi)$and $(\tt{map}'\,\phi)$are actions of natural numbers on lists of natural numbers. Clojure transducers bring this pattern one step further: they incapsulate list-like operations independently of the reducing function. Formally, transducers are transformations of actions i.e. functions

which behaves functorially with respect of folds, this will be explained later.

Functions like $\tt{filter}$and $\tt{map}$in Clojure, when given a single argument, return a transducer. For instance, loot at

(let [s (with-out-str (clojure.repl/source filter))] (println (clojure.string/join (take 420 s))))

and let's see it applied to the $\tt{conj}$function at first

(fold ((filter odd?) conj) [] (range 6))

(fold ((map inc) conj) [] (range 9))

and later to the $\tt{+}$ function

(fold ((filter odd?) +) 0 (range 6))

The strong point for using transducers in practice is that they offer stack reducing operations in a composable way in which the input list will be visited just once. Take for instance:

(def coll [{:a 1} {:a 2} {:a 3} {:a 4}]) (->> coll (map :a) (filter odd?) (map inc) (reduce + 0))

At each step above a whole list is returned and fed the next computation which iterates through it again and again. With transducers this won't happen, the following snippet of code reads the input collection just once, encoding the transformations in a single action:

(def xf (comp (map :a) (filter odd?) (map inc))) (reduce (xf +) 0 coll)

which in clojure is (almost) the same of the simpler form

(transduce xf + 0 coll)

Later you'll also see the reason for this contravariant behaviour in the order of the function composition which is not the natural right-to-left order.

## Fusion Property and the Composition of Folds

Having shown that many functions on lists can be expressed in terms of fold, when can we actually assert that a composition of folds is expressible in a fold of a single action? One step in this direction is given by the *fusion property*.

Given right $\alpha$-actions $f\colon\beta\rightarrow\alpha\rightarrow\beta$ and $g\colon\beta'\rightarrow\alpha\rightarrow\beta'$we we call a function $\phi:\beta\rightarrow\beta'$a *morphism from f to g *if $\phi(f(b, x)) = g(\phi(b), x)$ holds for every $b\in\beta, x\in\alpha$.

We can prove that $\mathsf{fold}$is stable under the application of morphisms, i.e. given a morphism $\phi$ of actions like the one above, then we have:

To prove the above equality we appeal to the universal property: if we can prove (u1) and (u2) of $\phi\circ\mathsf{fold}_{\,f\,b}$, then the equality above must hold for every list in $[\alpha]$. While it's trivial to see (u1), (u2) follows by combining commutative diagrams:

Now, if we want to compose folds as functions of lists we have to restrict to some specific class of actions. We say that an action on lists $f\colon[\alpha]\times\alpha\rightarrow[\alpha]$ *splits* if there exists some function $f'\colon\alpha\rightarrow\alpha$, such that $\bar{x}\cdot a = \bar{x}\colon f'(a)$for all $a\in\alpha$. Note that the actions defined in the examples above all split (with some formal imagination in the filter case). Given a splitting $\alpha$-action $f$and an action $g$of $\alpha$on $\beta$we define a function of actions $\mathsf{t}_f\colon A_{\beta,\alpha} \rightarrow A_{\beta, \alpha}$defined by

We can now state a *transducing property *for folds of splitting actions in terms of: for every splitting $f$and g we have:

where $l'$is $\mathsf{fold}(g, b, l)$.

To prove the transducer lemma it's enough to show that $\mathsf{fold}_{g\,b}$ is a morphism between the actions $f$and $\mathsf{t}_f(g)$:

Let's apply the lemma above to a simple Clojure case where $g$is $+$and $f$is $\tt{((map\,inc)\,conj)}$, then $f$splits (by definition) and $\mathsf{t}_f(g)$is $\tt{((map\,inc)\, +)}$:

(=' (comp (partial reduce + 0) (partial map inc)) (comp (partial reduce + 0) (partial reduce ((map inc) conj) [])) (partial reduce ((map inc) +) 0))

Now since function composition is associative, repeating the step above we also get for instance

(=' (comp (partial reduce + 0) (partial map inc) (partial filter odd?)) (comp (partial reduce ((map inc) +) 0) (partial reduce ((filter odd?) conj) [])) (partial reduce ((filter odd?) ((map inc) +)) 0) (partial reduce ((comp (filter odd?) (map inc)) +) 0))

which explains the countravariant behaviour in the composition of transducers, with respect to the composition of the non-transduced form.

## Stateful transducers and cat

There's some transducers which escape the pure form of splitting actions as defined above, most notably

(clojure.repl/source cat)

to flatten list outputs on the fly:

(let [coll [{:a [1]} {:a [2]} {:a [3]}] xf (comp (map :a) cat)] (reduce (xf +) 0 coll))

and stateful transducers, like say the 0-ary form of $\tt{distinct}$

(clojure.repl/source distinct)

or the 1-ary form of take-while

(clojure.repl/source take-while)

which uses the reduced trick to short-circuit the fold, allowing for very nice stuff like

(def terms [{:do true :val 1} {:do true :val 2} {:do true :val 2} {:do true :val 1} {:do true :val 3} {:do false :val 4} {:do true :val 5} {:do true :val 6}]) (let [xf (comp (take-while :do) (map :val) (distinct))] (reduce (xf +) 0 terms))

If you'd like to discuss this, find me at @lo_zampino on Twitter. Or remix this article to explore transducers yourself!