... Drakos¹

http://www-dsed.llnl.gov/files/programs/unix/latex2html/manual/

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... Sol^1.1

Sol stands for Set Operations Language. Sol should not be confused with SETL (SET Language), an earlier set-theory inspired programming language.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... sets^1.2

The term ``set'' has very strict mathematical requirements (it is difficult to prove that something is really a set) so formally speaking we should refer to Sol sets as classes. However, the term ``class'' has another conventional meaning when discussing programming languages. To avoid confusion, I will use the term set to refer to the mathematical entity class and class in the object-oriented programming sense of class.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... constructs^1.3

Scheme is intended as the starting point, not a subset of the language. In the future Sol may be implemented as a stand-alone compiler or interpreter, in which case R⁴ compatibility may be sacrificed for the sake of clarity and efficiency.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... set^1.4

The current implementation of Sol does not perform this type of simplification automatically, so the set resulting from this statement may be considered a derived set.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... records^1.5

For instance, referencing member functions ofen requires two pointer derefernces: the first to get the location of the object and another to locate the function using the object's function table.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... function^2.1

Should make-initialized-vector really be defined here? I think this is defined in MIT scheme, if not in R4RS. Fri Jun 12 20:50:09 CDT 1998

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... scheme^2.2

As of this writing, Fri Jun 12 20:56:27 CDT 1998, the new scheme has not yet been implemented.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.