Abstract is missing.
- On Laziness and Optimality in Lambda Interpreters: Tools for Specification and AnalysisJohn Field. 1-15
- An Algorithm for Optimal Lambda Calculus ReductionJohn Lamping. 16-30
- Explicit SubstitutionsMartín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy. 31-46
- A Formulae-as-Types Notion of ControlTimothy Griffin. 47-58
- Implicative Formulae in the Proofs as Computations AnalogyAndrea Asperti, Gian Luigi Ferrari, Roberto Gorrieri. 59-71
- The Chemical Abstract MachineGérard Berry, Gérard Boudol. 81-94
- Interaction NetsYves Lafont. 95-108
- Toward a Typed Foundation for Method Specialization and InheritanceJohn C. Mitchell. 109-124
- Inheritance Is Not SubtypingWilliam R. Cook, Walter L. Hill, Peter S. Canning. 125-135
- A Type System for SmalltalkJustin O. Graver, Ralph E. Johnson. 136-150
- A Relationship Between Abstract Interpretation and Projection AnalysisGeoffrey L. Burn. 151-156
- On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional SpecificationsAlain Deutsch. 157-168
- Small Domains Spell Fast Strictness AnalysisR. C. Sekar, Shaunak Pawagi, I. V. Ramakrishnan. 169-183
- An Efficient Hybrid Algorithm for Incremental Data Flow AnalysisThomas J. Marlowe, Barbara G. Ryder. 184-196
- A Finite Presentation Theorem for Approximating Logic ProgramsNevin Heintze, Joxan Jaffar. 197-209
- Program Transformation in the Presence of ErrorsAlexander Aiken, John H. Williams, Edward L. Wimmers. 210-217
- Making Asynchronous Parallelism Safe for the WorldGuy L. Steele Jr.. 218-231
- Concurrent Constraint ProgrammingVijay A. Saraswat, Martin C. Rinard. 232-245
- Parallelism in Logic ProgramsRaghu Ramakrishnan. 246-260
- Combining Generational and Conservative Garbage Collection: Framework and ImplementationsAlan J. Demers, Mark Weiser, Barry Hayes, Hans-Juergen Boehm, Daniel G. Bobrow, Scott Shenker. 261-269
- Scheduling Time-Critical Instructions on RISC MachinesKrishna V. Palem, Barbara B. Simons. 270-280
- Automata-Driven Indexing of Prolog ClausesR. Ramesh, I. V. Ramakrishnan, David Scott Warren. 281-291
- Fairness and Hyperfairness in Multi-Party InteractionsPaul C. Attie, Nissim Francez, Orna Grumberg. 292-305
- Relating Total and Partial Correctness Interpretations of Non-Deterministic ProgramsCarl A. Gunter. 306-319
- On the Relations Computable by a Class of Concurrent AutomataEugene W. Stark. 329-340
- Higher-Order Modules and the Phase DistinctionRobert Harper, John C. Mitchell, Eugenio Moggi. 341-354
- Safe Run-time OverloadingFrançois Rouaix. 355-366
- Quasi-Static TypingSatish R. Thatte. 367-381
- Deciding ML Typability is Complete for Deterministic Exponential TimeHarry G. Mairson. 382-401