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 --
Such actions, called eliminators, are defined below.
If a perfect eliminator exists each time the select action procedure is called, then the size of the tree automaton will be linear in the total number of actions.
In section 4 we give a technical characterization of eliminators, together with the ('by') construct which supports their use, whether primitive or user-defined.
As a tie-breaker, a top-down, left-toright order of selecting maximal eliminators is followed.
It is easy to extract these eliminators from programs like compare above.
We put the targets first, so that an elimination operator is a function from targets to eliminators.
We shall present more sophisticated examples in section 6, where we develop an idiom for constructing non-standard eliminators by first-order programming.
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.
