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

Graph translation schemes to generate compiler parts
Michael Sonnenschein
Pages: 473-490
DOI: 10.1145/29873.29874
Graph translation schemes (GTSs) are a generalization of attribute grammars and of some ideas in Koster's language CDL2 They are specially designed to support a compiler writer in defining parts of the back-end of his compiler, but they can also...

Automatic translation of FORTRAN programs to vector form
Randy Allen, Ken Kennedy
Pages: 491-542
DOI: 10.1145/29873.29875
The recent success of vector computers such as the Cray-1 and array processors such as those manufactured by Floating Point Systems has increased interest in making vector operations available to the FORTRAN programmer. The FORTRAN standards...

Efficient algorithms for automatic construction and compactification of parsing
D. J. Rosenkrantz, H. B. Hunt
Pages: 543-566
DOI: 10.1145/29873.29876
Several computational problems about grammars are studied. Efficient algorithms are presented for the problems of (1) determining, for a given semantic grammar, if there exists a related parsing grammar in some specified grammar class, and (2)...

A generalized iterative construct and its semantics
Ed Anson
Pages: 567-581
DOI: 10.1145/29873.30391
A new programming language construct, called DOupon, subsumes Dijkstra's selective (IF) and iterative (DO) constructs. DOupon has a predicate transformer approximately equivalent in complexity to that for DO. In addition, it simplifies a wide...

Embedding continuations in procedural objects
Christopher T. Haynes, Daniel P. Friedman
Pages: 582-598
DOI: 10.1145/29873.30392
Continuations, when available as first-class objects, provide a general control abstraction in programming languages. They liberate the programmer from specific control structures, increasing programming language extensibility. Such...

Conversion from data-driven to synchronous execution in loop programs
Janice E. Cuny, Lawrence Snyder
Pages: 599-617
DOI: 10.1145/29873.31334
Conversion algorithms are presented that would enable programmers to write programs in a high-level, data flow language and then run those programs on a synchronous machine. A model of interprocess communication systems is developed in which...

A data-driven model for a subset of logic programming
Lubomir Bic, Craig Lee
Pages: 618-645
DOI: 10.1145/29873.31333
There is a direct correspondence between semantic networks and a subset of logic programs, restricted only to binary predicates. The advantage of the latter is that it can describe not only the nodes and arcs comprising a semantic net, but also...

Algorithmic specifications: a constructive specification method for abstract data types
Jacques Loeckx
Pages: 646-661
DOI: 10.1145/29873.30399
This paper presents a new specification method for abstract data types and a pertaining logic. The specification method proposed differs from the classical algebraic one by its constructive, yet abstract nature. Although it leads to a different...