Command line options from invocation.

Append the the elements of y to the elements of x.

All args are assumed to be beowulf.cons-cell/ConsCell objects. See page 11 of the Lisp 1.5 Programmers Manual.

For bootstrapping, at least, a version of APPLY written in Clojure. All args are assumed to be symbols or beowulf.cons-cell/ConsCell objects. See page 13 of the Lisp 1.5 Programmers Manual.

If a is an association list such as the one formed by PAIRLIS in the above example, then assoc will produce the first pair whose first term is x. Thus it is a table searching function.

All args are assumed to be beowulf.cons-cell/ConsCell objects. See page 12 of the Lisp 1.5 Programmers Manual.

Returns T if and only is the argument x is bound to and atom; else F. It is not clear to me from the documentation whether (ATOM 7) should return T or F. I’m going to assume T.

The convention of returning F from predicates, rather than NIL, is going to tie me in knots. This is a variant of ATOM which returns NIL on failure.

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

Return the item indicated by the first pointer of a pair. NIL is treated specially: the CAR of NIL is NIL.

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

TODO: write docs

Return the item indicated by the second pointer of a pair. NIL is treated specially: the CDR of NIL is NIL.

Returns T if and only if both x and y are bound to the same atom, else F.

This is a predicate that is true if its two arguments are identical S-expressions, and false if they are different. (The elementary predicate EQ is defined only for atomic arguments.) The definition of EQUAL is an example of a conditional expression inside a conditional expression.

NOTE: returns F on failure, not NIL

For bootstrapping, at least, a version of EVAL written in Clojure. All args are assumed to be symbols or beowulf.cons-cell/ConsCell objects. See page 13 of the Lisp 1.5 Programmers Manual.

This predicate is true if the S-expression x occurs among the elements of the list y.

All args are assumed to be symbols or beowulf.cons-cell/ConsCell objects. See page 11 of the Lisp 1.5 Programmers Manual.

Returns T if and only if the argument x is bound to NIL; else F.

The default environment.

This function gives the list of pairs of corresponding elements of the lists x and y, and APPENDs this to the list a. The resultant list of pairs, which is like a table with two columns, is called an association list.

Eessentially, it builds the environment on the stack, implementing shallow binding.

All args are assumed to be beowulf.cons-cell/ConsCell objects. See page 12 of the Lisp 1.5 Programmers Manual.

Here a is assumed to be an association list of the form ((ul . vl)...(un . vn)), where the us are atomic, and y is any S-expression. What SUBLIS does, is to treat the us as variables when they occur in y, and to SUBSTitute the corresponding vs from the pair list.

My interpretation is that this is variable binding in the stack frame.

All args are assumed to be beowulf.cons-cell/ConsCell objects. See page 12 of the Lisp 1.5 Programmers Manual.

This function gives the result of substituting the S-expression x for all occurrences of the atomic symbol y in the S-expression z.

Essentially, identical to EVAL except traced.

Universal access function; l is expected to be an arbitrary list, path a (clojure) list of the characters a and d. Intended to make declaring all those fiddly #'c[ad]+r' functions a bit easier