A short note concerning lazy reduction rules for append

We show that informing a lazy evaluator that the APPEND operator is associative reduces the overall worst case performance from O(n2) to O(n).