n. (of a list)
an object that is the same as either some cons
which makes up that list or the atom (if any) which terminates
the list.
The empty list is a tail of every proper list.
n. a rational multiple of 1/3600 between -24 (inclusive)
and 24 (inclusive) that represents a time zone as a number of hours
offset from Greenwich Mean Time. Time zone values increase with motion to the west,
so Massachusetts, U.S.A. is in time zone 5,
California, U.S.A. is time zone 8,
and Moscow, Russia is time zone -3.
(When "daylight savings time" is separately represented
as an argument or return value, the time zone
that accompanies it does not depend on whether daylight savings time
is in effect.)
n.
1. a binary recursive data structure made up of conses and
atoms: the conses are themselves also trees
(sometimes called "subtrees" or "branches"), and the atoms
are terminal nodes (sometimes called leaves). Typically,
the leaves represent data while the branches establish some
relationship among that data.
2. in general, any recursive data structure that has some notion of
"branches" and leaves.
n.
1. a set of objects, usually with common structure, behavior, or purpose.
(Note that the expression "X is of type Sa"
naturally implies that "X is of type Sb" if
Sa is a subtype of Sb.)
2. (immediately following the name of a type)
a subtype of that type.
The type vector is an array type.
n. to fully expand a type specifier, removing any references to
derived types. (Common Lisp provides no program interface to cause
this to occur, but the semantics of Common Lisp are such that every
implementation must be able to do this internally, and some
situations involving type specifiers are most easily described
in terms of a fully expanded type specifier.)
n.
an expression that denotes a type.
The symbol random-state, the list (integer 3 5),
the list (and list (not null)), and the class named
standard-class are type specifiers.