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 9 Issue 3, July 1987

IDL: sharing intermediate representations
David Alex Lamb
Pages: 297-318
DOI: 10.1145/24039.24040
IDL (Interface Description Language) is a practical and useful tool for controlling the exchange of structured data between different components of a large system. IDL is a notation for describing collections of programs and the data structures...

The program dependence graph and its use in optimization
Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren
Pages: 319-349
DOI: 10.1145/24039.24041
In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependences for each operation in a program. Data...

The multiway rendezvous
Arthur Charlesworth
Pages: 350-366
DOI: 10.1145/24039.24050
The multiway rendezvous is a natural generalization of the rendezvous in which more than two processes may participate. The utility of the multiway rendezvous is illustrated by solutions to a variety of problems. To make their...

Data descriptors: a compile-time model of data and addressing
R. C. Holt
Pages: 367-389
DOI: 10.1145/24039.24051
Data descriptors, which have evolved from Wilcox's value descriptors [16], are a notation for representing run-time data objects at compile time. One of the principal reasons for developing this notation was to aid in the rapid construction of...

An axiomatic treatment of exception handling in an expression-oriented language
Shaula Yemini, Daniel M. Berry
Pages: 390-407
DOI: 10.1145/24039.24052
An axiomatic semantic definition is given of the replacement model of exception handling in an expression-oriented language. These semantics require only two new proof rules for the most general case. An example is given of a program fragment...

Sublinear-space evaluation algorithms for attribute grammars
Thomas Reps, Alan Demers
Pages: 408-440
DOI: 10.1145/24039.214529
A major drawback of attribute-grammar-based systems is that they are profligate consumers of storage. This paper concerns new storage-management techniques that reduce the number of attribute values retained at any stage of attribute evaluation;...

A methodology for synthesis of recursive functional programs
Debasish Banerjee
Pages: 441-462
DOI: 10.1145/24039.24071
John Backus introduced the Functional Programming (FP) system, the variable-free applicative system having reduction semantics. Backus has also introduced a unique expansion technique for reasoning about a class of recursive FP programs. As a...