The field of programming language theory is witnessing significant developments, with a focus on enhancing the expressiveness and efficiency of programming languages. Researchers are exploring new approaches to static verification, dependent type theory, and resource-aware programming, leading to innovative solutions for ensuring program correctness and optimizing resource utilization. Notably, the concept of gradual verification is being expanded to support more intuitive specifications of complex data structures. Moreover, the integration of functorial type formers and adapters is enabling more precise and systematic type casts. The application of categorical semantics and abstract machines is also providing new insights into the complexity of programming languages. Overall, these advancements are paving the way for more robust, efficient, and expressive programming languages. Noteworthy papers include: Increasing the Expressiveness of a Gradual Verifier, which introduces an extension to Gradual C0 that supports unfolding expressions for recursive heap data structures. AdapTT: Functoriality for Dependent Type Casts, which proposes a type theory that systematically formalizes the idea of functorial type formers and adapters. Higher-Order Behavioural Conformances via Fibrations, which develops a uniform categorical approach to establishing behavioural equivalence of programs in higher-order languages.