Pattern matching is a fundamental feature of functional programming languages that is also being adopted by mainstream object-oriented languages, such as Java and Python. In this talk, I will discuss recent improvements and simplifications we proposed for pattern matching syntax. I will also present our ongoing follow-up work: we propose “composable recursive patterns and transformations”, a new way of writing data-oriented code that can be compiled efficiently and integrates well with structural types and subtyping, making writing such code safer, more modular, and more efficient.