| 1989 | A Fully Abstract Semantics for a Functional Language with Logic Variables Radha Jagadeesan, Prakash Panangaden, Keshav Pingali |
| 1989 | A Game-Theoretic Modeling of Concurrency Yiannis N. Moschovakis |
| 1989 | A Probabilistic Powerdomain of Evaluations C. Jones, Gordon D. Plotkin |
| 1989 | A Small Universal Model for System Executions Jay L. Gischer |
| 1989 | A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems Aart Middeldorp |
| 1989 | Axiomatizing Net Computations and Processes Pierpaolo Degano, José Meseguer, Ugo Montanari |
| 1989 | Axiomatizing Operational Equivalence in the Presence of Side Effects Ian A. Mason, Carolyn L. Talcott |
| 1989 | Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions Andreas Goerdt |
| 1989 | Compositional Model Checking Edmund M. Clarke, David E. Long, Kenneth L. McMillan |
| 1989 | Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
| 1989 | Computational Lambda-Calculus and Monads Eugenio Moggi |
| 1989 | Computing with Recursive Types (Extended Abstract) Stavros S. Cosmadakis |
| 1989 | Domains and Logics (Extended Abstract) Dana S. Scott |
| 1989 | ECC, an Extended Calculus of Constructions Zhaohui Luo |
| 1989 | Elf: A Language for Logic Definition and Verified Metaprogramming Frank Pfenning |
| 1989 | Emil Post's Contributions to Computer Science Martin Davis |
| 1989 | Equality In Lazy Computation Systems Douglas J. Howe |
| 1989 | Extending the Lambda Calculus with Surjective Pairing is Conservative Roel C. de Vrijer |
| 1989 | Faithful Ideal Models for Recursive Polymorphic Types Martín Abadi, Benjamin C. Pierce, Gordon D. Plotkin |
| 1989 | Fixpoint Extensions of First-Order Logic and Datalog-Like Languages Serge Abiteboul, Victor Vianu |
| 1989 | How Complete is PER? Edmund Robinson |
| 1989 | Inheritance and Explicit Coercion (Preliminary Report) Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov |
| 1989 | Negation As Refutation Melvin Fitting |
| 1989 | Nets and Data Flow Interpreters Alexander Moshe Rabinovich, Boris A. Trakhtenbrot |
| 1989 | Non-Well-Founded Sets Obtained from Ideal Fixed Points Michael W. Mislove, Lawrence S. Moss, Frank J. Oles |
| 1989 | Non-trivial Power Types Can't Be Subtypes of Polymorphic Types Andrew M. Pitts |
| 1989 | On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract) E. Allen Emerson, Charanjit S. Jutla |
| 1989 | On Substitutional Recursion Over Non-Well-Founded Sets R. T. P. Fernando |
| 1989 | On the Complexity of Epistemic Reasoning Moshe Y. Vardi |
| 1989 | PARTHENON: A Parallel Theorem Prover for Non-Horn Clauses Soumitra Bose, Edmund M. Clarke, David E. Long, Spiro Michaylov |
| 1989 | Polynomially Grade Logic I: A Graded Version of System T Anil Nerode, Jeffrey B. Remmel, Andre Scedrov |
| 1989 | Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), Pacific Grove, California, USA, June 5-8, 1989 |
| 1989 | Proof Theory and Semantics of Logic Programs Haim Gaifman, Ehud Shapiro |
| 1989 | RI: A Logic for Reasoning with Inconsistency Michael Kifer, Eliezer L. Lozinskii |
| 1989 | Some Complexity Bounds for Dynamic Logics Alexei P. Stolboushkin |
| 1989 | Stratified Polymorphism (Extended Summary) Daniel Leivant |
| 1989 | Structure and Representation in LF Robert Harper, Donald Sannella, Andrzej Tarlecki |
| 1989 | The Mathematics of Nonmonotonic Reasoning (Abstract) Vladimir Lifschitz |
| 1989 | Towards Action-Refinement in Process Algebras Luca Aceto, Matthew Hennessy |
| 1989 | Type Inference for Record Concatenation and Multiple Inheritance Mitchell Wand |
| 1989 | Unified Algebras and Institutions Peter D. Mosses |
| 1989 | mu-Definable Sets of Integers Robert S. Lubarsky |