CurryInfo: rewriting-3.0.0 / Rewriting.Term.isNormal
definition: 
|
isNormal :: Term _ -> Bool isNormal (TermVar _) = True isNormal (TermCons _ []) = True isNormal (TermCons c (t:ts)) = case t of TermVar _ -> all isVarTerm ts TermCons _ _ -> isNormal t && isNormal (TermCons c ts) |
|
demand:
|
argument 1 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Checks whether a term is normal (behind a variable is not a constructor). |
|
failfree:
|
_ |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{({TermVar}) |-> {True} || ({TermCons}) |-> _}
|
|
name:
|
isNormal |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
Term a -> Prelude.Bool |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |