SRFI 204: Wright-Cartwright-Shinn Pattern Matcher
status: draft (2020-07-15)
keywords: Pattern MatchingSee also SRFI 200: Pattern Matching and SRFI 201: Syntactic Extensions to the Core Scheme Bindings.
AbstractPattern matching is a way of decomposing a compound data structure
into its component parts and assigning those parts to variables. This
SRFI describes a pattern-matching library which is already in use by
several scheme implementations which is able to match many common
compound data structures.