User:Barry Jay Sydney/sandbox

In mathematical logic, pattern calculus is a formalism that extends lambda calculus with abilities to match patterns against an arbitrary compound data structure (path polymorphism) and to include free variables in patterns (pattern polymorphism).