| definition: |
rep :: (Semiring s, CGFunction s, Ord c, Eq s) => [Int] -> Reg c s -> Reg c s
rep l r = Reg {emptyRe = one, final = newcg (final r) l, cg = l,
reg = Rep r}
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
-- α* |
| failfree: |
(_, _, _, _, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_,_,_) |-> {Reg}}
|
| name: |
rep |
| precedence: |
no precedence defined |
| result-values: |
{Reg}
|
| signature: |
(Semiring b, CGFunction b, Prelude.Ord a, Prelude.Eq b) => [Prelude.Int] -> Reg a b -> Reg a b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |