I’m currently a postdoc jointly in the School of Computer Science at Carnegie Mellon University and the Department of Mathematics at Stockholm University. In September 2019 I will start as an assistant professor in the Computational Mathematics division in the Department of Mathematics at Stockholm University. My main research interests are currently in Homotopy Type Theory and Univalent Foundations, in particular computational justifications for univalence and higher inductive types using cubical type theory. I am also interested in constructive mathematics, logic and type theory, category theoretical foundations, functional programming, and computer formalization of mathematics and computer science.

Before this I was a postdoc in the Marelle team at Inria Sophia-Antipolis. I also spent a year as a member of the School of Mathematics at the Institute for Advanced Study in Princeton working on formalization of mathematics in Univalent Foundations with Vladimir Voevodsky.

I defended my PhD thesis at the Department of Computer Science and Engineering at Chalmers University of Technology and University of Gothenburg under the supervision of Thierry Coquand in December 2014.

## Software

I’m actively developing and contributing to:

Cubical Agda - A version of Agda with cubical primitives making it into a full-blown proof assistant with support computational univalence and user defined higher inductive types.

UniMath - A Coq library for formalizing mathematics using the univalent point of view.

I have previously developed:

cubicaltt - A Haskell implementation of a type theory based on a constructive model in cubical sets. This system provides a computational interpretation to notions from Univalent Foundations and Homotopy Type Theory, most notably the univalence axiom. This has now been succeeded by Cubical Agda.

yacctt -

*yet another cartesian cubical type theory*. This is a version of cubicaltt based on Cartesian Cubical Type Theory. This has been succeeded by redtt.cubical - A predecessor of cubicaltt.

The Coq Effective Algebra Library (CoqEAL) - A library for conveniently combining proving and efficient computations in the Coq proof assistant.