SRFI 262 introduces a portable, extensible pattern matching construct for Scheme. This talk will begin by briefly introducing the concept of pattern matching, and how it has been expressed in Scheme previously. The main part of the talk will explain how the new pattern matcher improves on previous designs and provides a modern, flexible tool for expressing this idiom in the Scheme programs of today. I will show how macro features already familiar to Schemers can be used to implement extensions; and how you can use it to write code which is efficient at run time, perspicuous to other programmers, and propitious for reasoning about correctness.

Only a basic knowledge of Scheme is required for this presentation.

https://srfi.schemers.org/srfi-262/srfi-262.html https://codeberg.org/dpk/extensible-match