wiki:FirstPrinciples/PatternMatching

Pattern Matching

Pattern matching on Algebraic Data Types with checking for exhaustiveness, implicit destructuring (with local bindings) and optional guards (boolean expressions on mathed parts) was (and still is) a major innovation in the realm of functional programming, championed by the ML family of languages.

It is also possible to pattern-match on structured values - values, which have it own structure, such as tuples, records, lists, nodes of a tree, etc, etc.


see also Algebraic Data Types

Last modified 2 years ago Last modified on Oct 5, 2018, 12:11:46 PM
Note: See TracWiki for help on using the wiki.