An Option value is usually used with pattern matching, as in the previous example.

Two basic models of data analysis are pattern matching and explanation building.

Note that the expression is actually an example of pattern matching (see below).

Pattern matching is a family of tools for finding similar objects in different sources.

Many processes operate beyond the simple pattern matching of the individual characters.

It was the first language to support inductive families and dependent pattern matching.

This is pattern matching and is similar to select case but not the same.

This template is based on join-calculus and use pattern matching.

The second line relies on pattern matching, an important feature of Haskell.

The computer solved a sudoku puzzle and other pattern matching problems.

Pattern matching requires using past experience, logic, or theory before the job begins to specify what we expect to find.

The constant defines the case for when the second argument is the successor of some other number (see pattern matching).

This process was based on simple pattern matching.

Pattern matching may be seen as a more sophisticated alternative to both if-then-else, and case statements.

It was one of the first programming languages to support list comprehensions and pattern matching.

Even the planning step is commonly done by pattern matching or some similar technique which does not involve keeping alternatives.

The system as it was initially conceived involved pattern matching of cloud features with a development and decay model.

By far the most common form of pattern matching involves strings of characters.

While both focus on pattern matching, they differ in important design points such as time pressure, tile manipulation and match criteria.

Pattern matching is used to match on the different constructors of algebraic data types.

Pattern matching allows complicated transformations to be represented clearly and succinctly.

Pattern matching is checking if a certain pattern is present.

However, additional concepts such as type annotations and pattern matching, hide this similarity.

The problem of coloring a graph has found a number of applications, including pattern matching.

Provides utilities for pattern matching strings using regular expressions.