CurryInfo: rewriting-3.0.0 / Rewriting.Files.fromRhs
definition: 
|
fromRhs :: QName -> CRhs -> (Term QName, Subst QName, TRS QName) fromRhs fn (CSimpleRhs e _) = fromExpr fn e fromRhs fn (CGuardedRhs gs _) = fromGuard fn gs |
|
demand:
|
argument 2 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Transforms an abstract Curry right-hand side of a rule for the function with the given name into a tuple of a term, a substitution and a term rewriting system. |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,{CSimpleRhs}) |-> {(,,)} || (_,{CGuardedRhs}) |-> {(,,)}}
|
|
name:
|
fromRhs |
|
precedence:
|
no precedence defined |
|
result-values:
|
{(,,)}
|
|
signature:
|
(String, String) -> AbstractCurry.Types.CRhs -> (Rewriting.Term.Term (String, String), Data.Map.Map Prelude.Int (Rewriting.Term.Term (String, String)), [(Rewriting.Term.Term (String, String), Rewriting.Term.Term (String, String))]) |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |