2

A row polymorphism design for set-theoretic types that keeps substitutions simple by allowing Boolean combinations of row variables directly in record type constructors, with a complete tallying algorithm and an implementation in SSTT and MLsem. Accepted at OOPSLA 2026 (to appear).

Most dynamic languages allow users to turn text into code using various functions, often named `eval`, with language-dependent semantics. The widespread use of these reflective functions hinders static analysis and prevents compilers from performing …