One total round of the serial search: a converged form (step c = {c}) returns
itself, any other advances by picking from the step's output (a canonical sort +
head?, or a directional tie-breaker), and failure — an empty pick, or an already
failed search — is none. Convergence and failure are both fixed points, so the
n-round search is literally Function.iterate of this map.
- hsStep step pick oc = oc.bind fun (c : C) => if step c = {c} then some c else pick (step c)
Used by iterateGen, hsStep_none, hsStep_some, isFixedPt_hsStep_of_converged, isFixedPt_hsStep_none