Programming Languages and Systems (TOPLAS)


Search Issue
enter search term and/or author name


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 8 Issue 4, Oct. 1986

A structural view of the Cedar programming environment
Daniel C. Swinehart, Polle T. Zellweger, Richard J. Beach, Robert B. Hagmann
Pages: 419-490
DOI: 10.1145/6465.6466
This paper presents an overview of the Cedar programming environment, focusing on its overall structure—that is, the major components of Cedar and the way they are organized. Cedar supports the development of programs written in a single...

The impact of interprocedural analysis and optimization in the Rn programming environment
Keith D. Cooper, Ken Kennedy, Linda Torczon
Pages: 491-523
DOI: 10.1145/6465.6489
In spite of substantial progress in the theory of interprocedural data flow analysis, few practical compiling systems can afford to apply it to produce more efficient object programs. To perform interprocedural analysis, a compiler needs not...

The PegaSys System: pictures as formal documentation of large programs
Mark Moriconi, Dwight F. Hare
Pages: 524-546
DOI: 10.1145/6465.6478
PegsSys is an experimental system in which a user formally describes how a program is put together by means of a hierarchically structured collection of pictures, called formal dependency diagrams (FDDs). Icons in an FDD denote...

The PSG system: from formal language definitions to interactive programming environments
Rolf Bahlke, Gregor Snelting
Pages: 547-576
DOI: 10.1145/6465.20890
The PSG programming system generator developed at the Technical University of Darmstadt produces interactive, language-specific programming environments from formal language definitions. All language-dependent parts of the environment are...

Generating editing environments based on relations and attributes
Susan Horwitz, Tim Teitelbaum
Pages: 577-608
DOI: 10.1145/6465.6512
The ability to generate language-based editors depends on the existence of a powerful, language-independent model of editing. A model is proposed in which programs are represented as attributed abstract-syntax trees with an associated relational...