Abstract is missing.
- Incremental Compilation via Partial EvaluationR. S. Sundaresh, Paul Hudak. 1-13
- Static and Dynamic Semantics ProcessingCharles Consel, Olivier Danvy. 14-24
- How to Make Destructive Updates Less DestructiveMartin Odersky. 25-36
- On the Power and Limitation of Strictness Analysis Based on Abstract InterpretationR. C. Sekar, Prateek Mishra, I. V. Ramakrishnan. 37-48
- A Relational Approach to Strictness Analysis for Higher-Order Polymorphic FunctionsSamson Abramsky, Thomas P. Jensen. 49-54
- Automatic Construction of Sparse Data Flow Evaluation GraphsJong-Deok Choi, Ron Cytron, Jeanne Ferrante. 55-66
- Program Optimization and Parallelization Using IdiomsShlomit S. Pinter, Ron Y. Pinter. 79-92
- Pointer-Induced Aliasing: A Problem ClassificationWilliam Landi, Barbara G. Ryder. 93-103
- Subtyping Recursive TypesRoberto M. Amadio, Luca Cardelli. 104-118
- The Complexity of Type Inference for Higher-Order Typed Lambda CalculiFritz Henglein, Harry G. Mairson. 119-130
- A Record Calculus Based on Symmetric ConcatenationRobert Harper, Benjamin C. Pierce. 131-142
- Look Ma, No Hashing, And No Arrays Neither Jiazhen Cai, Robert Paige. 143-154
- Macros That WorkWilliam D. Clinger, Jonathan Rees. 155-162
- Typing First-Class Continuations in MLBruce F. Duba, Robert Harper, David B. MacQueen. 163-173
- A Dynamic Extent Control Operator for Partial ContinuationsChristian Queinnec, Bernard P. Serpette. 174-184
- Modeling Continuations without ContinuationsDorai Sitaram, Matthias Felleisen. 185-196
- Parallel Programming With Coordination StructuresSteven Lucco, Oliver Sharp. 197-208
- Coordinating First-Order Multiparty InteractionsYuh-Jzer Joung, Scott A. Smolka. 209-220
- Communication with Directed Logic VariablesAlon Kleinman, Yael Moscowitz, Amir Pnueli, Ehud Y. Shapiro. 221-232
- Parameter-Passing and the Lambda CalculusErik Crank, Matthias Felleisen. 233-244
- Fully Abstract Translations between Functional LanguagesJon G. Riecke. 245-254
- Optimal Derivations in Weak Lambda-calculi and in Orthogonal Terms Rewriting SystemsLuc Maranget. 255-269
- An Extension of Standard ML Modules with Subtyping and InheritanceJohn C. Mitchell, Sigurd Meldal, Neel Madhav. 270-278
- Static Type Inference in a Dynamically Typed LanguageAlexander Aiken, Brian R. Murphy. 279-290
- Polymorphic Type Inference and AssignmentXavier Leroy, Pierre Weis. 291-302
- Algebraic Reconstruction of Types and EffectsPierre Jouvelot, David K. Gifford. 303-310
- Modeling Concurrency with GeometryVaughan R. Pratt. 311-322
- A Logical View of Composition and RefinementMartÃn Abadi, Gordon D. Plotkin. 323-332
- Semantic Foundations of Concurrent Constraint ProgrammingVijay A. Saraswat, Martin C. Rinard, Prakash Panangaden. 333-352
- Temporal Proof Methodologies for Real-time SystemsThomas A. Henzinger, Zohar Manna, Amir Pnueli. 353-366