ACM

A. Nozaki
Page 571

On reducing truncation errors by programming

George R. Schubert
Page 571

MIRFAC: a reply to Professor Dijkstra

H. J. Gawlik
Page 571

Copyright aspects of computer usage

This paper is concerned with the question of what constitutes infringement of a copyright on a book or other nondramatic literary work when the work is fed into a computer and is indexed, analyzed, partially reprinted, or otherwise … Reed C. Lawlor
Pages 572-578

Computer patent disclosures

Suppose a potentially very valuable experimental multi-computer system is being designed by you and your group. You feel you have made at least a system invention. In your Company scientists and engineers are responsible for … Joseph P. Kates
Pages 578-579

Joint inventorship of computers

The term joint inventorship asks but does not necessarily answer the question, “Who is the true inventor of a computer?” I will try to show how “wrong” inventors are joined, how such improper joinder can be avoided, and its dangers … Gunter A. Hauptman
Pages 579-580

Computer programs are patentable

It is not surprising that computer programs are not listed in the patent statutes as one of the categories of patentable invention. When these categories were defined many years ago, computers and computer programs were unknown … Kenneth B. Hamlin
Pages 581-582

Patent protection of computer programs

Recently, the computer industry has been exploring anew the question of whether programs for operating an electronic digital computer are or should be patentable. Morton C. Jacobs
Pages 583-584

Algorithm 242: Permutations of a set with repetitions

T. W. Sag
Page 585

Certification of algorithm 203: Steep1

Philip Wallack
Page 585

Certification of algorithm 218: Kutta Merson

Karen Boreman Priebe
Pages 585-586

Certification of Algorithm 207: Stringsort

Charles R. Blair
Page 585

Certification of algorithm 221: Gamma function

Van K. McCombs
Page 586

Certification algorithm 225: Gamma function with controlled accuracy

T. A. Bray
Page 586

Constraint-type statements in programming languages

A proposal is made for including in a programming language statements which imply relations between variables but which are not explicit assignment statements. The compiler sets up a Newtonian iteration making use for the purpose … M. V. Wilkes
Pages 587-588

A method of syntax specification

The addition of a few simple conventions to the Backus Normal Form specification of a language provides a mode of description which is more compact and easier to prepare and use than either the standard BNF description [1] or … Kenneth E. Iverson
Pages 588-589

History and summary of FORTRAN standardization development for the ASA

The American Standards Association (ASA) Sectional Committee X3 for Computers and Information Processing was established in 1960 under the sponsorship of the Business Equipment Manufacturers Association. ASA X 3 in turn established … W. P. Heising
Page 590

FORTRAN vs. Basic FORTRAN: a programming language for informational processing on automatic data processing systems

Pages 591-624

Proposed Amendment to Proposed American Standard on Specification for General-Purpose Paper Cards for Information Processing

Page 625

Communications of the ACM

Table of Contents

More on integer conversion