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'  Textbook -- Keyboard shortcut: 'v'  Help page about these notes  Alphabetic index  Course home    Lecture 4 - Page 15 : 34
Functional Programming in Scheme
Higher-order Functions

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.