Proper lists

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

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

Construction of the list structure which we here call x
- (cons e f)
Selection:
- (car x) => e
- (cdr x) => f

A proper list is always terminated by the empty list

A Proper List Predicate