acm-header
Sign In

Communications of the ACM

Table of Contents


A description of the APT language

The APT (Automatically Programmed Tools) language for numerical control programming is described using the metalinguistic notation introduced in the ALGOL 60 report. Examples of APT usage are included. Presented also are an historical …

USA participation in an international standard glossary on information processing

A considerable number of glossaries in the area of information processing have been produced in the USA in the last ten years [1, 2]. In some cases the glossaries were reworked versions of earlier glossaries, while in other cases …

Report of a visit to discuss common programming languages in Czechoslavakia and Poland, 1963

Early in June 1963 there was a meeting in Berlin [1] of the Subcommittee for Programming Languages, SC5 of TC97, the Technical Committee for Standardization of Computers and Information Processing [2]. Taking advantage of the …

Algorithm 214: q-Bessel functions In(t)


Algorith 215: Shanks


Certification of algorithm 8: Euler summation


Remark on algorithm 77: interpolation, differentiation, and integration


Algorithm 216: SMOOTH


A serial technique to determine minimum paths

The need to determine minimum paths through a maze very often arises in such fields as traffic, transportation, communication and network studies. Computer analysis of these maze problems has been hampered in many cases due to …

Recursive programming in Fortran II

An oft-mentioned advantage of ALGOL over FORTRAN is the recursion capability of the former. FORTRAN adherents often belittle this advantage by claiming that all recursive relations can be reduced to recurrence or iterative relations …

Flexible abbreviation of words in a computer language

An increasing number of computer programs are designed to accept and translate a symbolic, English-like language which facilitates communication between the user and the computer. A common feature of such programs is a pre-determined …

An error-correcting parse algorithm

During the past few years, research into so-called “Syntax Directed Compiler” and “Compiler Compiler” techniques [1, 2, 3, 4, 5, 6] has given hope that constructing computer programs for translating formal languages may not be …

Recent improvements in MADCAP

MADCAP is a programming language admitting subscripts, superscripts and certain forms of displayed formulas. The basic implementation of this language was described in a previous paper [MADCAP: A scientific compiler for a displayed …

Optimizing bit-time computer simulation

A major component of a bit-time computer simulation program is the Boolean compiler. The compiler accepts the Boolean functions representing the simulated computer's digital circuits, and generates corresponding sets of machine …

Length of strings for a merge sort

Detailed statistics are given on the length of maximal sorted strings which result from the first (internal sort) phase of a merge sort onto tapes. It is shown that the strings produced by an alternating method (i.e. one which …

On the computation of a certain type of incomplete Beta functions


Coding clinical laboratory data for automatic storage and retrieval

A series of clinical laboratory codes have been developed to accept and store urinalysis, blood chemistry, and hematology test results for automatic data processing. The codes, although constructed as part of a computerized hospital …

Application of IBM 1620 EDP methods to the calculation of the formulation constants of complex ions

In the course of our work on the physical chemistry of histamine and related compounds, we have done extensive work involving potentiometric titration of systems of chelates of these ligands with various metallic ions, negative …