ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 2 Issue 4, Oct. 1980

Prettyprinting
Dereck C. Oppen
Pages: 465-483
DOI: 10.1145/357114.357115
An algorithm for prettyprinting is given. For an input stream of length n and an output device with linewidth m, the algorithm requires time O(n) and space...

Ultracomputers
Jacob T. Schwartz
Pages: 484-521
DOI: 10.1145/357114.357116
A class of parallel processors potentially involving thousands of individual processing elements is described. The architecture is based on the perfect shuffle connection and has two favorable characteristics: (1) Each processor communicates...

Specification of Abstract Data Types in Modula
George W. Ernst, William F. Ogden
Pages: 522-543
DOI: 10.1145/357114.357117
The programming language MODULA is extended to permit the formal specification of the structure and functional capabilities of modules. This makes true hierarchical programming possible in MODULA by allowing programmers of higher level parts of...

An Abstract Type for Statistics Collection in Simula
Carl E. Landwehr
Pages: 544-563
DOI: 10.1145/357114.357118
Although the use of abstract types has been widely advocated as a specification and implementation technique, their use has often been associated with programming languages that are not widely available, and examples published to date are rarely...

Assignment and Procedure Call Proof Rules
David Gries, Gary Levin
Pages: 564-579
DOI: 10.1145/357114.357119
The multiple assignment statement is defined in full generality—including assignment to subscripted variables and record fields—using the “axiomatic” approach of Hoare. Proof rules are developed for calls of procedures...

The Activity of a Variable and Its Relation to Decision Trees
B. E. Moret, M. Thomason, R. C. Gonzalez
Pages: 580-595
DOI: 10.1145/357114.357120
The construction of sequential testing procedures from functions of discrete arguments is a common problem in switching theory, software engineering, pattern recognition, and management. The concept of the activity of an argument is introduced,...