|
definition:
|
grep :: Data a => RE a -> [a] -> Bool
grep r s = _ ++ sem r ++ _ =:= s
|
|
demand:
|
argument 3
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
-- A constraint similar to Unix's grep (i.e., to check whether a regular
-- expression is contained somewhere in a string) can be defined
-- as follows:
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> _}
|
|
name:
|
grep
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Data a => RE a -> [a] -> Prelude.Bool
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|