Fri Nov 12, 11-12, 4549 BH.

Higher-Order Patterns

C. Barry Jay
University of Technology, Sydney

The higher-order pattern calculus supports patterns as inputs and
outputs, just as higher-order functional languages support
functions. The resulting pattern polymorphic functions take arguments
for both patterns, which describe where the data is, and functions,
which describe how to act on data. The calculus is strongly-typed and
reduction is type-safe and confluent.

Host:  Jens Palsberg