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

Volume 22, Number 1, January 2000

• Benjamin C. Pierce, David N. Turner:
  Local type inference. 1-44
  
• Wan Fokkink, Jasper Kamperman, Pum Walters:
  Lazy rewriting on eager machinery. 45-86
  
• Orna Kupferman, Moshe Y. Vardi:
  An automata-theortetic approach to modular model checking. 87-128
  
• Zhong Shao, Andrew W. Appel:
  Efficient and safe-for-space closure conversion. 129-161
  
• Thomas W. Reps:
  Undecidability of context-sensitive data-independence analysis. 162-186
  

Volume 22, Number 2, March 2000

• Manuel V. Hermenegildo, Germán Puebla, Kim Marriott, Peter J. Stuckey:
  Incremental analysis of constraint logic programs. 187-223
  
• Michael Sperber, Peter Thiemann:
  Generation of LR parsers by partial evaluation. 224-264
  
• José E. Moreira, Samuel P. Midkiff, Manish Gupta:
  From flop to megaflops: Java for technical computing. 265-295
  
• Maria J. García de la Banda, Manuel V. Hermenegildo, Kim Marriott:
  Independence in CLP languages. 296-339
  
• Xavier Leroy, François Pessaux:
  Type-based analysis of uncaught exceptions. 340-377
  
• Saumya K. Debray, William S. Evans, Robert Muth, Bjorn De Sutter:
  Compiler techniques for code compaction. 378-415
  
• G. Ramalingam:
  Context-sensitive synchronization-sensitive analysis is undecidable. 416-430
  

Volume 22, Number 3, May 2000

• Guei-Yuan Lueh, Thomas R. Gross, Ali-Reza Adl-Tabatabai:
  Fusion-based register allocation. 431-470
  
• Lars Ræder Clausen, Ulrik Pagh Schultz, Charles Consel, Gilles Muller:
  Java bytecode compression for low-end embedded systems. 471-489
  
• Thomas Kistler, Michael Franz:
  Automated data-member layout of help objects to improve memory-hierarchy performance. 490-505
  
• Andy J. Wellings, Bob Johnson, Bo Sanden, Jörg Kienzle, Thomas Wolf, Stephen Michell:
  Integrating object-oriented programming and protected objects in Ada 95. 506-539
  
• Gregor Snelting, Frank Tip:
  Understanding class hierarchies using concept analysis. 540-582
  

Volume 22, Number 4, July 2000

• Uwe Aßmann:
  Graph rewrite systems for program optimization. 583-637
  
• Zhenyu Qian:
  Standard fixpoint iteration for Java bytecode verification. 638-672
  
• Hong Tang, Kai Shen, Tao Yang:
  Program transformation and runtime support for threaded MPI execution on shared-memory machines. 673-700
  
• David Walker, Karl Crary, J. Gregory Morrisett:
  Typed memory management via static capabilities. 701-771
  

Volume 22, Number 5, September 2000

• Fabien Quilleré, Sanjay V. Rajopadhye:
  Optimizing memory usage in the polyhedral model. 773-815
  
• Reinhard von Hanxleden, Ken Kennedy:
  A balanced code placement framework. 816-860
  
• Agostino Dovier, Carla Piazza, Enrico Pontelli, Gianfranco Rossi:
  Sets and constraint logic programming. 861-931
  
• Brian Grant, Markus Mock, Matthai Philipose, Craig Chambers, Susan J. Eggers:
  The benefits and costs of DyC's run-time optimizations. 932-972
  

Volume 22, Number 6, November 2000

• Maya Madhavan, Priti Shankar, Siddhartha Rai, U. Ramakrishna:
  Extending Graham-Glanville techniques for optimal code generation. 973-1001
  
• Krzysztof R. Apt:
  The role of commutativity in constraint propagation algorithms. 1002-1036
  
• Dan Grossman, J. Gregory Morrisett, Steve Zdancewic:
  Syntactic type abstraction. 1037-1080