COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Today is the first day of the rest of your lossage.
C00004 ENDMK
C⊗;
Today is the first day of the rest of your lossage.
			TGQ
BIBOP is a flavor of MACLISP with the ability to dynamically
re-allocate various spaces, including LIST, FIXNUM, FLONUM,
ARRAY, & HUNK. Spaces which must be accurately allocated at
the outset are: BPS, REPDL, SPECPDL, FIXPDL, & FLOPDL. At
allocation time you can type ? and get a rundown of what to do.

BIBOP is dynamic in that re-allocation is automatic according to
need. The version currently running at SAIL can be run by saying:
R BIBOP
This version is not guaranteed to be free of bugs, but its use
is encouraged. As of October 5, 1976 no new versions of
non-BIBOP MACLISP will be offered (i.e. no versions higher than
1202).
HUNKs are a feature (?) of BIBOP which provides an efficiency
bridge between small arrays and large lists. That is, for
"hunks" of data between 4 and 16 "things" long, neither lists
nor arrays are as efficient as they could be in terms of a space-time 
product. HUNKs bridge the gap in providing a list/array-like
piece of storage of size 4, 8, or 16. But for the real story read
about them in LISP.NEW[AID,RPG] and about the controversy at MIT
in HUNK.TLK[AID,RPG].
Good luck.