Matt Earnshaw

Matt Earnshaw is a Research Fellow in Programming Languages at Tallinn University of Technology, specializing in category theory applications to computer science with emphasis on monoidal categories and string diagrams.

His academic background includes a PhD in Computer Science from Tallinn University of Technology (2020-2024) and an MSc in Physics from Imperial College London (2015).

Research focuses on extending formal language theory through categorical structures, particularly developing regular languages for planar string diagrams. His work bridges abstract category theory with computational models, investigating automata recognizability and algebraic properties of monoidal languages. Key contributions include generalizing classical pumping lemmas to diagrammatic contexts and exploring trace theory via symmetric monoidal categories.

Recent publications demonstrate consistent advancement in theoretical computer science, where categorical methods systematically generalize automata theory and concurrency models to string diagram frameworks. This research creates new connections between algebraic structures and computational semantics.