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