# Homepage for Anton Golov

## General

- Anton Golov (they/them, die/hen/hun);
email,
GitHub,
Twitter.
- Mathematics PhD student at Radboud University (Nijmegen, The Netherlands).
**On leave to work at JetBrains until January 2024**, where I'm adding
formal verification to Kotlin.
- Research interests:
- Mathematical foundations of computer science, in particular type theory, category theory,
computability theory, constructive logic, proof formalisation, and univalent foundations.
- Software engineering, in particular programming language development (Rust!), program
verification, and functional programming.

- Other interests: tea, sci-fi & fantasy, go (board game), Lojban.
- Sometimes known as Cactus and/or jesyspa.

## Articles

- A. Golov, S. A. Terwijn,
*Fixpoints and relative precompleteness*,
Computability 2022, vol 11, no. 2, pp. 135-146, 2022. [published, arXiv]
- A. Golov, S. A. Terwijn,
*Embeddings between partial combinatory algebras*,
arXiv 2022. [arXiv]
- H. Geuvers, A. Golov,
*Directed branching bisimulation via apartness and positive logic*,
arXiv 2022. [arXiv]