|
definition:
|
sem :: RE a -> [a]
sem (Lit c) = [c]
sem (Alt a b) = sem a ? sem b
sem (Conc a b) = sem a ++ sem b
sem (Star a) = [] ? sem (Conc a (Star a))
|
|
demand:
|
argument 1
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- The semantics of regular expressions can be defined as a nondeterministic
--- operation associating any word of the language defined by the regular
--- expression:
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({Lit}) |-> {:} || ({Alt}) |-> _ || ({Conc}) |-> _ || ({Star}) |-> _}
|
|
name:
|
sem
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
RE a -> [a]
|
|
solution-complete:
|
operationally complete operation
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|