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

MULTILISP: a language for concurrent symbolic computation
Robert H. Halstead, Jr.
Pages: 501-538
DOI: 10.1145/4472.4478
Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for...

Procedures as persistent data objects
Malcolm P. Atkinson, Ronald Morrison
Pages: 539-559
DOI: 10.1145/4472.4477
A persistent programming environment, together with a language that supports first class procedures, may be used to provide the semantic features of other object modeling languages. In particular, the two concepts may be combined to implement...

Affix grammar driven code generation
Mahadevan Ganapathi, Charles N. Fischer
Pages: 560-599
DOI: 10.1145/4472.4486
Affix grammars are used to describe the instruction set of a target architecture for purposes of compiler code generation. A code generator is obtained automatically for a compiler using attributed parsing techniques. A compiler built on this...

Editing by example
Robert P. Nix
Pages: 600-621
DOI: 10.1145/4472.4476
An editing by example system is an automatic program synthesis facility embedded in a text editor that can be used to solve repetitive text editing problems. The user provides the editor with a few examples of a text transformation. The system...

Symmetric intertask communication
Nissim Francez, Shaula A. Yemini
Pages: 622-636
DOI: 10.1145/4472.4475
We argue for the need of supporting a symmetric select construct, in which entry calls as well as accepts can be alternatives. We present several situations in which a symmetric select leads to a more natural programming style. We show that...

Side effects and aliasing can have simple axiomatic descriptions
Hans-Juergen Boehm
Pages: 637-655
DOI: 10.1145/4472.4474
We present a different style of axiomatic definition for programming languages. It is oriented toward imperative languages, such as Algol 68, that do not distinguish between statements and expressions. Rather than basing the logic on a notion of...

The denotational semantics of dynamic networks of processes
Arie de Bruin, Wim Böhm
Pages: 656-679
DOI: 10.1145/4472.4473
DNP (dynamic networks of processes) is a variant of the language introduced by Kahn and MacQueen [11, 12]. In the language it is possible to create new processes dynamically. We present a complete, formal denotational semantics for the language,...

A note on Cohen's “eliminating redundant recursive calls”
Norman H. Cohen
Pages: 680-685
DOI: 10.1145/4472.215006