In this paper we revisit the lambda-calculus with patterns, originating from the practice of functional programming language design. We treat this feature in a framework ranging from pure lambda-calculus to orthogonal combinatory reduction systems.