The introduction of a paging technique into the symmetric list processor, SLIP

ABSTRACT

When the computing community turned its attention back to the problem of "pure" symbol manipulation, a large and ever-growing family of "list-processing" ("LP") computer languages resulted. SLIP, which is one of these, was primarily written in FORTRAN, making it easy to use, understand and debug. The widespread use of SLIP, however, has been severely hampered by the restriction of available space in the system. Guided by the desire for more available space, we imposed upon our study the conditions that as few changes as possible should be made to the SLIP system, and additions to the system should be automatic functions of the system and not of the user. This report shows how a paging technique incorporated into the SLIP system accomplished our goal.

REFERENCES

• 1: Daniel G. Bobrow , Bertram Raphael, A comparison of list-processing computer languages: including a detailed comparison of COMIT, IPL-V, LISP 1.5, and SLIP, Communications of the ACM, v.7 n.4, p.231-240, April 1964 [doi>10.1145/364005.364057]
• 2: J. Weizenbaum, Symmetric list processor, Communications of the ACM, v.6 n.9, p.524-536, Sept. 1963 [doi>10.1145/367593.367617]
• 3: Arnold Lapidus , Max Goldstein, Some experiments in algebraic manipulation by computer, Communications of the ACM, v.8 n.8, p.501-508, Aug. 1965 [doi>10.1145/365474.365515]
• 4: Atkinson, G. W., <u>SLIP Preliminary Instructional Manual</u>, Technical Documentary Report no. AFWL TDR-64-98, August 1964.