Logics for extensional, locally complete analysis via domain refinements -- Clustered Relational Thread-Modular Abstract Interpretation with Local Traces -- Adversarial Reachability for Program-level Security Analysis -- Automated Grading of Regular Expressions -- Builtin Types viewed as Inductive Families -- Pragmatic Gradual Polymorphism with References -- Modal crash types for intermittent computing -- Gradual Tensor Shape Checking -- A Type System for Effect Handlers and Dynamic Labels -- Interpreting Knowledge-based Programs -- Contextual Modal Type Theory with Polymorphic Contexts -- A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests -- Quorum Tree Abstractions of Consensus Protocols -- MAG π : Types for Failure-Prone Communication -- System $Fˆ\mu \omega$ with Context-free Session Types -- Safe Session-Based Concurrency with Shared Linear State -- Bunched Fuzz: Sensitivity for Vector Metrics -- Fast and Correct Gradient-Based Optimisation for Probabilistic Programmingvia Smoothing -- Type-safe Quantum Programming in Idris -- Automatic Alignment in Higher-Order Probabilistic Programming Languages.