Alex Simpson: Home Page
Alex Simpson
Professor of Foundations of Computer Science
Laboratory for Foundations
of Computer Science (LFCS)
School of Informatics,
University of Edinburgh
Informatic Forum
10 Crichton Street
Edinburgh EH8 9AB, UK.
Email:
Alex.Simpson@ed.ac.uk
Phone: +44 131 650 5113
Fax: +44 131 667 7209
My research interests include: semantic models
of computation,
especially domain-theoretic and topological models;
type theories and their models, especially type theories
for computational effects; logic and
proof theory in general, and proof systems for program logics
in particular; intuitionistic set theories, their models and
applications; constructive mathematics and its
computational content; foundational
models of probability and randomness.
Recent:
18 January 2015:
Slides for my talk
Independence set theory and randomness
given at Leeds Logic Seminar .
14-18 April 2014:
Slides for (so far) lectures 1-5 of my course
Semantic Structure for Programming Languages with Effects , PhD School, Luminy, France. Lecture 6 still to be added.
25 February 2014:
Slides for my talk
Category-theoretic structure for conditional independence
given at
Cambridge Category Theory Seminar .
January 2014:
Slides for my course
Real Numbers in Type Theory
given at
Days in Logic 2014 .
29 November 2013:
Eighth Scottish Category Theory Seminar ,
International Centre for Mathematical Sciences, Edinburgh.
July 2013: Slides for my talk
Conditional Independence in Categories
at
Topology, Algebra, and Categories in Logic 2013 .
November 2012: Slides for my talk
Cyclic Arithmetic (in context)
at
Collegium Logicum 2012: Structural Proof Theory .
November-December 2011:
Joint tutorial, with Martín Escardó. on
Categorical axioms for functional real-number computation , at MAP 2011 , Lorentz Center, Leiden, Netherlands
25 November 2011:
Fifth Scottish Category Theory Seminar ,
Informatics Forum, University of Edinburgh.
July 2011:
Summary of a research project on
Linear Observations and Computational Effects
May 2011: Slides for my
MFPS 2011
talk,
Sequent calculus for (probabilistic) process
verification
April 2011: Slides for my
ALCOP 2011
talk,
On Proof by Infinite Descent
17-18 March 2011:
European Workshop on Computational Effects ,
Ljubljana, Slovenia.
10 July 2010:
Proof Systems for Program Logics ,
LICS -affiliated workshop at
FLoC 2010
9 July 2010:
Slides for my
LOLA 2010 talk,
Linear Types for Continuations
29 June 2010:
Scott in Scotland , Informatics Forum, University of Edinburgh.
21 May 2010:
Second Scottish Category Theory Seminar ,
Informatics Forum, University of Edinburgh.
6-7 May 2010:
Set Theory, Classical and Constructive ,
Amsterdam.
September 2009:
Slides for my Linearity talk:
Linearly-used Continuations and Self-duality
July 2009:
Slides for my CCC talk:
The Locale of Random Sequences
January 2009:
Slides for my POPL talk:
Linear Types for Computational Effects
January 2009:
Slides for my talk at New Interactions Between Analysis, Topology and
Computation:
"Spaces of Valuations" Revisited
February 2008:
Slides for my talk at the
XXIII Incontro di Logica
Intuitionistic Set Theory
and its Models
December 2007:
Summary of a research project on
relational parametricity for computational effects
September 2007:
Slides for my Domains VIII talk
Neoclassical domain theory
July 2007:
Slides for my LICS/LC 2007 talk
Formal Borel sets - a
proof-theoretic approach
April 2007:
Slides for my MFPS XXIII tutorial
Beyond Classical
Domain Theory
December 2006:
Summary of a research project on
topological domain theory
September 2006:
Symposium for Gordon Plotkin , Edinburgh, 7-8 September 2006