SNOBOL , A String Manipulation Language
Journal of the ACM (JACM)
Communications of the ACM
LISP 1.5 Programmer's Manual
Shadowed management of free disk pages with a linked list
ACM Transactions on Database Systems (TODS)
A Survey of Data Structures for Computer Graphics Systems
ACM Computing Surveys (CSUR)
A class of dynamic memory allocation algorithms
Communications of the ACM
A efficient bit table technique for dynamic storage allocation of 2"-word blocks
Communications of the ACM
Toward an understanding of data structures
Communications of the ACM
The list set generator: a construct for evaluating set expressions
Communications of the ACM
An ALGOL-based associative language
Communications of the ACM
Fast Allocation and Deallocation with an Improved Buddy System
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Compound data structure for computer aided design; a survey
ACM '67 Proceedings of the 1967 22nd national conference
PIRL—Pattern Information Retrieval Language—design of syntax
ACM '71 Proceedings of the 1971 26th annual conference
A compiler language for data structures
ACM '68 Proceedings of the 1968 23rd ACM national conference
Simulation of an individual making decisions under uncertainty
WSC '73 Proceedings of the 6th conference on Winter simulation
Data and storage structures for interactive graphics
ACM SIGPLAN Notices
Data structures for computer graphics
ACM SIGPLAN Notices
Nucleol - a minimal list processor
ACM SIGSAM Bulletin
A Two-Level Microprogrammed Multiprocessor Computer with Nonnumeric Functions
IEEE Transactions on Computers
The people problem: computers can help
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
SPRINT: a direct approach to list processing languages
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
LISTAR: Lincoln Information Storage and Associative Retrieval system
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
Analysis of free-storage algorithms: revisited
IBM Systems Journal
Toward an understanding of data structures
SIGFIDET '70 Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
| Hi-index | 48.30 |
Bell Telephone Laboratories' Low-Level Linked List Language L6 (pronounced “L-six”) is a new programming language for list structure manipulations. It contains many of the facilities which underlie such list processors as IPL, LISP, COMIT and SNOBOL, but permits the user to get much closer to machine code in order to write faster-running programs, to use storage more efficiently and to build a wider variety of linked data structures.