Dynamic Patterns

Abstract

This chapter simplifies the conceptual framework of pattern calculus by identifying the syntactic classes of patterns and terms, and of constructors and symbols. Now patterns are first-class entities that may be passed as parameters, evaluated and returned as results. Since variable scope is required to be static, this requires that symbol binding be handled separately from pattern formation. Also, extra care is required to ensure confluence of reduction. Examples include generic functions for equality, elimination, and for string matching. Wildcards and views are also considered.