Fri 28 Aug 2026 11:00 - 11:30 at IP139 Kelley - Types and Semantics

This paper formalises Erlang references as an extension to an existing formal semantics of Core Erlang mechanised in Rocq. We define reference generation based on the evaluation state, rather than relying on a registry of previously generated references. The main advantage of this approach is that it requires considerably less modifications to the existing semantics than the registry-based approach. We argue that references generated this way are sufficiently unique because freshly generated references are guaranteed to be distinct from all references available in the evaluation state at the point of generation. Finally, we present two case studies evaluating our semantics, discuss the advantages and pitfalls of our semantics, and highlight potential enhancements and alternative approaches to formalise references. We also mechanise our results in Rocq.

Slides of 'A Mechanised Semantics of Erlang’s References by Lukács et al.' (slides_A Mechanised Semantics of Erlang’s References_by_Lukacs_et_al.pdf)666KiB

Fri 28 Aug

Displayed time zone: Eastern Time (US & Canada) change

11:00 - 12:30
Types and SemanticsErlang at IP139 Kelley
11:00
30m
Talk
A Mechanised Semantics of Erlang’s ReferencesRemote
Erlang
Dániel Lukács Eötvös Loránd University, Péter Bereczky Eötvös Loránd University, Dániel Horpácsi Eötvös Loránd University
Link to publication DOI File Attached
11:30
30m
Talk
Set-Theoretic Type Checking of Beginner Erlang Code: A Retrospective StudyRemote
Erlang
Albert Schimpf University of Kaiserslautern-Landau, Stefan Wehr Offenburg University of Applied Sciences, Annette Bieniusa RPTU Kaiserslautern-Landau
DOI
12:00
30m
Talk
Towards Exact Semantic Equivalence of Erlang BEAM Constructs: Lessons from Advanced Emulation and DecompilationRemote
Erlang
Gregory Morse Eötvös Loránd University (ELTE), Melinda Tóth Eötvös Loránd University
Link to publication DOI File Attached