|
definition:
|
fromFuncDecl :: CFuncDecl -> (QName, TRS QName)
fromFuncDecl (CFunc fn _ _ _ rs) =
let (trs, trss) = unzip (map (fromRule fn) rs)
cond = if elem condQName (concatMap rCons trs) then condTRS else []
in (fn, trs ++ concat trss ++ cond)
fromFuncDecl (CmtFunc _ fn a v t rs) = fromFuncDecl (CFunc fn a v t rs)
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Transforms an abstract Curry function declaration into a pair with
--- function name and corresponding term rewriting system.
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({CFunc}) |-> {(,)} || ({CmtFunc}) |-> {(,)}}
|
|
name:
|
fromFuncDecl
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{(,)}
|
|
signature:
|
AbstractCurry.Types.CFuncDecl
-> ((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
|