CurryInfo: rewriting-3.0.0 / Rewriting.Rules.isLeftNormal
definition: 
|
isLeftNormal :: TRS _ -> Bool isLeftNormal = all (isNormal . fst) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Checks whether a term rewriting system is left-normal. |
|
failfree:
|
() |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{() |-> {.._#lambda508}}
|
|
name:
|
isLeftNormal |
|
precedence:
|
no precedence defined |
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
[(Rewriting.Term.Term a, Rewriting.Term.Term a)] -> Prelude.Bool |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |