\[ \newcommand{\tr}{\Rightarrow} \newcommand{\trs}{\tr^{\!\ast}} \newcommand{\rlnm}[1]{\mathsf{(#1)}} \newcommand{\rred}[1]{\xrightarrow{#1}} \newcommand{\rreds}[1]{\mathrel{\xrightarrow{#1}\!\!^*}} \newcommand{\cl}{\mathsf{Cl}} \newcommand{\pow}{\mathcal{P}} \newcommand{\matches}{\mathrel{\mathsf{matches}}} \newcommand{\kw}[1]{\mathsf{#1}} \]

Right association example

\[\begin{array}{l|l} \text{when we write...} & \text{we mean the tree...} \\\hline \text{map :: (a -> b) -> [a] -> [b]} & \text{map :: (a -> b) -> ([a] -> [b]) }\\ \text{min :: Int -> Int -> Int} & \text{min :: Int -> (Int -> Int)}\\ \text{compose :: (a -> b) -> (b -> c) -> a -> c} & \text{compose :: (a -> b) -> ((b -> c) -> (a -> c))} \end{array}\]