| definition: |
someSearchTree :: a -> SearchTree a |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
Internal operation to return the search tree for some expression. Note that this operation is not purely declarative since the ordering in the resulting search tree depends on the ordering of the program rules. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> _}
|
| name: |
someSearchTree |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
a -> SearchTree a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |