Functional programming languages typically support expressive pattern-matching syntax that allows programmers to write concise, expressive, and type-safe code for manipulating algebraic data types. Many features have been proposed to enhance the expressiveness of pattern-matching syntax, such as pattern bindings, pattern alternatives (a.k.a. disjunction), pattern conjunction, view patterns, pattern guards, pattern synonyms, active patterns, ‘if-let’ patterns, multi-way if-expressions, etc. In this paper, we propose a new framework for expressing pattern-matching code in a way that is both more expressive and (we argue) more readable than previous alternatives. Our syntax subsumes many proposed pattern matching extensions by enabling the expression of parallel and nested matches interleaved with computations and intermediate bindings. This is achieved through a form of nested multi-way if-expressions with a condition-splitting mechanism to factor common conditional prefixes as well as a binding technique we call conditional pattern flowing. We motivate this new syntax with many examples in the setting of MLscript, a new ML-family programming language. We describe a straightforward desugaring pass from our rich source syntax into a minimal core syntax that only supports flat pattern matching (i.e., without nested patterns) along with an intuitive small-step semantics for the core syntax. We also formalize a translation from the core syntax into a normalized syntax without backtracking that is more amenable to type checking, coverage checking, and compilation. We then formally prove that our translation preserves the semantics of the core syntax. We view this work as a step towards rethinking pattern-matching to make it more expressive and readable. Our syntax could easily be integrated, in part or in whole, into existing as well as future programming language designs.