July 1970 - Vol. 13 No. 7
Features
An interactive command generating facility
A facility to permit conversationally controlled tasks to be executed in a noninteractive environment is proposed. A means by which programs can generate interactive…
Conversational access to a 2048-word machine
LAP6 is an on-line system running on a 2048-word LINC which provides full facilities for text editing, automatic filing and file maintenance, and program preparation and…
The mobile programming system: STAGE2
STAGE2 is the second level of a bootstrap sequence which is easily implemented on any computer. It is a flexible, powerful macro processor designed specifically as a tool…
Space/time trade-offs in hash coding with allowable errors
In this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages…
File structures using hashing functions
A general method of file structuring is proposed which uses a hashing function to define tree structure. Two types of such trees are examined, and their relation to trees…
Algorithm and bound for the greatest common divisor of n integers
A new version of the Euclidean algorithm for finding the greatest common divisor of n integers ai and multipliers xi such that gcd = x1 a1 + ··· + xn…
This paper presents a canonical form for context-sensitive derivations and a parsing algorithm which finds each context-sensitive analysis once and only once. The amount…
We have read with much interest the paper “Automatic Segmentation of Cyclic Program Structures Based on Connectivity and Processor Timing” by T. C. Lowe…
In “Synchronization in a Parallel-Accessed Data Base” [Comm. ACM 12, 11 (Nov. 1969), 604-607] A. Shoshani and A. J. Bernstein have given a very lucid…
In [1] the authors use a lemma to prove their Theorem 1 (pp. 352-353). While the lemma is true, there is a defect in its proof, for one cannot assume that each of the…
A comment on axiomatic approaches to programming
Reference is made to the paper by C. A. R. Hoare [1] which discusses the fundamentals of an axiomatic approach to computer programming. One advantage for an axiomatic…