Bernard A. Galler
Page 487
The author feels that the interrupt feature which is available in most modern computers is a potent source of programming pitfalls and errors, and that it therefore may heavily contribute to the unreliability of programs making …
Niklaus Wirth
Pages 489-498
Compact lists are stored sequentially in memory, rather than chained with pointers. Since this is not always convenient, the Swym system permits a list to be chained, compact, or any combination of the two. A description is given …
Wilfred J. Hansen
Pages 499-507
An algorithm for a macro processor which has been used as the base of an implementation, by bootstrapping, of processors for programming languages is described. This algorithm can be easily implemented on contemporary computing …
Richard J. Orgass, William M. Waite
Pages 507-510
M. Douglas McIlroy
Page 511
I. M. Leitch
Page 512
P. A. Hamilton, J. Boothroyd
Pages 512-513
A fast method is presented for finding a fundamental set of cycles for an undirected finite graph. A spanning tree is grown and the vertices examined in turn, unexamined vertices being stored in a pushdown list to await examination …
Keith Paton
Pages 514-518
The following resolutions were passed at the ASA X3.4 Common Programming Languages Subcommittee during the thirty-third meeting held February 20, 1964 at CEIR, Beverly Hills, California.
David L. Parnas
Pages 519-531
