|
definition:
|
renameSymbolInRule :: (QName -> QName) -> Rule -> Rule
renameSymbolInRule ren (Rule ps rhs ds) =
Rule (map (renameSymbolInPat ren) ps)
(renameSymbolInRhs ren rhs)
(map (renameSymbolInLocal ren) ds)
|
|
demand:
|
argument 2
|
|
deterministic:
|
deterministic operation
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{Rule}) |-> {Rule}}
|
|
name:
|
renameSymbolInRule
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{Rule}
|
|
signature:
|
((String, String) -> (String, String)) -> AbstractHaskell.Types.Rule
-> AbstractHaskell.Types.Rule
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|