|
definition:
|
phiRStrategy :: Eq f => Int -> RStrategy f
phiRStrategy n trs t =
let dts = defTrees trs
in case loDefTrees dts t of
Nothing -> []
Just (_, []) -> []
Just (p, dts'@(dt:_)) ->
case phiRStrategy' n dts (t |> p) (fromDefTrees dt n dts') of
Nothing -> []
Just p' -> [p .> p']
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- The reduction strategy phi. It uses the definitional tree with the given
--- index for all constructor terms if possible or at least the first one.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> {:,[]}}
|
|
name:
|
phiRStrategy
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{:,[]}
|
|
signature:
|
Prelude.Eq a => Prelude.Int -> [(Rewriting.Term.Term a, Rewriting.Term.Term a)]
-> Rewriting.Term.Term a -> [[Prelude.Int]]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|