| definition: |
times :: [Int] -> Int -> Int -> RegExp a -> RegExp a times _ n m r = [Times (n,m) r] |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- α{n,m}
|
| failfree: |
(_, _, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_) |-> {:}}
|
| name: |
times |
| precedence: |
no precedence defined |
| result-values: |
{:}
|
| signature: |
[Prelude.Int] -> Prelude.Int -> Prelude.Int -> [ORegExp a] -> [ORegExp a] |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |