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) - Lecture notes in computer science Vol. 174, Volume 7 Issue 2, April 1985

Towards monolingual programming environments
Jan Heering, Paul Klint
Pages: 183-213
DOI: 10.1145/3318.3321
Most programming environments are much too complex. One way of simplifying them is to reduce the number of mode-dependent languages the user has to be familiar with. As a first step towards this end, the feasibility of unified...

A modular verifiable exception handling mechanism
Shaula Yemini, Daniel M. Berry
Pages: 214-243
DOI: 10.1145/3318.3320
This paper presents a new model for exception handling, called the replacement model. The replacement model, in contrast to other exception-handling proposals, supports all the handler responses of resumption, termination, retry, and exception...

Implementation of resilient, atomic data types
William Weihl, Barbara Liskov
Pages: 244-269
DOI: 10.1145/3318.3319
A major issue in many applications is how to preserve the consistency of data in the presence of concurrency and hardware failures. We suggest addressing this problem by implementing applications in terms of abstract data types with two...

CIRCAL and the representation of communication, concurrency, and time
George J. Milne
Pages: 270-298
DOI: 10.1145/3318.3322
The CIRCAL calculus is presented as a mathematical framework in which to describe and analyze concurrent systems, whether hardware or software. The dot operator is used to compose CIRCAL descriptions, and it is this...

Detecting global variables in denotational specifications
David A. Schmidt
Pages: 299-310
DOI: 10.1145/3318.3323
Sufficient criteria are given for replacing all occurrences of the store argument in a Scott-Strachey denotational definition of a programming language by a single global variable. The criteria and transformation are useful for transforming...

Efficient demand-driven evaluation. Part 1
Keshav Pingali, Arvind
Pages: 311-333
DOI: 10.1145/3318.3480
We describe a program transformation technique for programs in a general stream language L whereby a data-driven evaluation of the transformed program performs exactly the same computation as a demand-driven evaluation of the original program....

Dealing with world-model-based programs
Giuseppina C. Gini, M. L. Gini
Pages: 334-347
DOI: 10.1145/3318.3479
We introduce POINTY, an interactive system for constructing world-model-based programs for robots. POINTY combines an interactive programming environment with the teaching-by-guiding methodology that has been successful in industrial robotics....

Optimal parallel generation of a computation tree form
Ilan Bar-on, Uzi Vishkin
Pages: 348-357
DOI: 10.1145/3318.3478
Given a general arithmetic expression, we find a computation binary tree representation in O(log n) time using n/log n processors on a concurrent-read, exclusive-write, parallel...