0 a part of a competition in any game or sport where one person or team plays against another to decide which of them will continue to the next stage and which will be removed from the competition
These dispatch functions are never actually applied; in most cases, the dead-code eliminator will remove them.
The -construct splits a programming problem into subproblems given an arbitrary eliminator.
In the absence of perfect eliminators, the following heuristics can be used.
A key point of this paper is that the types of eliminators give an abstract interface to pattern analysis, whatever the actual patterns are.
So we are looking for maximal eliminators, ideally perfect ones.
A test is a perfect eliminator if it is an eliminator of k - 1 sequences.
However, practice has shown that eliminators are rather cumbersome to use, whereas case-expressions and fixpoint expressions lead to more concise and readable definitions.
Although eliminators are higher-order functions, section 6 introduces a first-order programming idiom for constructing and working with them - this is our notion of views.
