Theoretical Computer Science

Overview

We are a group of (mostly) theoretical computer scientists who explore fundamental concepts in computation and programming language semantics. This often involves profound and surprising connections between different areas of computer science and mathematics. From category theory to λ-calculus and computational effects, from topology to constructive mathematics, from game semantics to program compilation, our research is diverse and continues to provide new insight and underlying structure.

PhD opportunities

See our poster here.

We welcome applicants for PhD studies in any of these areas. Please email for more information, or contact individual researchers.

News

Staff:

 Research areas
Martín Escardó topology, computation with infinite objects,
constructive mathematics, intuitionistic type theory
Fredrik Nordvall Forsberg intuitionistic type theory, category theory
Dan Ghica game semantics, heterogeneous computing,
model checking
Achim Jung mathematical structures in the foundations of computing:
logic, topology, order
Neel Krishnaswami
(from Autumn 2013) 		type theory, verification, substructural logic,
interactive computation
Paul Levy denotational semantics, λ-calculus with effects,
nondeterminism, category theory, game semantics
Uday Reddy semantics of state, separation logic
Eike Ritter security protocol verification
Umberto Rivieccio algebraic logic, many-valued logic, universal algebra,
logics for AI, philosophy of mathematics
Satnam Singh reconfigurable computing
Hayo Thielecke abstract machines, concurrent and functional programming,
software security
Steve Vickers constructive mathematics and topology,
category theory and toposes

PhD Students:

Student Supervisor
Zaid Al-ZobaidiDan Ghica
Liang-Ting ChenAchim Jung
Olle FredrikssonDan Ghica
Juliusz KopczewskiUday Reddy
Joseph LentonAndrew Howes and Achim Jung
Asiri RathnayakeHayo Thielecke
Guillaume RaynaudSteve Vickers
Alex SmithDan Ghica
Maxim StryginHayo Thielecke
Chuangjie XuMartín Escardó

Seminars