| 1988 | 0-1 Laws and Decision Problems for Fragments of Second-Order Logic Phokion G. Kolaitis, Moshe Y. Vardi |
| 1988 | A Categorical Semantics of Constructions Thomas Ehrhard |
| 1988 | A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract) Glynn Winskel |
| 1988 | A Logic for Reasoning about Probabilities Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo |
| 1988 | A Modal Process Logic Kim Guldstrand Larsen, Bent Thomsen |
| 1988 | A Modest Model of Records, Inheritance and Bounded Quantification Kim B. Bruce, Giuseppe Longo |
| 1988 | A fixed point extension of the second order lambda-calculus: observable equivalences and models Roberto M. Amadio |
| 1988 | An Algebra and a Logic for NC¹ Kevin J. Compton, Claude Laflamme |
| 1988 | Bisimulations and Divergence D. J. Walker |
| 1988 | Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report) Bard Bloom |
| 1988 | Categories of Embeddings Thierry Coquand |
| 1988 | Characterization of typings in polymorphic type discipline Paola Giannini, Simona Ronchi Della Rocca |
| 1988 | Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus Corrado Böhm, Adolfo Piperno |
| 1988 | Coherence and Consistency in Domains (Extended Outline) Carl A. Gunter, Achim Jung |
| 1988 | Combining Algebra and Higher-Order Types Val Tannen |
| 1988 | Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees Michael J. Maher |
| 1988 | Computational Foundations of Basic Recursive Function Theory Robert L. Constable, Scott F. Smith |
| 1988 | Corrigendum: Complete Type Inference for Simple Objects Mitchell Wand |
| 1988 | Efficient Parallel Algorithms for Anti-Unification and Relative Complement Gabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry |
| 1988 | Fixed Points vs. Infinite Generation Damian Niwinski |
| 1988 | Fully Abstract Denotational Semantics for Flat Concurrent Prolog Rob Gerth, Michael Codish, Yossi Lichtenstein, Ehud Shapiro |
| 1988 | Notational definition-a formal account Timothy Griffin |
| 1988 | On the Arithmetic Inexpressiveness of Term Rewriting Systems Sergei G. Vorobyov |
| 1988 | On the Computational Power of Universally Polymorphic Recursion A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
| 1988 | On the Consistency of "Truly Concurrent" Operational and Denotational Semantics (Extended Abstract) Pierpaolo Degano, Rocco De Nicola, Ugo Montanari |
| 1988 | On the Existence of Effective Hoare Logics Michal Grabowski, Hardi Hungar |
| 1988 | Partial Correctness of C-MOS Switching Circuits: An Exercise in Applied Logic C. A. R. Hoare, Michael J. C. Gordon |
| 1988 | Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory José Meseguer, Ugo Montanari |
| 1988 | Priorities in Process Algebras Rance Cleaveland, Matthew Hennessy |
| 1988 | Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), Edinburgh, Scotland, UK, July 5-8, 1988 |
| 1988 | Proof by Consistency in Equational Theories Leo Bachmair |
| 1988 | Proof-Theoretic Techniques for Term Rewriting Theory Nachum Dershowitz, Mitsuhiro Okada |
| 1988 | Proving Termination Properties of Prolog Programs: A Semantic Approach Marianne Baudinet |
| 1988 | Proving unprovability Michael L. Tiomkin |
| 1988 | Relevance Logic and Concurrent Composition Mads Dam |
| 1988 | Rigid E-Unification is NP-Complete Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted |
| 1988 | Semantic Parametricity in Polymorphic Lambda Calculus Peter J. Freyd, Jean-Yves Girard, Andre Scedrov, Philip J. Scott |
| 1988 | Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis Albert R. Meyer |
| 1988 | The Existence of Refinement Mappings Martín Abadi, Leslie Lamport |
| 1988 | The Strength of the Subset Type in Martin-Löf's Type Theory Anne Salvesen, Jan M. Smith |
| 1988 | The Topology of Program Termination Robert Cartwright, Alan J. Demers |
| 1988 | The notion of a Framework and a framework for LTC Paul F. Mendler, Peter Aczel |
| 1988 | Unification in Free Extensions of Boolean Rings and Abelian Groups Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß |
| 1988 | Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time David E. Muller, Ahmed Saoudi, Paul E. Schupp |