Abstract is missing.
- The Program Dependence Graph and VectorizationWilliam Baxter, Henry R. Bauer III. 1-11
- A Rewriting Semantics for Program Dependence GraphsRebecca Parsons Selke. 12-24
- An Efficient Method of Computing Static Single Assignment FormRon Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck. 25-35
- Resolving Circularity in Attribute Grammars with Applications to Data Flow AnalysisShmuel Sagiv, O. Edelstein, Nissim Francez, Michael Rodeh. 36-48
- Fast Interprocedural Alias AnalysisKeith D. Cooper, Ken Kennedy. 49-59
- How to Make ad-hoc Polymorphism Less ad-hocPhilip Wadler, Stephen Blott. 60-76
- Typechecking Records and Variants in a Natural Extension of MLDidier Rémy. 77-88
- Extracting F(omega) s Programs from Proofs in the Calculus of ConstructionsChristine Paulin-Mohring. 89-104
- Polymorphic Unification and ML TypingParis C. Kanellakis, John C. Mitchell. 105-115
- Moded Type Systems for Logic ProgrammingKatherine A. Yelick, Joseph L. Zachary. 116-124
- CLP* and Constraint AbstractionTimothy J. Hickey. 125-133
- Fully Abstract Compositional Semantics for Logic ProgramsHaim Gaifman, Ehud Y. Shapiro. 134-142
- A Calculus of Higher Order Communicating SystemsBent Thomsen. 143-154
- A Fully Abstract Trace Model for Dataflow NetworksBengt Jonsson. 155-165
- Efficient Temporal ReasoningE. Allen Emerson, Tom Sadler, Jai Srinivasan. 166-178
- On the Synthesis of a Reactive ModuleAmir Pnueli, Roni Rosner. 179-190
- Synthesis of Concurrent Systems with Many Similar Sequential ProcessesPaul C. Attie, E. Allen Emerson. 191-201
- The Modula-3 Type SystemLuca Cardelli, James E. Donahue, Mick J. Jordan, Bill Kalsow, Greg Nelson. 202-212
- Dynamic Typing in a Statically-Typed LanguageMartín Abadi, Luca Cardelli, Benjamin C. Pierce, Gordon D. Plotkin. 213-227
- Relating Models of PolymorphismJosé Meseguer. 228-241
- Rewrite, Rewrite, Rewrite, Rewrite, RewriteNachum Dershowitz, Stéphane Kaplan. 250-259
- Partial Order ProgrammingDouglas Stott Parker Jr.. 260-266
- Temporal Logic Programming is Complete and ExpressiveMarianne Baudinet. 267-280
- Realistic Compilation by Program TransformationRichard Kelsey, Paul Hudak. 281-292
- Continuation-Passing, Closure-Passing StyleAndrew W. Appel, Trevor Jim. 293-302
- Copy Elimination in Functional LanguagesK. Gopinath, John L. Hennessy. 303-314
- Incremental Computation via Function CachingWilliam Pugh, Tim Teitelbaum. 315-328
- Unified Algebras and ModulesPeter D. Mosses. 329-343
- Bisimulation Through Probabilistic TestingKim Guldstrand Larsen, Arne Skou. 344-352