Lecture overview -- Keyboard shortcut: 'u'  Previous page: Lists [Section] -- Keyboard shortcut: 'p'  Next page: Symbolic expressions and improper lists -- Keyboard shortcut: 'n'  Lecture notes - all slides together  Annotated slide -- Keyboard shortcut: 't'  Alphabetic index  Help page about these notes  Course home    Introduction to Functional Programming in Scheme - slide 12 : 49

Proper lists

A list is recursively composed of a head and a tail, which is a (possibly empty) list itself

The building blocks of lists are the cons cells

Every such cell is allocated by an activation of the cons function

To see this image you must download and install the SVG plugin from Adobe.In Firefox please consultthis page.
A proper list is always terminated by the empty list
Go to exercise
A Proper List Predicate