The field of program synthesis is witnessing a significant shift towards leveraging constraints and combinatorial methods to tame the large space of possible programs. Recent advances in inductive logic programming and constraint solvers are enabling the efficient propagation and solving of constraints, leading to a substantial reduction in program space enumeration time. Furthermore, the community is moving towards a more unified framework for programming paradigms, with a focus on compositional reconstruction and mathematical frameworks such as Type theory and Category theory. Noteworthy papers in this area include: Modelling Program Spaces in Program Synthesis with Constraints, which introduces a solver that efficiently propagates and solves syntactic constraints to model program spaces. From Provable Correctness to Probabilistic Generation: A Comparative Review of Program Synthesis Paradigms, which provides a comprehensive narrative of progress and ongoing challenges in program synthesis. A DbC Inspired Neurosymbolic Layer for Trustworthy Agent Design, which adapts Design by Contract principles to introduce a contract layer that mediates every Large Language Model call. If-T: A Benchmark for Type Narrowing, which provides a language-agnostic design benchmark for type narrowing that characterizes the abilities of implementations using simple programs. A Type System for Data Privacy Compliance in Active Object Languages, which proposes a language-based approach to privacy integration, combining static and runtime techniques to ensure data privacy compliance. A Compositional Framework for On-the-Fly LTLf Synthesis, which introduces a compositional on-the-fly synthesis framework that integrates the strengths of both compositional and incremental approaches.