CurryInfo: regexp-4.1.0 / RegExpEff.eps

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