OXFORD UNIVERSITY COMPUTING LABORATORY

The Strachey Lectures in Computing Science

View all seminar series

This is a termly series of Distinguished Lectures named after Christopher Strachey, the first Professor of Computation at Oxford University.

Christopher Strachey was the first leader of the Programming Research Group (PRG), part of the Oxford University Computing Laboratory (OUCL), founded in 1965. He was the first Professor of Computation at Oxford, succeeded by Sir Tony Hoare in 1977 after his untimely death. With Dana Scott he founded the field of denotational semantics, providing a firm mathematical foundation for programming languages.


forthcoming seminars | previous seminars

Tuesday 14th October (week 1, Michaelmas Term 2008) Data-Intensive Scalable Computing: Taking Google-Style Computing Beyond Web Search Randy Bryant (Carnegie Mellon, School of Computer Science)

Tuesday 13th May (week 4, Trinity Term 2008) 50 in 50 Dr Guy Steele and Dr Richard Gabriel (Sun Microsystems & IBM Research)

Tuesday 15th January (week 1, Hilary Term 2008) Can Programming be Liberated, Period? Professor David Harel (Dept. of Computer Science and Applied Mathematics, Weizmann Institute of Science)

Tuesday 30th October (week 2, Michaelmas Term 2007) The world is covariant: is it safe? Professor Bertrand Meyer (Software Engineering, ETH Zurich)

Tuesday 1st May (week 2, Trinity Term 2007) On Repairing Reasoning Reversals via Representational Refinements Professor Alan Bundy (School of Informatics, University of Edinburgh)

Tuesday 16th January (week 2, Hilary Term 2007) Defunctionalized Interpreters for Higher-Order Programming Languages Professor Olivier Danvy (Department of Computer Science, University of Aarhus, Denmark)

Tuesday 17th October (week 2, Michaelmas Term 2006) Reliable Systems Engineering Professor Thomas A Henzinger (School of Computer & Communication Sciences, EPFL, Lausanne, Switzerland)

Tuesday 9th May (week 2, Trinity Term 2006) Toward a Grainless Semantics for Shared-Variable Concurrency John Reynolds (Computer Science Department, Carnegie Mellon University)

Tuesday 17th January (week 2, Hilary Term 2006) The Design of A Formal Property-Specification Language Professor Moshe Y Vardi (Rice University)

Tuesday 8th November (week 2, Michaelmas Term 2005) A Family of Mathematical Documents for Professional Software Documentation Professor David Parnas (Software Quality Research Laboratory, University of Limerick)

Tuesday 26th April (week 2, Trinity Term 2005) The unreasonable effectiveness of logic Professor Philip Wadler (School of Informatics, University of Edinburgh)

Tuesday 18th January (week 2, Hilary Term 2005) Software Engineering Mathematics Professor Jean-Raymond Abrial (Swiss Federal Institute of Technology, Zurich)

Tuesday 2nd November (week 2, Michaelmas Term 2004) Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing Professor Richard Brent (University of Oxford)

Tuesday 27th April (week 2, Trinity Term 2004) The Limits of Software Grady Booch (IBM Fellow)

Tuesday 20th January (week 2, Hilary Term 2004) Automated Reasoning and Formal Verification Professor Mike Gordon (University of Cambridge)

Tuesday 14th October (week 2, Michaelmas Term 2003) Curated Databases Dr Peter Buneman (University of Edinburgh)

Tuesday 29th April (week 2, Trinity Term 2003) The Interior-Point Revolution in Constrained Optimization: History, Recent Developments, and Lasting Consequences Professor Margaret H Wright (Silver Professor of Computer Science and chair of the Computer Science Department, Courant Institute of Mathematical Sciences, New York University)

Tuesday 21st January (week 2, Hilary Term 2003) The Challenge of e-Science Professor Tony Hey (Director of the UK e-Science Core Programme, EPSRC)

Tuesday 15th October Hyper-Encryption and Ever Lasting Secrets Michael Rabin (Harvard University)

Tuesday 23rd April Spatial Logics for Distributed Systems Luca Cardelli (Microsoft Research, Cambridge)

Tuesday 22nd January Towards the verifying compiler Professor Sir Tony Hoare FRS (Microsoft Research, Cambridge)

Tuesday 9th October Bigraphical Reactive Systems Professor Robin Milner (University of Cambridge Computer Laboratory)

Tuesday 24th April My Recollections of Operating System Design Professor Edsger W Dijkstra (University of Texas at Austin)

Tuesday 16th January Structured Programming and Literate Programming Professor Don Knuth (Stanford University)

Tuesday 10th October Contention Resolution Prof Mike Paterson (University of Warwick)

Tuesday 2nd May How to write a proof Leslie Lamport (Compaq Systems Research Center)

Tuesday 25th January The Challenge of Optimality in Program Specialisation Prof John Hughes (Chalmers University of Technology)

Tuesday 12th October From Computation to Interaction: towards a science of information Samson Abramsky (University of Edinburgh)

Tuesday 27th April Computation as a Tool for Understanding Genomes Richard M Karp (University of Washington)

Tuesday 19th January The Praxis of Software Engineering Martyn Thomas

Tuesday 13th October Computer Systems Research: Past and Future Butler W Lampson (Architect, Microsoft Corporation)

Tuesday 5th May WW II Codebreaking with the Bombe and Colossus Anthony E Sale, Hon FBCS (Museums Director, Bletchley Park)

Tuesday 24th February Prooflets: A general paradigm for auto-certifiable mobile code and its implementation in the Coq Proof Assistant Gérard Huet (INRIA)

Tuesday 14th October Hints on Programming Language Design Professor Niklaus Wirth (ETH, Zurich)

Tuesday 6th May Where deduction meets exploration Professor Amir Pnueli (Weizmann Institute of Science, Israel)

Tuesday 28th January Re-inventing the Computer Professor David May (University of Bristol)

Tuesday 22nd October Powerlist: A Structure for Parallel Recursion Professor Jay Misra (University of Texas at Austin)

Tuesday 30th April Denotational Semantics: an Unbalanced Perspective Professor Gordon Plotkin (Department of Computer Science, University of Edinburgh)

Tuesday 23rd January The Network Computer Dr Andy Hopper (Reader in Computer Technology, University of Cambridge and Vice President Research, Olivetti)

Tuesday 3rd October Twenty-Five Years of Domain Theory Dana S Scott (Hillman University Professor of Computer Science, Mathematical Logic and Philosophy, Carnegie Mellon University, Pittsburgh, Pennsylvania)

Random Image
Random Image
Random Image