## On pattern matching, computation and (geometric) dependent type theory

Pattern matching is an ubiquitous tool in theoretical computer science and type-theoretical mathematics, as well as the formalization of formal languages themselves. We briefly review its role in these subjects, giving examples along the way. We then motivate a deeper connection between pattern matching and higher-dimensional geometry, and suggest how geometric type theory, while not a real type theory yet, tries to provide a general formal framework in which mathematics can be built from higher-dimensional patterns. → read note