| 1999 | A Linear Logical View of Linear Type Isomorphisms. Vincent Balat, Roberto Di Cosmo |
| 1999 | A Logical Viewpoint on Process-Algebraic Quotients. Antonín Kucera, Javier Esparza |
| 1999 | A NExpTime-Complete Description Logic Strictly Contained in C Stephan Tobies |
| 1999 | A P-Time Completeness Proof for Light Logics. Luca Roversi |
| 1999 | A Road-Map on Complexity for Hybrid Logics. Carlos Areces, Patrick Blackburn, Maarten Marx |
| 1999 | A Truly Concurrent Semantics for a Simple Parallel Programming Language. Paul Gastin, Michael W. Mislove |
| 1999 | A Universal Innocent Game Model for the Böhm Tree Lambda Theory. Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong |
| 1999 | An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. Volker Diekert, Paul Gastin |
| 1999 | Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States. Martin Fränzle |
| 1999 | Anti-Symmetry of Higher-Order Subtyping. Adriana B. Compagnoni, Healfdene Goguen |
| 1999 | Applicative Control and Computational Complexity. Daniel Leivant |
| 1999 | Applying Rewriting Techniques to the Verification of Erlang Processes. Thomas Arts, Jürgen Giesl |
| 1999 | Choice Logic Programs and Nash Equilibria in Strategic Games. Marina De Vos, Dirk Vermeir |
| 1999 | Closed Reductions in the lambda-Calculus. Maribel Fernández, Ian Mackie |
| 1999 | Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings Jörg Flum, Mario Rodríguez-Artalejo |
| 1999 | Constraint-Based Analysis of Broadcast Protocols. Giorgio Delzanno, Javier Esparza, Andreas Podelski |
| 1999 | Data-Refinement for Call-By-Value Programming Languages. Yoshiki Kinoshita, John Power |
| 1999 | Descriptive Complexity Theory for Constraint Databases. Erich Grädel, Stephan Kreutzer |
| 1999 | Descriptive and Parameterized Complexity. Martin Grohe |
| 1999 | Difference Decision Diagrams. Jesper B. Møller, Jakob Lichtenberg, Henrik Reif Andersen, Henrik Hulgaard |
| 1999 | Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. Jerzy Marcinkowski |
| 1999 | Fixpoint Alternation and the Game Quantifier. Julian C. Bradfield |
| 1999 | Interactive Theorem Proving Using Type Theory. Douglas J. Howe |
| 1999 | Kripke Resource Models of a Dependently-Typed, Bunched lambda-Calculus. Samin S. Ishtiaq, David J. Pym |
| 1999 | Logical Specification of Operational Semantics. Peter D. Mosses |
| 1999 | Lower Bounds for Space in Resolution. Jacobo Torán |
| 1999 | Monadic Presentations of Lambda Terms Using Generalized Inductive Types. Thorsten Altenkirch, Bernhard Reus |
| 1999 | MonadicNLIN and Quantifier-Free Reductions. Clemens Lautemann, Bernhard Weinzinger |
| 1999 | On Guarding Nested Fixpoints. Helmut Seidl, Andreas Neumann |
| 1999 | Open Least Element Principle and Bounded Query Computation. Lev D. Beklemishev |
| 1999 | Pre-logical Relations. Furio Honsell, Donald Sannella |
| 1999 | Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. Iain A. Stewart |
| 1999 | Quantitative Temporal Logic. Yoram Hirshfeld, Alexander Moshe Rabinovich |
| 1999 | Resolution Method for Modal Logic with Well-Founded Frames. Shigeki Hagihara, Naoki Yonezaki |
| 1999 | Safe Proof Checking in Type Theory with Y. Herman Geuvers, Erik Poll, Jan Zwanenburg |
| 1999 | Signed Interval Logic. Thomas Marthedal Rasmussen |
| 1999 | Specification Refinement with System F. Jo Erskine Hannay |
| 1999 | Term Rewriting. Aart Middeldorp |
| 1999 | The Consistency Dimension, Compactness, and Query Learning. José L. Balcázar |
| 1999 | Topological Queries in Spatial Databases. Victor Vianu |
| 1999 | Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. Eduardo Bonelli |
| 1999 | Verifying Liveness by Augmented Abstraction. Yonit Kesten, Amir Pnueli |