A parallel computation with early termination property is a special form of a parallel
loop. This paper devises a generic highlevel approach for such computation which is expressed as a scheme for algorithmic skeletons. We call this scheme
, in similarity with the
paradigm. The implementation is concise and relies heavily on laziness. Two case studies from computational number theory support our presentation.