Programming Languages and Systems (TOPLAS)


Search Issue
enter search term and/or author name


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 13 Issue 1, Jan. 1991

Linking programs incrementally
Russell W. Quong, Mark A. Linton
Pages: 1-20
DOI: 10.1145/114005.102804
Linking is traditionally a batch process that resolves cross-references between object modules and run-time libraries to produce a stand-alone executable image. Because most program changes only involve a small part of the program, we have...

Compilation of functional languages by program transformation
Pascal Fradet, Daniel Le Métayer
Pages: 21-51
DOI: 10.1145/114005.102805
One of the most important issues concerning functional languages is the efficiency and the correctness of their implementation. We focus on sequential implementations for conventional von Neumann computers. The compilation process is described...

Automatic transformation of series expressions into loops
Richard C. Waters
Pages: 52-98
DOI: 10.1145/114005.102806
The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on sequences/vectors/streams of data elements are easier to understand and modify than...

The concurrent language, Shared Prolog
Antonio Brogi, Paolo Ciancarini
Pages: 99-123
DOI: 10.1145/114005.102807
Shared Prolog is a new concurrent logic language. A Shared Prolog system is composed of a set of parallel agents that are Prolog programs extended by a guard mechanism. The programmer controls the granularity of parallelism, coordinating...

Wait-free synchronization
Maurice Herlihy
Pages: 124-149
DOI: 10.1145/114005.102808
A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of...

Efficient construction of LR(k) states and tables
M. Anicona, G. Dodero, V. Gianuzzi, M. Morgavi
Pages: 150-178
DOI: 10.1145/114005.102809
A new method for building LR(k) states and parsing tables is presented. The method aims at giving a feasible construction of a collection of LR(k) parsing tables, especially when k > 1. for...