Published numerous papers on topics such as proof mining, proof interpretations (particularly Gödel's Dialectica), probability theory and stochastic optimization, nonlinear analysis and optimization, higher order computability, termination and complexity of programs, denotational semantics and domain theory, functional programming languages, well-quasi-orderings, constructive algebra, and the axiom of choice and its variants; supervised several PhD students and postdocs.
Research Experience
Currently a Senior Lecturer (equivalent to Associate Professor) in the Department of Computer Science at the University of Bath, and a member of the Mathematical Foundations of Computation group; Principal Investigator for the EPSRC project 'Imperative Programs from Proofs'; organizer of the Southern and Midlands Logic Seminar; co-founder and committee member of the Proof Theory Virtual Seminar during the pandemic.
Education
Before joining Bath, he worked at the Logic Group at TU Darmstadt and the Institut des Hautes Études Scientifiques in Paris. Specific educational background details are not provided.
Background
Mathematician and Computer Scientist, with main research areas in proof theory, functional analysis and optimization, computability theory, and program semantics.