Lecture overview -- Keyboard shortcut: 'u'  Previous page: Reduction and Zipping [Section] -- Keyboard shortcut: 'p'  Next page: The reduction functions -- Keyboard shortcut: 'n'  Lecture notes - all slides and notes together  slide -- Keyboard shortcut: 't'  Help page about these notes  Alphabetic index  Course home  Lecture 2 - Page 27 : 35
Programming Paradigms
Recursion and Higher-order Functions
Reduction

Reduction of a list by means of a binary operator transforms the list to a value in the range of the binary operator.

Left and right reduction of a list. Left reduction is - quite naturally - shown to the left, and right reduction to the right.

There is no natural value for reduction of the empty list.

Therefore we assume as a precondition that the list is non-empty.