Personal tools
You are here: Home Events Abstract Archives 1999

1999

Page Lossy Counter Machines and their Applications
Richard Mayr Laboratory for Foundations of Computer Science Division of Informatics University of Edinburgh 4pm Tuesday 26 January Room 2511, JCMB, King's Buildings
Page A Semantics for Imprecise Exceptions
Simon Peyton Jones Microsoft Research Cambridge 4pm Tuesday 23 February 1999 Room 2511, JCMB, King's Buildings In addition to this seminar, on Wednesday Simon will give the Informatics Colloquium Scripting COM components in Haskell. This is at 4pm in the David Hume Tower, Lecture Theatre C. Contact Samson Abramsky for further details.
Page Computing Total, Computable Functionals
Dag Normann Department of Mathematics University of Oslo 4pm Monday 15 February 1999 Room 2511, JCMB, King's Buildings Dag will be visiting on Monday only, hosted by Martin Escardo.
Page Symmetry and the Elementary Theory of Computing
Peter Hines School of Mathematics University of Bangor 4pm Tuesday 9 February 1999 Room 2511, JCMB, King's Buildings Peter will be visiting from Monday to Thursday, hosted by Samson Abramsky.
Page Resource-Bounded Quantification or Poor Man's Probability
Michiel van Lambalgen Department of Computer Science University of Amsterdam 4pm Tuesday 23 March Room 2511, JCMB, King's Buildings Michiel is visiting HCRC until June 1999, collaborating with Keith Stenning. His talk Vision, Language and Logic on March 11 for the Institute for Representation and Reasoning applied the logic presented here to the connection between vision and natural language.
Page Purely Syntactic Normalization by Evaluation
René Vestergaard Department of Computing and Electrical Engineering Heriot-Watt University 4pm Tuesday 16 March 1999 Room 2511, JCMB, King's Buildings
Page Exact Real Arithmetic using Möbius Transformations
Peter Potts Imperial College and Pole Star Space Applications Ltd 4pm Tuesday 2 March 1999 Room 2511, JCMB, King's Buildings
Page Type Inference for Intersection Types with Expansion Variables
Joe Wells Department of Computing and Electrical Engineering Heriot-Watt University 4pm Wednesday 21 April 1999 Room 2511, JCMB, King's Buildings
Page Towards a theory of bisimulation for local names.
Julian Rathke School of Cognitive and Computing Sciences (COGS) University of Sussex 4pm Tuesday 4 May 1999 Room 2511, JCMB, King's Buildings
Page On the complexity of (optimal) reduction: sublinear logics and lambda-calculus
Simone Martini Department of Mathematics and Computer Science University of Udine 4pm Thursday 6 May 1999 Room 2511, JCMB, King's Buildings
Page Real functions finitely computable using affine-like incremental representations.
Michal Konecny School of Computer Science University of Birmingham 4pm Friday 21 May 1999 Room 2511, JCMB, King's Buildings
Page Continuous Markov processes - approximations and metrics
Radha Jagadeesan Loyola University, Chicago 4pm Tuesday 1 June 1999 Room 2511, JCMB, King's Buildings
Page Automatic verification of probabilistic real-time systems
Marta Kwiatkowska School of Computer Science University of Birmingham 4pm Tuesday 8 June 1999 Room 2511, JCMB, King's Buildings
Page Modal logics for mobile ambients
Luca Cardelli Microsoft Research, Cambridge 4pm Tuesday 15 June 1999 Room 2511, JCMB, King's Buildings
Page A version of effective topology
Andrej Bauer School of Computer Science, Carnegie Mellon University, Pittsburgh 11am Friday 9 July 1999 Room 2511, JCMB, King's Buildings
Page Algebras of intervals and a logic of conditional assertions
Peter Milne Department of Philosophy, University of Edinburgh 4pm Tuesday 13 July 1999 Room 2511, JCMB, King's Buildings
Page Object-oriented specification by typed Gurevich machines
Alexandre Zamulin Institute of Informatics Systems, Siberian Division of Russian Academy of Sciences 4pm Tuesday 20 July 1999 Room 2511, JCMB, King's Buildings
Page System Description, Abstraction, and Verification: A Uniform Treatment of Quality and Quantity
Michael Huth Department of Computing and Information Sciences Kansas State University 4pm Tuesday 27 July 1999 Room 2511, JCMB, King's Buildings
Page Objects dynamically changing class
Mariangiola Dezani-Ciancaglini Department of Computer Science University of Torino 4pm Tuesday 3 August 1999 Room 2511, JCMB, King's Buildings (Joint work with Sophia Drossopoulou, Ferruccio Damiani and Paola Giannini.)
Page Shape theory: FISh implementation
Barry Jay School of Computing Sciences University of Technology, Sydney 4pm Tuesday 24 August 1999 Room 2511, JCMB, King's Buildings
Page Safety of formulas in query languages, in arithmetics, and in set theory
Arnon Avron School of Mathematical Sciences Tel-Aviv University 4pm Tuesday 31 August 1999 Room 2511, JCMB, King's Buildings
Page On the expressive power of CTL*
Faron Moller Computing Science Department Uppsala University 4pm Tuesday 14 September 1999 Room 2511, JCMB, King's Buildings
Page Towards a theory of general processes
Marcelo Fiore School of Cognitive and Computing Sciences University of Sussex 4pm Tuesday 26 October 1999 Room 2511, JCMB, King's Buildings
Page A theory of efficiency for Markovian processes
Marco Bernardo Department of Computer Science University of Bologna, Italy 4pm Tuesday 23 November 1999 Room 3218, JCMB, King's Buildings [NOTE NON-STANDARD ROOM]
Page Recent advances on o-minimality, and associated algorithmic problems
Angus Macintyre Department of Mathematics and Statistics, University of Edinburgh 4pm Tuesday 30 November 1999 Room 2511, JCMB, King's Buildings
Page Computational interpretations of resource-sensitive logics
James Harland Royal Melbourne Institute of Technology Visiting Queen Mary and Westfield College, London 4pm Tuesday 7 December 1999 Room 2511, JCMB, King's Buildings
Page Learning in Natural Language
Dan Roth
Document Actions