|
definition:
|
defTreesL :: Eq f => [TRS f] -> [DefTree f]
defTreesL = defTrees . concat
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Returns a list of definitional trees for a list of term rewriting systems.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_) |-> {.._#lambda508}}
|
|
name:
|
defTreesL
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
Prelude.Eq a => [[(Rewriting.Term.Term a, Rewriting.Term.Term a)]]
-> [DefTree a]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|