NDLI: Knotted list structures

Please wait, while we are loading the content...

The numerical solution of extended initial value problems

Recent numerical experiments comparing successive overrelaxation iterative methods with implicit alternative direction iterative methods

Acm meeting - september 1961 multi-step integration methods which minimize propagated errors

Numerical quadrature of discontinuous functions

The numerical solution of the Reynold's partial differential equation applied to the air lubrication of circularly curved surfaces

Design of a multiprogrammed algebraic compiler

ALTAC, FORTRAN, and compatibility

There's still a place for interpreters

The general problem of computing languages: Their nature, function and translation.

A NELIAC generated 7090-1401 compiler

Automatic formation of a “machine theory” representing a mapping

Forgetting in an association memory

A spatially iterated memory organ patterned after the cerebral cortex

The mechanization of science

On functional iteration and the calculation of roots

A generalized method for finding roots of non-linear equations

A direct method for solving linear algebraic equations

On the Danilewski method for computing the characteristic polynomial

The MITRE corporation

A definition of the cobol procedure division using algol metalinguistics

“Towards a Theory of Recursive Processors”

Knotted list structures

Symbol manipulation with an associative memory

Data retrieval in MOBIDIC B

Design developments in information management through selective dissemination and retrieval systems

An automatic abstracting program employing stylo-statistical techniques and hierarchical data indexing

Discretization and rounding errors in orbit determination

The application of high speed computers to number theory tables

A technique for precise computation with factorials in a digital computer

CHIC: A 7090 program to compute hypergeometric series in two variables

A generalization of Horner's rule for polynomial evaluation

An information Algebra

The foundations of a theory of data processing

Information and transformations on general arrays

A discussion of machine-interpreted macroinstructions

A microinstruction system

Microprogramming

Stored logic computing

STAGE executive control

ACM conference paper the MUSP statistical system

A dynamic programming approach to sequencing problems

ACM conference paper quadratic programming with bounded variable restrictions

The SCEMP project

Input/output generators in mathematical programming

INTOP, an international business game

TABSOL: A decision table language for the GE 225

Loop tracing in PEP-PERT networks

System description for an improved information processing machine

Philco model 212 computer efficiency through simultaneous operations

NCR C-315 electronic data processing system

Nonprocedural data system languages

Summary of paper

Convergence of approximating polynomials

New procedures for rational approximation

Computation of a least maximum approximator as the limit of weighted least squares approximators

Stepwise procedures using both directions

A class of multi-queue problems arising in communication systems

Purchase costs - a cost-quantity analysis

Production control on the disk file

Impact of information retrieval on Corporate Structure

“Systems design and computer evaluation study for a quasi-realtime data processing system in a manufacturing enterprise”

An inquiry into the computer automation of super markets

Multiprogramming the RCA 601

Automation of program debugging

Channel analysis for the IBM 7090

Link Segment System

“Principles and techniques for training programmers”

What training does a customer want? need?

The problem of herterogeneous groups in computer programmer training

“Training the computer operator”

Residue class error checking codes

A class of number representations for parallel arithmetic

The P method, a design philosophy

Automated computer card design

A measurement of alertness based on electroencephalographic time series analysis

Attitude determination for the TIROS satellites

“A new technique for the solution of complex partial differential equations”

Automatic aids to dictionary revision

Knotted list structures

Content Provider	ACM Digital Library
Author	Weizenbaum, J.
Abstract	In (3) Perlis and Thornton describe a list structure language the central innovation of which is that the last word of each list specifies the location of the head of the list of which it is the terminal word. They call such list structures threaded lists. Beyond this, however, they hypothesize Sequencing Tables and associated sequencing modes (e, l, and w). The sequencing modes make possible forms of traversing list structures which leave the lists themselves undisturbed in memory. Since the Sequence Table can contain true names as well as aliases for particular list structures and since lists are undisturbed by sequencing, many programs may sequence through lists in different manners, at various rates, but still simultaneously. This partially mitigates against the need to store many copies of a list and becomes critical in multiple computer systems in which it may be expected that a number of sub-programs operate on a single list structure (under various aliases) independently. This note describes a generalization of the threaded list. The name given to such generalized threaded list structures is knotted list structures (KLS). The generalization consists essentially of replacing the thread link which Perlis and Thornton place in the R or link position of the last list cell of a list (or sub-list with a Control List (CL) which is attached to the list structure and which contains, among other information, a push down list capable of storing many thread links. The chief advantage of this scheme is that it permits a sub-list to be a sub-list of many lists, something which ordinary threaded lists do not permit. All other advantages of threaded lists are kept.
File Format	PDF
DOI	10.1145/800029.808513
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1961-01-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in