|
definition:
|
lessDSpecific :: DTerm -> DTerm -> Bool
lessDSpecific DBot _ = True
lessDSpecific CutVar t = t==CutVar
lessDSpecific (DCons c1 args1) t2 = case t2 of
DCons c2 args2 -> c1==c2 && all (uncurry lessDSpecific) (zip args1 args2)
_ -> False
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- is abstract term t1 a generalization (i.e., with less information) than t2?
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({DBot},_) |-> {True} || ({CutVar},_) |-> _ || ({DCons},{DCons}) |-> _ || ({DCons},{DBot}) |-> _ || ({DCons},{CutVar}) |-> _}
|
|
name:
|
lessDSpecific
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
DTerm -> DTerm -> Prelude.Bool
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|