|
definition:
|
conc :: (Semiring s, CGFunction s, Ord c, Eq s) => [Int] -> Reg c s -> Reg c s
-> Reg c s
conc l p q = Reg {emptyRe = emptyRe p * emptyRe q,
final = final p * emptyRe q + final q, cg = l, reg = Seq p q}
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- αβ
|
|
failfree:
|
(_, _, _, _, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_,_,_,_) |-> {Reg}}
|
|
name:
|
conc
|
|
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 -> Reg a b
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|