26. POPL 1999: San Antonio, Texas, USA

Invited Talk

• Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte:
  AnnoDomini: From Type Theory to Year 2000 Conversion Tool. 1-14
  

Session 1

• Keith Wansbrough, Simon L. Peyton Jones:
  Once Upon a Polymorphic Type. 15-28
  
• Naoki Kobayashi:
  Quasi-Linear Types. 29-42
  
• Andrew Moran, David Sands:
  Improvement in a Lazy Context: An Operational Theory for Call-by-Need. 43-56
  

Session 2

• Phillip M. Yelland:
  A Compositional Account of the Java Virtual Machine. 57-69
  
• Robert O'Callahn:
  A Simple, Comprehensive Type System for Java Bytecode Subroutines. 70-78
  
• Luca Cardelli, Andrew D. Gordon:
  Types for Mobile Ambients. 79-92
  
• James Riely, Matthew Hennessy:
  Trust and Partial Typing in Open Systems of Mobile Agents. 93-104
  

Session 3

• Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm:
  Parametric Shape Analysis via 3-Valued Logic. 105-118
  
• G. Ramalingam, John Field, Frank Tip:
  Aggregate Structure Identification and Its Application to Program Analysis. 119-132
  
• Ramkrishna Chatterjee, Barbara G. Ryder, William Landi:
  Relevant Context Inference. 133-146
  

Session 4

• Martín Abadi, Anindya Banerjee, Nevin Heintze, Jon G. Riecke:
  A Core Calculus of Dependency. 147-160
  
• A. J. Kfoury, J. B. Wells:
  Principality and Decidable Type Inference for Finite-Rank Intersection Types. 161-174
  
• Andrzej Filinski:
  Representing Layered Monads. 175-188
  

Session 5

• Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
  Stochastic Processes as Concurrent Constraint Programs. 189-202
  
• Oscar Waddell, R. Kent Dybvig:
  Extending the Scope of Syntactic Abstraction. 203-215
  
• Hongwei Xi, Frank Pfenning:
  Dependent Types in Practical Programming. 214-227
  
• Andrew C. Myers:
  JFlow: Practical Mostly-Static Information Flow Control. 228-241
  

Session 6

• M. Anton Ertl:
  Optimal Code Selection in DAGs. 242-249
  
• Neal Glew, J. Gregory Morrisett:
  Type-Safe Linking and Modular Assembly Language. 250-261
  
• Karl Crary, David Walker, J. Gregory Morrisett:
  Typed Memory Management in a Calculus of Capabilities. 262-275
  

Session 7

• François Pessaux, Xavier Leroy:
  Type-Based Analysis of Uncaught Exceptions. 276-290
  
• Mitchell Wand, Igor Siveroni:
  Constraint Systems for Useless Variable Elimination. 291-302
  
• Martin Ruckert:
  Continuous Grammars. 303-310
  
• Christian S. Collberg, Clark D. Thomborson:
  Software Watermarking: Models and Dynamic Embeddings. 311-324