Anton Lorenzen

Junior Research Fellow, Clare College, University of Cambridge

I am a Junior Research Fellow in Computer Science at Clare College. My research concerns the efficient implementation of functional programming languages, with a special focus on functional approaches to classic algorithms and data structures. Concretely, I work on precise reference counting, graded modal type systems, and models of persistence.

I carried out my PhD research at the University of Edinburgh with Sam Lindley and Daan Leijen. During my PhD, I interned once at Microsoft Research, where I designed functional top-down algorithms in Koka, and twice at Jane Street, where I wrote the initial version of the uniqueness mode and in-place reuse of OxCaml. I hold a BSc in Mathematics and an MSc in Computer Science from the University of Bonn, Germany.

afl43.hidden@cam.ac.uk

Anton Lorenzen

Publications

IMLA 2026

A Value Trick for Modal Type Systems

Anton Lorenzen, Wenhao Tang, Sam Lindley

ICFP 2025 Distinguished Paper

First-Order Laziness

Anton Lorenzen, Daan Leijen, Wouter Swierstra, Sam Lindley

JFP Special Issue

Tail Recursion Modulo Context: An Equational Approach (extended version)

Daan Leijen, Anton Lorenzen

OOPSLA 2025

Modal Effect Types

Wenhao Tang, Leo White, Stephen Dolan, Daniel Hillerström, Sam Lindley, Anton Lorenzen

PLDI 2024

The Functional Essence of Imperative Binary Search Trees

Anton Lorenzen, Daan Leijen, Wouter Swierstra, Sam Lindley

POPL 2023

Tail Recursion Modulo Context: An Equational Approach

Daan Leijen, Anton Lorenzen

Master Thesis · University of Bonn

Optimizing Reference Counting with Borrowing

supervised by Daan Leijen and Heiko Röglin

CICM 2022

Web-Naproche

Anton Lorenzen, Peter Koepke

CICM 2021

Beautiful Formalizations in Isabelle/Naproche

Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Erik Sturzenhecker

CADE 2021

The Isabelle/Naproche Natural Language Proof Assistant

Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Makarius Wenzel

ITP 2021

A Natural Formalization of the Mutilated Checkerboard Problem in Naproche

Adrian De Lon, Peter Koepke, Anton Lorenzen

AITP 2021

Dealing with Soft Types in Naproche's Logical Backend

Adrian De Lon, Peter Koepke, Anton Lorenzen

CICM 2020

Interpreting Mathematical Texts in Naproche-SAD

Adrian De Lon, Peter Koepke, Anton Lorenzen

AITP 2020

ForTheL for Type Theory

Adrian De Lon, Peter Koepke, Anton Lorenzen