Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Functional programming, design and analysis of algorithms / 2 / d

Set both $\oplus$ and $\otimes$ equal to list concatenation, with $a=[]$. Associativity gives xs ++ (ys ++ zs) = (xs ++ ys) ++ zs, which is equation (1). The two identity laws give xs ++ [] = [] ++ xs, which is equation (2). Part (b) therefore yields

concat :: [[a]] -> [a]
concat = foldl (++) []

Thus $\boxed{\mathrm{concat}=\mathrm{foldl}(++)[]}$ on finite lists. The argument order is unchanged: the accumulator is the already concatenated prefix, and the next inner list is appended to its right. This preserves the order but repeatedly copies that prefix.