Research Assistant/Associate in Interactive Proof Assistants (Fixed Term)

Fixed-term and Duration

The position is funded for 24 months, with an anticipated start date of September 2026, subject to agreement.

About the Department

The Department of Computer Science and Technology is an academic department that encompasses computer science along with many aspects of engineering, technology and mathematics. It has a worldwide reputation for academic research with consistent top research ratings, and an open and collaborative culture supporting revolutionary fundamental computer science research and strong cross‑cutting collaborations internally and externally.

Project Overview

Applications are invited for a Research Associate to join the New Spaces for Denotational Semantics project. The project aims to develop an axiomatic framework for higher‑dimension synthetic mathematics, unifying the domain‑theoretic semantics of programming languages with higher category theory, and will focus on the development of a new interactive proof assistant in its final phase.

Role and Responsibilities

The role holder will lead the development of a new proof assistant for neutral constructive mathematics in collaboration with the Principal Investigator. You will contribute to open‑source software that supports this project and future related ones, and write up research results for presentation and publication at conferences, journals, and blogs.

Qualifications

The successful candidate must hold or be close to obtaining a PhD in Computer Science or a closely related discipline, or possess equivalent professional experience. Appointment at Research Associate level is dependent on having a PhD; candidates who have submitted but not yet received their PhD will be appointed at Research Assistant level, which will be amended to Research Associate once the PhD has been awarded.

Key Topics and Expectations

• State‑of‑the‑art algorithms used in the implementation of dependent type theory, including but not limited to: normalisation by evaluation, glued evaluation, bidirectional elaboration, stable elaboration, higher‑order dynamic pattern unification, etc.
• Performance analysis and optimisation of interactive proof assistants.
• Homotopy type theory and univalent foundations.
• The mechanisation of mathematics in type theory using proof assistants such as Agda, Coq, Lean, or Isabelle, and design of libraries for mathematics.

Benefits

In addition to the base salary stated above, the successful candidate will receive an additional 2.5% supplement to their pay.

Equality, Diversity and Inclusion

The University actively supports equality, diversity and inclusion and encourages applications from all sections of society.

#J-18808-Ljbffr