============================================= 2019 DOCTORAL FELLOWSHIPS IN COMPUTER SCIENCE UNIVERSITY OF BIRMINGHAM, UK ============================================= We are happy to announce that applications are now open for the Doctoral Fellowship programme in Computer Science at the University of Birmingham, UK, for start in October 2019. These Fellowships fund a 4-year full-time programme of PhD study, and provide a elevated stipend of ??18,150 per year (tax-free, healthcare provided for free). Successful applicants will be expected to contribute to the research and teaching life of the School of Computer Science, with a maximum teaching load of 1 day per week, averaged over the year. The School of Computer Science has a large and thriving Theoretical Computer Science research group, with a particular focus on category theory and its applications to the logical foundations of computer science. Among our research interests are: - category theory and higher category theory; - type theory; - homotopy type theory and univalent foundations; - formal proof; - lambda-calculus and computational effects; - topology and domain theory; - constructive mathematics; - quantum computing; - semantics; - program compilation. Our group currently has 11 permanent staff (see list below) and more than a dozen PhD students. We have a weekly seminar, as well as more informal meetings and reading groups. Information on all of this can be found on our webpage: http://www.cs.bham.ac.uk/research/groupings/theory/ The Fellowships are available to UK and EU citizens only. However, partial fellowships may still be available to Non-EU overseas students depending on circumstances. Further information about PhD applications may be found here: http://www.cs.bham.ac.uk/admissions/postgraduate-research/ If you are considering applying, please contact a potential supervisor from the list below. Benedikt Ahrens <b.ahrens@cs.bham.ac.uk> (http://www.cs.bham.ac.uk/~ahrensb). Categorical semantics of programming languages, univalent foundations, computer theorem proving. Mart??n Escard?? <m.escardo@cs.bham.ac.uk> (http://www.cs.bham.ac.uk/~mhe/). Topology, computation with infinite objects, constructive mathematics, univalent mathematics. Dan Ghica <d.r.ghica@cs.bham.ac.uk> (http://www.cs.bham.ac.uk/~drg/). Dataflow programming languages, foundations of machine learning, game semantics. Achim Jung <a.jung@cs.bham.ac.uk> (http://www.cs.bham.ac.uk/~axj/). Mathematical structures in the foundations of computing: logic, topology, order, domain theory. Paul Blain Levy <p.b.levy@cs.bham.ac.uk> (http://www.cs.bham.ac.uk/~pbl/). Denotational semantics, computational effects and call-by-push-value, nondeterminism, category theory, coalgebra, game semantics. Uday Reddy <u.s.reddy@cs.bham.ac.uk> (http://www.cs.bham.ac.uk/~udr/). Semantics of state, separation logic. Eike Ritter <e.ritter@cs.bham.ac.uk> (http://www.cs.bham.ac.uk/~exr/). Security protocol verification. Jamie Vicary <j.o.vicary@bham.ac.uk> (http://www.cs.bham.ac.uk/~vicaryjo/). Quantum computing, higher-dimensional algebra, category theory, quantum field theory, formal proof. Noam Zeilberger <n.zeilberger@cs.bham.ac.uk> (http://www.cs.bham.ac.uk/~zeilbern/). Type systems and programming languages, category theory and proof theory, as well as their interactions with combinatorics. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]