| 1990 | A Finite Presentation Theorem for Approximating Logic Programs. Nevin Heintze, Joxan Jaffar |
| 1990 | A Formulae-as-Types Notion of Control. Timothy Griffin |
| 1990 | A Relationship Between Abstract Interpretation and Projection Analysis. Geoffrey Livingston Burn |
| 1990 | A Type System for Smalltalk. Justin O. Graver, Ralph E. Johnson |
| 1990 | An Algorithm for Optimal Lambda Calculus Reduction. John Lamping |
| 1990 | An Efficient Hybrid Algorithm for Incremental Data Flow Analysis. Thomas J. Marlowe, Barbara G. Ryder |
| 1990 | Automata-Driven Indexing of Prolog Clauses. R. Ramesh, I. V. Ramakrishnan, David Scott Warren |
| 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 | Computable processes. Yiannis N. Moschovakis |
| 1990 | Concurrent Constraint Programming. Vijay A. Saraswat, Martin C. Rinard |
| 1990 | Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, USA, January 1990 Frances E. Allen |
| 1990 | Deciding ML Typability is Complete for Deterministic Exponential Time. Harry G. Mairson |
| 1990 | Explicit Substitutions. Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy |
| 1990 | Fairness and Hyperfairness in Multi-Party Interactions. Paul C. Attie, Nissim Francez, Orna Grumberg |
| 1990 | Higher-Order Modules and the Phase Distinction. Robert Harper, John C. Mitchell, Eugenio Moggi |
| 1990 | Implicative Formulae in the "Proofs as Computations" Analogy. Andrea Asperti, Gian-Luigi Ferrari, Roberto Gorrieri |
| 1990 | Inheritance Is Not Subtyping. William R. Cook, Walter L. Hill, Peter S. Canning |
| 1990 | Interaction Nets. Yves Lafont |
| 1990 | Making Asynchronous Parallelism Safe for the World. Guy L. Steele Jr. |
| 1990 | On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications. Alain Deutsch |
| 1990 | On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis. John Field |
| 1990 | On Oraclizable Networks and Kahn's Principle. James R. Russell |
| 1990 | On the Relations Computable by a Class of Concurrent Automata. Eugene W. Stark |
| 1990 | Parallelism in Logic Programs. Raghu Ramakrishnan |
| 1990 | Program Transformation in the Presence of Errors. Alexander Aiken, John H. Williams, Edward L. Wimmers |
| 1990 | Quasi-Static Typing. Satish R. Thatte |
| 1990 | Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs. Carl A. Gunter |
| 1990 | Safe Run-time Overloading. François Rouaix |
| 1990 | Scheduling Time-Critical Instructions on RISC Machines. Krishna V. Palem, Barbara B. Simons |
| 1990 | Small Domains Spell Fast Strictness Analysis. R. C. Sekar, Shaunak Pawagi, I. V. Ramakrishnan |
| 1990 | The Chemical Abstract Machine. Gérard Berry, Gérard Boudol |
| 1990 | Toward a Typed Foundation for Method Specialization and Inheritance. John C. Mitchell |