| definition: |
match :: Data a => RE a -> [a] -> Bool match r s = sem r =:= s |
| demand: |
arguments 2 3 |
| deterministic: |
possibly non-deterministic operation |
| documentation: |
--- An operation to match a string against a regular expression --- can be defined by the following constraint: |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
match |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Data a => RE a -> [a] -> Prelude.Bool |
| solution-complete: |
operationally complete operation |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |