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
  
• Pascal Fradet, Daniel Le Métayer:
  Compilation of Functional Languages by Program Transformation. 21-51
  
• Richard C. Waters:
  Automatic Transformation of Series Expressions into Loops. 52-98
  
• Antonio Brogi, Paolo Ciancarini:
  The Concurrent Language, Shared Prolog. 99-123
  
• Maurice Herlihy:
  Wait-Free Synchronization. 124-149
  
• Massimo Ancona, Gabriella Dodero, Vittoria Gianuzzi, M. Morgavi: Efficient Construction of LR(k) States and Tables. 150-178

Volume 13, Number 2, April 1991

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

Volume 13, Number 3, July 1991

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

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, (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
  
• Tim Sheard:
  Automatic Generation and Use of Abstract Structure Operators. 531-557
  
• Edward A. Lycklama, Vassos Hadzilacos:
  A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables. 558-576
  
• Radha Jagadeesan, Keshav Pingali, Prakash Panangaden:
  A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables. 577-625
  
• Norman H. Cohen:
  Type-Extension Type Tests Can Be Performed In Constant Time. 626-629
  
• Niklaus Wirth:
  Reply to ``Type-Extension Tests Can Be Performed In Constant Time''. 630
  
• Dennis M. Volpano:
  Subtypes and Quantification. 631-632
  
• F. Warren Burton: Reply to ``Subtypes and Quantification''. 633

Last update Sat May 25 17:02:28 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page