[Agda] PhD studentships at the University of Strathclyde

[Fredrik Nordvall Forsberg]

Dear all,

The Department of Computer and Information Sciences at the University
of Strathclyde is welcoming applications for PhD studentships. At least
four fully funded positions are available for UK home students, and
funding covers tuition fees, a stipend for living expenses, and a
small travel budget. *Unfortunately, the funding provided is not enough
for non-UK tuition fees.*

Applicants in the area of the Mathematically Structured Programming
(MSP) Group are strongly encouraged to apply. Within MSP, we see the
mathematical foundations of computation and programming as
inextricably linked, and study one so as to develop the other. This
reflects the symbiotic relationship between mathematics, logic, and
programming — any attempt to sever this connection will diminish each
component.

For more information about MSP, please see:

     https://msp.cis.strath.ac.uk/

If you are interested in applying, please contact a potential
supervisor as soon as possible, and *before 25th November 2024*.
Potential supervisors in the group are:

* Guillaume Allais: type-driven programming, correct-by-construction
   methodology, implementations of type theory, generic programming,
   proof automation, user experience of interactive compilers.

* Robert Atkey: type theory and computational complexity, resource
   awareness in logic and programming languages, substructural logics,
   applications of mathematical structure to programming language
   design, domain specific languages for specification and verification.

* Neil Ghani: category theory, type theory, functional programming,
   game theory, machine learning.

* Jules Hedges: applications of category theory, type theory,
   functional programming, ... in economics, machine learning,
   statistics, control, ...

* Ross Horne: concurrency and logic, and their applications to
   analysing threats to security and privacy.

* Clemens Kupke: coalgebraic modelling of systems, logical
   verification/model-checking, fixpoint logics and their
   game-theoretic semantics, automata theory and automata learning.

* Conor Mc Bride: dependent type theory, functional programming,
   effects and handlers, programming language design and metatheory,
   and the category theoretic underpinnings of all of the above.

* Jan de Muijnck-Hughes: trustworthy systems using type-driven
   approaches; namely applications of type theory, dependently typed
   functional programming, and programming (& domain specific) language
   design and metatheory.

* Fredrik Nordvall Forsberg: dependent type theory, especially
   homotopy type theory, and its semantics and applications,
   constructive mathematics, categorical semantics of programming
   languages.

Best wishes,
The MSP Group
University of Strathclyde