| S. Abramsky | A Cooks Tour of the Finitary Non-Well-Founded Sets |
| F. Honsell | The Edinburgh LF - a Framework for describing logical systems |
| R. Milner | What use are Process Algebras? |
| L.G. Valiant | Computationally Feasible Learning |
| C. Yap | Grobner Bases: Complexity and Applications |
| A. Apostolico | Parallel Algorithms on Words |
| R. Backhouse | Making formalism work for us |
| R. Cole | A promising approach to complexity measures for computation over splay trees |
| J. Dixon | Computations in Galois Theory |
| J. Goguen | Object Oriented Programming as a natural extension of functional programming |
| R. Hindley | The Coppo-Denzani Type System |
| J. Lloyd | Current Theoretical Issues in Logic Programming |
| M. Smyth | The thesis that computable functions are uniformly continuous |
| H. Barringer | The future of imperative logic |
| P. Flajolet | Some recent trends in the average-case analysis of algorithms |
| S. Goldwasser | Zero Knowledge Interactive Proofs |
| J.M.E. Hyland | Synthetic domain theory - the story so far |
| C. Lengauer | Systolic design and systolising compilation |
| U. Martin | What can you do with an equational reasoning theorem prover? |
| L. Wallen | From proof theory to proof search: some remarks on the design of proof procedures |
| H. Barendregt | Feasible Full Formalisation |
| A. Bundy | Automatic generation of Program Synthesis Proofs |
| M. Dyer | Volume and related computational problems |
| J. Hughes | Naturality, Polymorphism and Compile-time analysis |
| C. Jones | Interference resumed |
| C. O'Dunlaing | Computational problems in geometry |
| C. Sturtivant | Some issues in algebraic complexity |
| B. Vallee | Algorithms for integer factorization |
| J.L. Balcazar | The structural approach to complexity theory |
| A.M. Gibbons | Implementing P-RAM algorithms on distributed memory models of parallel computation |
| Y. Gurevich | Evolving algebras |
| W. Hodges | The logical background to specification |
| T.S.E. Maibaum | Design Structures: configuring specifications |
| J.E. Savage | VLSI analysis, synthesis and theory |
| C.P. Stirling | Verification via model checking |
| M. Atkinson | The capability of priority queues as data transformers |
| J. Lloyd | Declarative Logic Programming |
| G. Plotkin | A logic for parametric polymorphism |
| J. Steyaert | On the average complexity of rewriting systems |
| B. Tennant | Correctness of data representations in Algol-like languages |
| R. Bird | Relational program derivation |
| D. Bree | The semantics of natural language temporal prepositions and conjunctions |
| R. Cori | Building automata with time stamps |
| P.E. Dunne | Introduction to Boolean Function Complexity (Tutorial) |
| M. Holcombe | X-Machines - What are they? (Tutorial) |
| M. Jerrum | The computational complexity of counting |
| P. Spirakis | Paradigms for fast parallel approximations to problems that are hard to parallelise |
| J.W. de Bakker | Metric Semantics |
| J. Heering | Algebraic specifications and proofs by induction |
| M. Hennessey | Higher--Order Processes and Their Models |
| J.R. Hindley | Counting the Inhabitants of a type |
| F. Moller | The Computational Complexity of Bisimilarity |
| I.A. Stewart | Descriptive Complexity Theory (Tutorial) |
| D.E. Rydeheard | Category Theory and Game Semantics |
| J.V. Tucker | Synchronous Concurrent Algorithms |
| P. Aczel | Formalising abstract algebra in constructive type theory |
| G. Birtwistle | Specifying and verifying AMULET in CCS |
| E. Brinksma | Formal models for testing: an interaction between theory and practice |
| K. Hanna | Reasoning about digital systems |
| U. Martin | The princess and the plumber, the role of mathematics in computer science |
| M. Smid | Spanners: approximating the complete Euclidean graph |
| J. Toran | On the complexity of the graph isomorphism problem |
| D. Turner | Total functional programming |
| M. Amos | The Complexity and Viability of DNA Computation (tutorial) |
| T.J.M. Bench-Capon | Machines Can't Think |
| P.E. Dunne | An Overview of Lower Bound Techniques in Monotone Boolean Function Complexity |
| J. Esparza | Model-checking Pushdown Automata |
| M. Fairtlough | Abstraction, constraints and the lambda calculus (tutorial) |
| M. Gordon | Event and cycle semantics of hardware description languages |
| E. Robertson | Combinatorial and decidability questions in semigroups of words |
| E. Robinson | Logic and logical relations |
| C. Tofts | Ants, Shrimps, and other asynchronous hardware |
| R. Burstall | Teaching Logic to Programmers |
| J. Davenport | Is Computer Algebra the same as Computer Symbolic Mathematics? |
| A. Edalat | Exact Real Number Computation Using Linear Fractional Transformations |
| I. Gent | Two Become One: Theory and Experiment |
| L. Goldberg | Contention Resolution in Mulitple-Access Channels |
| A. Macintyre | Connections between model theory and volume estimates |
| L. Ong | Game Semantics |
| R. Thomas | Syntactic Monoids - a Survey |
| W. Fokkink | Within ARMs Reach: Compilation of Rewrite Systems |
| M. Hofmann | Linear Types and non-size increasing polynomial time computation |
| W.F. McColl | BSP Computing |
| I. Pratt | Qualitative Spatial Reasoning and the Semantic Knife-edge |
| D. Pym | Reasource Semantics, Bunched Logic and a Relevant Logical Framework |
| G. Winskel | Linearity in Distributed Computation |
| M. Worboys | Computing with Geospatial Data: Challenges to Theory |
| P.E. Dunne | Computational Problems (Some Directions but no Solutions) |
| G. Rozenberg | DNA Computing in vivo - gene assembly in ciliates |
| L.G. Valiant | Robust Logic |
| K. Weihrauch | Computable Analysis |
| M. Wooldridge | The Verification Problem for Agent Communication Languages |
| X. Yao | Some Theoretical Issues in Evolutionary Computation |
| Muffy Calder | A Day in the Life of a Spin Doctor |
| Ursula Martin | Computational math: the new challenge for computational logic |
| Farron Moller | Techniques for decidability and undecidability for bisimilarity (Tutorial) |
| Joachim Parrow | An introduction to the pi-Calculus (Tutorial) |
| Mike Paterson | Getting your message across, but nicely: an introduction to contention resolution |
| Simon Peyton-Jones | Asynchronous Exceptions in Concurrent Haskell |
| Alexander Rabinovich | Temporal Logic over Branching Time: Expressiveness and Complexity |