You Have Mail: Set-Theoretic Types for Actors
Giuseppe Castagna, Luca Padovani, Daniele Varacca, Amine Nasri
Abstract
We present a type system for the processes of Elixir, a dynamic language based on the actor model whose static type system covers only its functional core. Each process is typed by pid(t), where the ``interface'' t is the type of the messages the process expects in its mailbox: sends are checked against the recipient's interface, and receives rely on the interface of the process that performs them. One of the difficulties of typing Elixir is that mailboxes are implicit: a function shipped in a message may evaluate self() and execute receive instructions, and both refer to whichever process eventually runs the function---self() returns that process's pid, receive reads that process's mailbox---so the mailbox they act on is not known where the function is written. We solve this problem by inferring, for every function, bounds on the type of the mailboxes it can be used with; as a result, the system types higher-order functions that travel in messages even when they contain reference to self() and receive instructions. The only new annotation the programmer writes is the interface of each spawned process; everything else is inferred by reusing the existing subtyping and constraint-resolution machinery of Elixir, and the system is proved sound. For legacy code, the interface can be reconstructed from the receive clauses: what the branches do with their messages bounds it from above, and the most permissive solution is sharp enough to recover received pids and closures.
Create a lesson
Related papers
Sightline: Calibrated Data-Flow Summaries for LLM-Integrated Applications
Zihao Xu, Yuekang Li, Ruitao Feng et al.
Tenon: A Unified Programming Framework for Retargetable PIM Compilation
Niansong Zhang, Shiran Guo, Zhiru Zhang
Mode Inference for Substructural Adjoint Types
Sophia Roshal, Frank Pfenning
A Principled Approach to Concurrency, Nondeterminism, and Asynchrony in Choreographies
Xueying Qin, Marco Peressotti, Fabrizio Montesi
Validating Concurrent Correctness Witnesses with Ghosts by Thread-Modular Abstract Interpretation
Michael Schwarz, Zhendong Ang, Umang Mathur
When Is Program Structure Required? Certificate-Grounded Calibration of Program-Induction Difficulty
Wenzhang Du