Michael Vollmer

Michael Vollmer

Auto-generated profile, based on publicly available information

Michael Vollmer

University of Kent, Canterbury, United Kingdom

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2022
Verified
Book Chapter
Open access
PDF file
DMDanielle Marshall
Danielle Marshall
MVMichael Vollmer
Michael Vollmer
DODominic Orchard
Dominic Orchard
Substructural type systems are growing in popularity because they allow for a resourceful interpretation of data which can be used to rule out various software bugs. Indeed, substructurality is finally taking hold in modern programming; Haskell now has linear types roughly based on Girard’s linear logic but integrated via graded function arrows, Clean has uniqueness types designed to ensure that values have at most a single reference to them, and Rust has an intricate ownership system for guaranteeing memory safety. But despite this broad range of resourceful type systems, there is comparatively little understanding of their relative strengths and weaknesses or whether their underlying frameworks can be unified. There is often confusion about whether linearity and uniqueness are essentially the same, or are instead ‘dual’ to one another, or somewhere in between. This paper formalises the relationship between these two well-studied but rarely contrasted ideas, building on two distinct bodies of literature, showing that it is possible and advantageous to have both linear and unique types in the same type system. We study the guarantees of the resulting system and provide a practical implementation in the graded modal setting of the Granule language, adding a third kind of modality alongside coeffect and effect modalities. We then demonstrate via a benchmark that our implementation benefits from expected efficiency gains enabled by adding uniqueness to a language that already has a linear basis.

20 June 2024
Verified
Conference Paper
Open access
CKChaitanya S. Koparkar
Chaitanya S. Koparkar
VSVidush Singhal
Vidush Singhal
AGAditya Gupta
Aditya Gupta
MRMike Rainey
Mike Rainey
MVMichael Vollmer
Michael Vollmer
RNRyan R. Newton
Ryan R. Newton
Over the years, traditional tracing garbage collectors have accumulated assumptions that may not hold in new language designs. For instance, we usually assume that run-time objects do not hold addressable sub-parts and have a size of at least one pointer. These fail in systems striving to eliminate pointers and represent data in a dense, serialized form, such as the Gibbon compiler. We propose a new memory management strategy for language runtimes with mostly serialized heaps. It uses a hybrid, generational collector, where regions are bump-allocated into the young generation and objects are bump-allocated within those regions. Minor collections copy data into larger regions in the old generation, compacting it further. The old generation uses region-level reference counting. The resulting system maintains high performance for data traversal programs, while significantly improving performance on other kinds of allocation patterns.

25 November 2025
Verified
Book Chapter
Closed access
PDF file
VLVilem-Benjamin Liepelt
Vilem-Benjamin Liepelt
DMDanielle Marshall
Danielle Marshall
DODominic Orchard
Dominic Orchard
VRVineet Rajani
Vineet Rajani
MVMichael Vollmer
Michael Vollmer

17 August 2026 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
MRMichael Rainey
Michael Rainey
MBMichael H. Borkowski
Michael H. Borkowski
MVMichael Vollmer
Michael Vollmer
CKChaitanya S. Koparkar
Chaitanya S. Koparkar
MKMikah Kainen
Mikah Kainen
VSVidush Singhal
Vidush Singhal
Functional programming languages support non-destructive updates via structural sharing, creating a funda-mental tradeoff in memory representation: pointer-based heaps preserve sharing but degrade layout locality, while serialized heaps prioritize locality at the cost of duplication. Gibbon addresses this tradeoff by using adaptive serialization: as the program updates its heap, the memory manager improves locality through serialization, falling back to indirection where sharing is unavoidable. In this work, we formalize key parts of Gibbon’s memory model, including the statics and dynamics of adaptive serialization. We then present a unified, type-directed memory model with two realizations: location-addressable memory (LAM) for local execution and content-addressable memory (CAM) for persistence and distributed deduplication. The key abstraction in both models is a notion of explicit boundary datatypes mediating between sharing and serialization. In LAM, boundaries facilitate adaptive serialization and enable our soundness proofs. In CAM, the same boundaries enable an efficient chunking policy, whereby candidate chunk points are selected via rolling-hash cuts. We establish efficiency via a static bound on the number of tokens between consecutive boundaries, bounding reserialization costs. We work in the purely functional setting, where structural sharing is observationally transparent and content-addressed identity is well defined. We formalize both models with operational semantics and prove soundness with respect to ordinary functional values. For CAM, we prove a locality theorem: the work required for an update scales with the depth of the modified path rather than the size of the value. Consequently, large persistent values can be updated incrementally, with unchanged substructures shared automatically across versions and across machines. Together, these results show that a single boundary discipline can unify local structural sharing and distributed deduplication within one type-theoretic foundation.

23 June 2026
Verified
Conference Paper
Open access
AJArthur Jamet
Arthur Jamet
MVMichael Vollmer
Michael Vollmer