Performance Optimizations for Functional Programming Languages
Tail Recursion Modulo Context: An Equational Approach (extended version)
Daan Leijen, Anton Lorenzen
Modal Effect Types
Wenhao Tang, Leo White, Stephen Dolan, Daniel Hillerström, Sam Lindley, Anton Lorenzen
Oxidizing OCaml with Modal Memory Management
Anton Lorenzen, Leo White, Stephen Dolan, Richard A. Eisenberg, Sam Lindley
The Functional Essence of Imperative Binary Search Trees
Anton Lorenzen, Daan Leijen, Wouter Swierstra, Sam Lindley
FP²: Fully in-Place Functional Programming
Anton Lorenzen, Daan Leijen, Wouter Swierstra
Tail Recursion Modulo Context: An Equational Approach
Daan Leijen, Anton Lorenzen
Reference Counting with Frame Limited Reuse
Anton Lorenzen, Daan Leijen
Optimizing Reference Counting with Borrowing
Master Thesis
supervised by Daan Leijen and Heiko Röglin
[extended pdf]
Natural Language Proof Assistants
Web-Naproche
Anton Lorenzen, Peter Koepke
Beautiful Formalizations in Isabelle/Naproche
Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Erik Sturzenhecker
The Isabelle/Naproche Natural Language Proof Assistant
Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Makarius Wenzel
A Natural Formalization of the Mutilated Checkerboard Problem in Naproche
Adrian De Lon, Peter Koepke, Anton Lorenzen
Dealing with Soft Types in Naproche’s Logical Backend
Adrian De Lon, Peter Koepke, Anton Lorenzen
Interpreting Mathematical Texts in Naproche-SAD
Adrian De Lon, Peter Koepke, Anton Lorenzen
ForTheL for Type Theory
Adrian De Lon, Peter Koepke, Anton Lorenzen
OxCaml's Modes, Adjoint Natural Deduction, and Back
Anton Lorenzen
Lecture Notes for Frank Pfenning's course at OPLSS
Nicholas Coltharp, Anton Lorenzen, Wesley Nuzzo, Xiaotian Zhou
Simplified Logical Relation for FIP and Perceus
Anton Lorenzen