Abstract is missing.
- Isolating Side Effects in Sequential LanguagesJon G. Riecke, Ramesh Viswanathan. 1-12
- Sequential Algorithms, Deterministic Parallelism, and Intensional ExpressivenessStephen D. Brookes, Denis Dancanet. 13-24
- Using Functor Categories to Generate Intermediate CodeJohn C. Reynolds. 25-36
- Demand-driven Computation of Interprocedural Data FlowEvelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa. 37-48
- Precise Interprocedural Dataflow Analysis via Graph ReachabilityThomas W. Reps, Susan Horwitz, Shmuel Sagiv. 49-61
- A Linear Time Algorithm for Placing phi-nodesVugranam C. Sreedhar, Guang R. Gao. 62-73
- An Extended Form of Must Alias Analysis for Dynamic AllocationRita Altucher, William Landi. 74-84
- Reasoning about RingsE. Allen Emerson, Kedar S. Namjoshi. 85-94
- Verifying Infinite State Processes with Sequential and Parallel CompositionAhmed Bouajjani, Rachid Echahed, Peter Habermehl. 95-106
- Structured Operational Semantics as a Specification LanguageBard Bloom. 107-117
- Generic PolymorphismCatherine Dubois, François Rouaix, Pierre Weis. 118-129
- Compiling Polymorphism Using Intensional Type AnalysisRobert Harper, J. Gregory Morrisett. 130-141
- Applicative Functors and Fully Transparent Higher-Order ModulesXavier Leroy. 142-153
- Higher-Order Functors with Transparent SignaturesSandip K. Biswas. 154-163
- Structural Decidable Extensions of Bounded QuantificationSergei G. Vorobyov. 164-175
- Lower Bounds on Type Inference with SubtypesMy Hoang, John C. Mitchell. 176-185
- Positive SubtypingMartin Hofmann, Benjamin C. Pierce. 186-197
- The Geometry of Interaction MachineIan Mackie. 198-208
- The Semantics of Future and Its Use in Program OptimizationsCormac Flanagan, Matthias Felleisen. 209-220
- Total Correctness by Local Improvement in Program TransformationDavid Sands. 221-232
- The Call-by-Need Lambda CalculusZena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler. 233-246
- Unification Factoring for Efficient Execution of Logic ProgramsSteven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Konstantinos F. Sagonas, Steven Skiena, Terrance Swift, David Scott Warren. 247-258
- Default Timed Concurrent Constraint ProgrammingVijay A. Saraswat, Radha Jagadeesan, Vineet Gupta. 272-285
- A Language with Distributed ScopeLuca Cardelli. 286-297
- A Formal Model of Procedure Calling ConventionsMark W. Bailey, Jack W. Davidson. 298-310
- Obtaining Sequential Efficiency for Concurrent Object-Oriented LanguagesJohn Plevyak, Xingbin Zhang, Andrew A. Chien. 311-321
- Optimizing an ANSI C Interpreter with SuperoperatorsTodd A. Proebsting. 322-332
- Monad Transformers and Modular InterpretersSheng Liang, Paul Hudak, Mark P. Jones. 333-343
- Structuring Depth-First Search Algorithms in HaskellDavid J. King, John Launchbury. 344-354
- Time and Space Profiling for Non-Strict Higher-Order Functional LanguagesPatrick M. Sansom, Simon L. Peyton Jones. 355-366
- A Type System Equivalent to Flow AnalysisJens Palsberg, Patrick O Keefe. 367-378
- Parametric Program SlicingJohn Field, Ganesan Ramalingam, Frank Tip. 379-392
- A Unified Treatment of Flow Analysis in Higher-Order LanguagesSuresh Jagannathan, Stephen Weeks. 393-407
- Corrigendum: Decidable Bounded QuantificationGiuseppe Castagna, Benjamin C. Pierce. 408