| definition: |
dtPattern :: DefTree f -> Term f dtPattern (Leaf (l, _)) = l dtPattern (Branch pat _ _) = pat dtPattern (Or pat _) = pat |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Returns the pattern of a definitional tree. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Leaf}) |-> _ || ({Branch}) |-> _ || ({Or}) |-> _}
|
| name: |
dtPattern |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
DefTree a -> Rewriting.Term.Term a |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |