|
definition:
|
isPattern :: Eq f => TRS f -> Term f -> Bool
isPattern _ (TermVar _) = False
isPattern trs t@(TermCons _ ts) = isRedex trs t && all isVarOrCons ts
where
isVarOrCons (TermVar _) = True
isVarOrCons t'@(TermCons _ ts') = not (isRedex trs t') && all isVarOrCons ts'
|
|
demand:
|
argument 3
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Checks whether a term is a pattern, i.e., an root-reducible term
--- where the argaccording to the given term rewriting
--- system.
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,{TermVar}) |-> {False} || (_,_,{TermCons}) |-> _}
|
|
name:
|
isPattern
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Eq a => [(Rewriting.Term.Term a, 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
|