This is a sub-release of SDML 3.0 (click on "3.0" in the release
browser for details of new features in this release).

This sub-release contains most of the features of 2.6, except for:

	a) symbol searching

The main changes from the last sub-release (3.0e) are in the way
random and arbitrary choices are dealt with. The new primitives have
four arguments: the resulting choice, a term to be instantiated with
possible choices (when a subclause is evaluated), a uniquifying term,
and finally the subclause to specify the possible choices. The main
reason for changing these primitives was to enable them to be used in
set-up and clear-up rulebases.

There are also some small changes in the way virtual memory works.