| 1990 | Deciding ML Typability is Complete for Deterministic Exponential Time. | Harry G. Mairson |
| 1990 | An Algorithm for Optimal Lambda Calculus Reduction. | John Lamping |
| 1990 | Interaction Nets. | Yves Lafont |
| 1990 | A Finite Presentation Theorem for Approximating Logic Programs. | Nevin Heintze, Joxan Jaffar |
| 1990 | Higher-Order Modules and the Phase Distinction. | Robert Harper, John C. Mitchell, Eugenio Moggi |
| 1990 | Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs. | Carl A. Gunter |
| 1990 | A Formulae-as-Types Notion of Control. | Timothy Griffin |
| 1990 | A Type System for Smalltalk. | Justin O. Graver, Ralph E. Johnson |
| 1990 | On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis. | John Field |
| 1990 | On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications. | Alain Deutsch |
| 1990 | Combining Generational and Conservative Garbage Collection: Framework and Implementations. | Alan J. Demers, Mark D. Weiser, Barry Hayes, Hans-Juergen Boehm, Daniel G. Bobrow, Scott Shenker |
| 1990 | Inheritance Is Not Subtyping. | William R. Cook, Walter L. Hill, Peter S. Canning |
| 1990 | A Relationship Between Abstract Interpretation and Projection Analysis. | Geoffrey Livingston Burn |
| 1990 | The Chemical Abstract Machine. | Grard Berry, Grard Boudol |
| 1990 | Fairness and Hyperfairness in Multi-Party Interactions. | Paul C. Attie, Nissim Francez, Orna Grumberg |
| 1990 | Implicative Formulae in the "Proofs as Computations" Analogy. | Andrea Asperti, Gian-Luigi Ferrari, Roberto Gorrieri |
| 1990 | Program Transformation in the Presence of Errors. | Alexander Aiken, John H. Williams, Edward L. Wimmers |
| 1990 | Explicit Substitutions. | Martn Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lvy |
| 1989 | Moded Type Systems for Logic Programming. | Katherine A. Yelick, Joseph L. Zachary |
| 1989 | How to Make ad-hoc Polymorphism Less ad-hoc. | Philip Wadler, Stephen Blott |
| 1989 | A Calculus of Higher Order Communicating Systems. | Bent Thomsen |
| 1989 | A Rewriting Semantics for Program Dependence Graphs. | Rebecca Parsons Selke |
| 1989 | Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis. | Shmuel Sagiv, Orit Edelstein, Nissim Francez, Michael Rodeh |
| 1989 | Typechecking Records and Variants in a Natural Extension of ML. | Didier Rmy |
| 1989 | Incremental Computation via Function Caching. | William W. Pugh, Tim Teitelbaum |