CurryInfo: rewriting-3.0.0 / Rewriting.Term.isConsTerm

definition:
isConsTerm :: Term _ -> Bool
isConsTerm (TermVar _)    = False
isConsTerm (TermCons _ _) = True
demand:
argument 1
deterministic:
deterministic operation
documentation:
--- Checks whether a term is a constructor term.
failfree:
_
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{({TermVar}) |-> {False} || ({TermCons}) |-> {True}}
name:
isConsTerm
precedence:
no precedence defined
result-values:
{False,True}
signature:
Term a -> Prelude.Bool
solution-complete:
operationally complete operation
terminating:
yes
totally-defined:
reducible on all ground data terms