Matthew's research interests lie in applying mathematical rigour to various areas of Computer Science. He received his PhD at the University of Cambridge in 2019, using algebraic methods to prove strong theoretical guarantees about the worst case behaviour of network routing protocols and other asynchronous iterative algorithms. He also has a strong interest in formal verification and since 2017 has been in charge of the development of the standard library for the Agda proof assistant and programming language.

---