A list is a sequence of zero or more objects, the main difference between lists and vectors is that lists are more dynamic: they can change size, be split, reversed, concatenated, etc… very easily.
In Lisp lists are not a primitive type; instead singly-linked lists are
formed by chaining cons cells together (see Cons Cells). The empty
list is represented by the special value
This functions returns true when its argument, arg, is a
list (i.e. either a cons cell or
Returns a true value if arg is the empty list.
|• List Structure:||How lists are built from cons cells|
|• Building Lists:||Dynamically creating lists|
|• Accessing List Elements:||Getting at the elements which make the list|
|• Modifying Lists:||How to alter the contents of a list|
|• Association Lists:||Lists can represent relations|
|• Infinite Lists:||Circular data structures in Lisp|