Guile Reference Manual: Lists

Warning: This is the manual of the legacy Guile 2.0 series. You may want to read the manual of the current stable series instead.

Next: Vectors, Previous: Pairs, Up: Compound Data Types [Contents][Index]

6.7.2 Lists

A very important data type in Scheme—as well as in all other Lisp dialects—is the data type list.⁹

This is the short definition of what a list is:

Either the empty list (),
or a pair which has a list in its cdr.

• List Syntax: Writing literal lists.

• List Predicates: Testing lists.

• List Constructors: Creating new lists.

• List Selection: Selecting from lists, getting their length.

• Append/Reverse: Appending and reversing lists.

• List Modification: Modifying existing lists.

• List Searching: Searching for list elements

• List Mapping: Applying procedures to lists.

Footnotes

(9)

Strictly speaking, Scheme does not have a real datatype list. Lists are made up of chained pairs, and only exist by definition—a list is a chain of pairs which looks like a list.