| definition: |
fromRule :: QName -> CRule -> (Rule QName, TRS QName)
fromRule fn (CRule ps rhs) = let (ts, subs) = unzip (map (fromPattern fn) ps)
(r, sub, trs) = fromRhs fn rhs
sub' = foldr composeSubst emptySubst (sub:subs)
in ((TermCons fn ts, applySubst sub' r), trs)
|
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Transforms an abstract curry rule for the function with the given name --- into a pair of a rule and a term rewriting system. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{CRule}) |-> {(,)}}
|
| name: |
fromRule |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
(String, String) -> AbstractCurry.Types.CRule -> ((Rewriting.Term.Term (String, String), 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 |