| 1999 | A New Approach to Abstract Syntax Involving Binders. | Murdoch Gabbay, Andrew M. Pitts |
| 1999 | Some Decision Problems of Enormous Complexity. | Harvey Friedman |
| 1999 | Abstract Syntax and Variable Binding. | Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi |
| 1999 | Weak Bisimulation and Open Maps. | Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel |
| 1999 | On the Verification of Broadcast Protocols. | Javier Esparza, Alain Finkel, Richard Mayr |
| 1999 | Parametric Quantitative Temporal Reasoning. | E. Allen Emerson, Richard J. Trefler |
| 1999 | A Fragment Calculus - Towards a Model of Separate Compilation, Linking and Binary Compatibility. | Sophia Drossopoulou, Susan Eisenbach, David Wragg |
| 1999 | Full Completeness of the Multiplicative Linear Logic of Chu Spaces. | Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt |
| 1999 | Subtyping Recursive Types in Kernel Fun. | Dario Colazzo, Giorgio Ghelli |
| 1999 | Pattern Matching as Cut Elimination. | Serenella Cerrito, Delia Kesner |
| 1999 | Some Computational Properties of Intersection Types. | Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo |
| 1999 | Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus. | Roberto Bruni, Ugo Montanari |
| 1999 | Proof Techniques for Cryptographic Processes. | Michele Boreale, Rocco De Nicola, Rosario Pugliese |
| 1999 | Paramodulation with Non-Monotonic Orderings. | Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio |
| 1999 | Modular Temporal Logic. | Augustin Baziramwabo, Pierre McKenzie, Denis Thrien |
| 1999 | Region Analysis and the Polymorphic Lambda Calculus. | Anindya Banerjee, Nevin Heintze, Jon G. Riecke |
| 1999 | First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. | Albert Atserias, Phokion G. Kolaitis |
| 1999 | Extensional Equality in Intensional Type Theory. | Thorsten Altenkirch |
| 1999 | Concurrent Games and Full Completeness. | Samson Abramsky, Paul-Andr Mellis |
| 1998 | Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers. | Hirofumi Yokouchi |
| 1998 | Herbrand's Theorem, Automated Reasoning and Semantics Tableaux. | Andrei Voronkov |
| 1998 | Full Abstraction for First-Order Objects with Recursive Types and Subtyping. | Ramesh Viswanathan |
| 1998 | The Relation Between Second-Order Unification and Simultaneous Rigid | Margus Veanes |
| 1998 | Linear vs. Branching Time: A Complexity-Theoretic Perspective. | Moshe Y. Vardi |
| 1998 | Monadic Logic and Automata: Recent Developments. | Wolfgang Thomas |