ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 13

Volume 13, Number 1, January 1991

• Russell W. Quong, Mark A. Linton: Linking Programs Incrementally. 1-20 BibTeX
• Pascal Fradet, Daniel Le Métayer: Compilation of Functional Languages by Program Transformation. 21-51 BibTeX
• Richard C. Waters: Automatic Transformation of Series Expressions into Loops. 52-98 BibTeX
• Antonio Brogi, Paolo Ciancarini: The Concurrent Language, Shared Prolog. 99-123 BibTeX
• Maurice Herlihy: Wait-Free Synchronization. 124-149 BibTeX
• Massimo Ancona, Gabriella Dodero, Vittoria Gianuzzi, M. Morgavi: Efficient Construction of LR(k) States and Tables. 150-178 BibTeX

Volume 13, Number 2, April 1991

• Mark N. Wegman, F. Kenneth Zadeck: Constant Propagation with Conditional Branches. 181-210 BibTeX , preliminary version: POPL 1985: 291-299
• Daniel M. Yellin, Robert E. Strom: INC: A Language for Incremental Computations. 211-236 BibTeX
• Martín Abadi, Luca Cardelli, Benjamin C. Pierce, Gordon D. Plotkin: Dynamic Typing in a Statically Typed Language. 237-268 BibTeX , preliminary version: POPL 1989: 213-227
• Paul Hudak, Jonathan Young: Collecting Interpretations of Expressions. 269-290 BibTeX , preliminary version: POPL 1988: 107-118
• Dhananjay M. Dhamdhere: Practical Adaptation of the Global Optimization Algorithm of Morel and Renvoise. 291-294 BibTeX

Volume 13, Number 3, July 1991

• Jürgen Börstler, Ulrich Möncke, Reinhard Wilhelm: Table Compression for Tree Automata. 295-314 BibTeX
• Scott E. Hudson: Incremental Attribute Evaluation: A Flexible Algorithm for Lazy Update. 315-341 BibTeX
• Ronald Morrison, Alan Dearle, Richard C. H. Connor, Alfred L. Brown: An Ad Hoc Approach to the Implementation of Polymorphism. 342-371 BibTeX
• Thomas P. Murtagh: An Improved Storage Management Scheme for Block Structured Languages. 372-398 BibTeX
• Wuxu Peng, S. Purushothaman: Data Flow Analysis of Communicating Finite State Machines. 399-442 BibTeX

Volume 13, Number 4, October 1991

• Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. 451-490 BibTeX , preliminary version: POPL 1989: 25-35
• Jong-Deok Choi, Barton P. Miller, Robert H. B. Netzer: Techniques for Debugging Parallel Programs with Flowback Analysis. 491-530 BibTeX
• Tim Sheard: Automatic Generation and Use of Abstract Structure Operators. 531-557 BibTeX
• Edward A. Lycklama, Vassos Hadzilacos: A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables. 558-576 BibTeX
• Radha Jagadeesan, Keshav Pingali, Prakash Panangaden: A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables. 577-625 BibTeX
• Norman H. Cohen: Type-Extension Type Tests Can Be Performed In Constant Time. 626-629 BibTeX
• Niklaus Wirth: Reply to ``Type-Extension Tests Can Be Performed In Constant Time''. 630 BibTeX
• Dennis M. Volpano: Subtypes and Quantification. 631-632 BibTeX
• F. Warren Burton: Reply to ``Subtypes and Quantification''. 633 BibTeX