CurryInfo: searchtree-3.0.0 / Control.SearchTree.diagStrategy

definition:
diagStrategy :: Strategy a
diagStrategy st = values (diagonal (levels [st]))
demand:
no demanded arguments
deterministic:
deterministic operation
documentation:
--- Diagonalization search strategy.
failfree:
_
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_) |-> _}
name:
diagStrategy
precedence:
no precedence defined
result-values:
_
signature:
SearchTree a -> Control.ValueSequence.ValueSequence a
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term