| Summary: | A brief survey of list-processing languages and list-processors is made, pointing out the shortcomings of each. The need for a practical, applications-oriented list-processor, along with a list of features that would be required, is then presented. A list-processor that is designed to fulfil these requirements is proposed. The presentation includes a detailed description of the storage structure and management algorithms, the primitive routines that have been defined, plus the routines and features available for dynamic storage allocation and list-processing. Finally, a comparison between the proposed list-processor and two available list-processors, SLIP and DYSTAL, is carried out. === Science, Faculty of === Computer Science, Department of === Graduate
|
|---|
