| definition: |
genNat :: SearchTree Int
genNat = Or (Value 1)
(Or (valsTo genNat (\n -> Value (2*n)))
(valsTo genNat (\n -> Value (2*n+1))))
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Generates a search tree for positive natural numbers: |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {Or}}
|
| name: |
genNat |
| precedence: |
no precedence defined |
| result-values: |
{Or}
|
| signature: |
Control.SearchTree.SearchTree Prelude.Int |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |