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 10 Issue 4, Oct. 1988

Distributed cooperation with action systems
R. J. R. Back, F. Kurki-Suonio
Pages: 513-554
DOI: 10.1145/48022.48023
Action systems provide a method to program distributed systems that emphasizes the overall behavior of the system. System behavior is described in terms of the possible interactions (actions) that the processes can engage in, rather than in...

Analysis of functional programs to detect run-time garbage cells
Katsuro Inoue, Hiroyuki Seki, Hikaru Yagi
Pages: 555-578
DOI: 10.1145/48022.48025
We propose a method for detecting the generation of garbage cells by analyzing a source text written in a functional programming language which uses ordinary linked lists to implement list-type values. For a subexpression such as...

Efficient synchronization of multiprocessors with shared memory
Clyde P. Kruskal, Larry Rudolph, Marc Snir
Pages: 579-601
DOI: 10.1145/48022.48024
A new formalism is given for read-modify-write (RMW) synchronization operations. This formalism is used to extend the memory reference combining mechanism introduced in the NYU Ultracomputer, to arbitrary RMW operations. A formal correctness...

Director strings as combinators
Richard Kennaway, Ronan Sleep
Pages: 602-626
DOI: 10.1145/48022.48026
A simple calculus (the Director String Calculus-DSC) for expressing abstractions is introduced, which captures the essence of the “long reach” combinators introduced by Turner. We present abstraction rules that preserve the...

Smarter recompilation
Robert W. Schwanke, Gail E. Kaiser
Pages: 627-632
DOI: 10.1145/48022.214505
Tichy's Smart Recompilation method can be made smarter by permitting benign type inconsistencies between separately compiled modules. This enhanced method helps the programmer to make far-reaching changes in small, manageable...

Tichy's response to R. W. Schwanke and G. E. Kaiser's “Smarter Recompilation”
W. Tichy
Pages: 633-634
DOI: 10.1145/48022.214507
Schwanke and Kaiser's extension of smart recompilation is an intriguing idea. Their mechanism aims at delaying recompilation work by permitting “harmless” compilation inconsistencies to remain after changes. Full consistency can be...

A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
Karl-Heinz Drechsler, Manfred P. Stadel
Pages: 635-640
DOI: 10.1145/48022.214509
Morel and Renvoise have previously described a method for global optimization and code motion by suppression of partial redundancies [l]. Morel and Renvoise use data flow analysis to determine expression computations that should be inserted at...